From bd63444845673c2aca3c4adff2775f97dd4ac8f5 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Mon, 11 Oct 2021 13:17:40 +0800 Subject: [PATCH 1/8] =?UTF-8?q?273:=E6=95=B4=E6=95=B0=E8=BD=AC=E6=8D=A2?= =?UTF-8?q?=E8=8B=B1=E6=96=87=E8=A1=A8=E7=A4=BA?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../editor/cn/IntegerToEnglishWords.java | 96 +++++++++++++++++++ .../cn/doc/content/IntegerToEnglishWords.md | 40 ++++++++ 2 files changed, 136 insertions(+) create mode 100644 src/main/java/leetcode/editor/cn/IntegerToEnglishWords.java create mode 100644 src/main/java/leetcode/editor/cn/doc/content/IntegerToEnglishWords.md diff --git a/src/main/java/leetcode/editor/cn/IntegerToEnglishWords.java b/src/main/java/leetcode/editor/cn/IntegerToEnglishWords.java new file mode 100644 index 0000000..c87f0ce --- /dev/null +++ b/src/main/java/leetcode/editor/cn/IntegerToEnglishWords.java @@ -0,0 +1,96 @@ +//将非负整数 num 转换为其对应的英文表示。 +// +// +// +// 示例 1： +// +// +//输入：num = 123 +//输出："One Hundred Twenty Three" +// +// +// 示例 2： +// +// +//输入：num = 12345 +//输出："Twelve Thousand Three Hundred Forty Five" +// +// +// 示例 3： +// +// +//输入：num = 1234567 +//输出："One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven" +// +// +// 示例 4： +// +// +//输入：num = 1234567891 +//输出："One Billion Two Hundred Thirty Four Million Five Hundred Sixty Seven +//Thousand Eight Hundred Ninety One" +// +// +// +// +// 提示： +// +// +// 0 <= num <= 2³¹ - 1 +// +// Related Topics 递归 数学 字符串 👍 198 👎 0 + +package leetcode.editor.cn; + +//273:整数转换英文表示 +class IntegerToEnglishWords { + public static void main(String[] args) { + //测试代码 + Solution solution = new IntegerToEnglishWords().new Solution(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + String[] singles = {"", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine"}; + String[] teens = {"Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"}; + String[] tens = {"", "Ten", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"}; + String[] thousands = {"", "Thousand", "Million", "Billion"}; + + public String numberToWords(int num) { + if (num == 0) { + return "Zero"; + } + StringBuffer sb = new StringBuffer(); + for (int i = 3, unit = 1000000000; i >= 0; i--, unit /= 1000) { + int curNum = num / unit; + if (curNum != 0) { + num -= curNum * unit; + StringBuffer curr = new StringBuffer(); + recursion(curr, curNum); + curr.append(thousands[i]).append(" "); + sb.append(curr); + } + } + return sb.toString().trim(); + } + + public void recursion(StringBuffer curr, int num) { + if (num == 0) { + return; + } else if (num < 10) { + curr.append(singles[num]).append(" "); + } else if (num < 20) { + curr.append(teens[num - 10]).append(" "); + } else if (num < 100) { + curr.append(tens[num / 10]).append(" "); + recursion(curr, num % 10); + } else { + curr.append(singles[num / 100]).append(" Hundred "); + recursion(curr, num % 100); + } + } + } +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/IntegerToEnglishWords.md b/src/main/java/leetcode/editor/cn/doc/content/IntegerToEnglishWords.md new file mode 100644 index 0000000..f993cc9 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/IntegerToEnglishWords.md @@ -0,0 +1,40 @@ +

将非负整数 num 转换为其对应的英文表示。

+ +

 

+ +

示例 1：

+ +
+输入：num = 123
+输出："One Hundred Twenty Three"
+
+ +

示例 2：

+ +
+输入：num = 12345
+输出："Twelve Thousand Three Hundred Forty Five"
+
+ +

示例 3：

+ +
+输入：num = 1234567
+输出："One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven"
+
+ +

示例 4：

+ +
+输入：num = 1234567891
+输出："One Billion Two Hundred Thirty Four Million Five Hundred Sixty Seven Thousand Eight Hundred Ninety One"
+
+ +

 

+ +

提示：

+ + +
Related Topics
  • 递归
  • 数学
  • 字符串

  • 👍 198
  • 👎 0
    • \ No newline at end of file From 41c4021bacd96451292dc5815e224e4d93306079 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Mon, 11 Oct 2021 13:42:41 +0800 Subject: [PATCH 2/8] =?UTF-8?q?2033:=E8=8E=B7=E5=8F=96=E5=8D=95=E5=80=BC?= =?UTF-8?q?=E7=BD=91=E6=A0=BC=E7=9A=84=E6=9C=80=E5=B0=8F=E6=93=8D=E4=BD=9C?= =?UTF-8?q?=E6=95=B0?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../MinimumOperationsToMakeAUniValueGrid.java | 98 +++++++++++++++++++ src/main/java/leetcode/editor/cn/doc/all.json | 3 +- .../MinimumOperationsToMakeAUniValueGrid.md | 54 ++++++++++ .../leetcode/editor/cn/doc/translation.json | 3 +- 4 files changed, 154 insertions(+), 4 deletions(-) create mode 100644 src/main/java/leetcode/editor/cn/MinimumOperationsToMakeAUniValueGrid.java create mode 100644 src/main/java/leetcode/editor/cn/doc/content/MinimumOperationsToMakeAUniValueGrid.md diff --git a/src/main/java/leetcode/editor/cn/MinimumOperationsToMakeAUniValueGrid.java b/src/main/java/leetcode/editor/cn/MinimumOperationsToMakeAUniValueGrid.java new file mode 100644 index 0000000..b5624b8 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/MinimumOperationsToMakeAUniValueGrid.java @@ -0,0 +1,98 @@ +//给你一个大小为 m x n 的二维整数网格 grid 和一个整数 x 。每一次操作，你可以对 grid 中的任一元素 加 x 或 减 x 。 +// +// 单值网格 是全部元素都相等的网格。 +// +// 返回使网格化为单值网格所需的 最小 操作数。如果不能，返回 -1 。 +// +// +// +// 示例 1： +// +// +// +// +//输入：grid = [[2,4],[6,8]], x = 2 +//输出：4 +//解释：可以执行下述操作使所有元素都等于 4 ： +//- 2 加 x 一次。 +//- 6 减 x 一次。 +//- 8 减 x 两次。 +//共计 4 次操作。 +// +// +// 示例 2： +// +// +// +// +//输入：grid = [[1,5],[2,3]], x = 1 +//输出：5 +//解释：可以使所有元素都等于 3 。 +// +// +// 示例 3： +// +// +// +// +//输入：grid = [[1,2],[3,4]], x = 2 +//输出：-1 +//解释：无法使所有元素相等。 +// +// +// +// +// 提示： +// +// +// m == grid.length +// n == grid[i].length +// 1 <= m, n <= 10⁵ +// 1 <= m * n <= 10⁵ +// 1 <= x, grid[i][j] <= 10⁴ +// +// 👍 8 👎 0 + +package leetcode.editor.cn; + +import com.code.leet.entiy.TwoArray; + +import java.util.ArrayList; +import java.util.Collections; +import java.util.List; + +//2033:获取单值网格的最小操作数 +class MinimumOperationsToMakeAUniValueGrid { + public static void main(String[] args) { + //测试代码 + Solution solution = new MinimumOperationsToMakeAUniValueGrid().new Solution(); + TwoArray twoArray = new TwoArray("[[146]]", true); + solution.minOperations(twoArray.getArr(), 86); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int minOperations(int[][] grid, int x) { + List list = new ArrayList<>(); + int temp = grid[0][0]; + for (int[] ints : grid) { + for (int j = 0; j < grid[0].length; j++) { + if (Math.abs(ints[j] - temp) % x > 0) { + return -1; + } + list.add(ints[j]); + } + } + Collections.sort(list); + int num = list.get(list.size() / 2); + int sum = 0; + for (Integer integer : list) { + sum += Math.abs(integer - num) / x; + } + return sum; + } + } +//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 bcd50e8..9cb862a 100644 --- a/src/main/java/leetcode/editor/cn/doc/all.json +++ b/src/main/java/leetcode/editor/cn/doc/all.json @@ -1,2 +1 @@ -[{"acceptance":0.39596961817435333,"acs":57867,"articleLive":2,"columnArticles":818,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":146140,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5206123646594019,"acs":2547033,"articleLive":2,"columnArticles":14339,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4892379,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40897170223291474,"acs":1015197,"articleLive":2,"columnArticles":7211,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2482316,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38085160104201154,"acs":1259501,"articleLive":2,"columnArticles":7516,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3307065,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4087250951904948,"acs":520511,"articleLive":2,"columnArticles":3869,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1273499,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3551530233623236,"acs":747541,"articleLive":2,"columnArticles":4047,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2104842,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5070425327346437,"acs":306924,"articleLive":2,"columnArticles":2486,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":605322,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3526049411518225,"acs":844870,"articleLive":2,"columnArticles":5314,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2396081,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21721323383496716,"acs":351360,"articleLive":2,"columnArticles":2702,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1617581,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.583916317276247,"acs":778660,"articleLive":2,"columnArticles":4963,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1333513,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31616615254802094,"acs":206834,"articleLive":2,"columnArticles":1244,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":654194,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6275721689352853,"acs":542014,"articleLive":2,"columnArticles":3078,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":863668,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6646531815386044,"acs":229090,"articleLive":2,"columnArticles":1786,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":344676,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6319527625022919,"acs":472197,"articleLive":2,"columnArticles":3919,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":747203,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4096677832143713,"acs":630711,"articleLive":2,"columnArticles":3937,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1539567,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33626497932058397,"acs":665882,"articleLive":2,"columnArticles":3131,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1980230,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45909612032184943,"acs":263091,"articleLive":2,"columnArticles":1445,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":573063,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5728871213826567,"acs":343569,"articleLive":2,"columnArticles":3099,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":599715,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3987390032460244,"acs":223813,"articleLive":2,"columnArticles":1535,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":561302,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42950851860184486,"acs":524999,"articleLive":2,"columnArticles":3928,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1222325,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44497904833637325,"acs":791660,"articleLive":2,"columnArticles":5618,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1779095,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6672821086315044,"acs":723183,"articleLive":2,"columnArticles":3515,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1083774,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7725873572144888,"acs":355153,"articleLive":2,"columnArticles":2669,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":459693,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.559865098481848,"acs":329358,"articleLive":2,"columnArticles":2124,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":588281,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7031283644529207,"acs":320012,"articleLive":2,"columnArticles":2538,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":455126,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6576772620277387,"acs":233019,"articleLive":2,"columnArticles":2217,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":354306,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5389961724163482,"acs":821960,"articleLive":2,"columnArticles":4578,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1524983,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5971550152571901,"acs":487088,"articleLive":2,"columnArticles":4124,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":815681,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40588228245500513,"acs":474215,"articleLive":2,"columnArticles":3263,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1168356,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2077068091027425,"acs":111060,"articleLive":2,"columnArticles":901,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":534696,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35869003262439164,"acs":80480,"articleLive":2,"columnArticles":599,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":224372,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37315084949373606,"acs":217435,"articleLive":2,"columnArticles":1757,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":582700,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3566942344001757,"acs":193263,"articleLive":2,"columnArticles":1308,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":541817,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42759564103156095,"acs":370409,"articleLive":2,"columnArticles":2445,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":866260,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4235679282304591,"acs":347119,"articleLive":2,"columnArticles":3341,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":819512,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4631649258080423,"acs":516591,"articleLive":2,"columnArticles":3987,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1115350,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6403789910391419,"acs":205602,"articleLive":2,"columnArticles":1462,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":321063,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706135134602369,"acs":102060,"articleLive":2,"columnArticles":861,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":152189,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5804459874482575,"acs":217348,"articleLive":2,"columnArticles":2284,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":374450,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7276889195477156,"acs":339675,"articleLive":2,"columnArticles":1982,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":466786,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6229386297783691,"acs":202736,"articleLive":2,"columnArticles":1410,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":325451,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4196393995020997,"acs":166878,"articleLive":2,"columnArticles":1425,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":397670,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5813855351486494,"acs":329277,"articleLive":2,"columnArticles":2455,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":566366,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44894783155904755,"acs":171934,"articleLive":2,"columnArticles":1158,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":382971,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3282234857544033,"acs":85088,"articleLive":2,"columnArticles":553,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":259238,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4296792474975269,"acs":205012,"articleLive":2,"columnArticles":1642,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":477128,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7830350000366954,"acs":426776,"articleLive":2,"columnArticles":2734,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":545028,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6378731905359436,"acs":218078,"articleLive":2,"columnArticles":1504,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":341883,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.735168555866333,"acs":224730,"articleLive":2,"columnArticles":1898,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":305685,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6651958173779998,"acs":236076,"articleLive":2,"columnArticles":1335,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":354897,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37629523312905605,"acs":218655,"articleLive":2,"columnArticles":1293,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":581073,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7386907853667602,"acs":155015,"articleLive":2,"columnArticles":1549,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":209851,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8229780366755464,"acs":74454,"articleLive":2,"columnArticles":612,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90469,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5526696068761899,"acs":691477,"articleLive":2,"columnArticles":3819,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1251158,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48125075540872647,"acs":191122,"articleLive":2,"columnArticles":2024,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":397136,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4324732732827354,"acs":329411,"articleLive":2,"columnArticles":2526,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":761691,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4693856210758436,"acs":305241,"articleLive":2,"columnArticles":2340,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":650299,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41124997046941814,"acs":87039,"articleLive":2,"columnArticles":933,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":211645,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3761854441215951,"acs":250260,"articleLive":2,"columnArticles":2689,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":665257,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7900660540979372,"acs":128460,"articleLive":2,"columnArticles":1590,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":162594,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5241972324541875,"acs":90651,"articleLive":2,"columnArticles":959,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":172933,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41756927970953894,"acs":198735,"articleLive":2,"columnArticles":2017,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":475933,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6622289090002317,"acs":317354,"articleLive":2,"columnArticles":2445,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":479221,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3917453916068414,"acs":183785,"articleLive":2,"columnArticles":1733,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":469144,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883416425669322,"acs":271579,"articleLive":2,"columnArticles":2102,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":394541,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2695175834347221,"acs":46298,"articleLive":2,"columnArticles":642,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":171781,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45736391948151167,"acs":353197,"articleLive":2,"columnArticles":3196,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":772245,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5428762086189901,"acs":196063,"articleLive":2,"columnArticles":1794,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":361156,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5245034213369532,"acs":37866,"articleLive":2,"columnArticles":575,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72194,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39213042129266573,"acs":390527,"articleLive":2,"columnArticles":1964,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":995911,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.530032787603511,"acs":580670,"articleLive":2,"columnArticles":3624,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1095536,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4214520482056489,"acs":94632,"articleLive":2,"columnArticles":832,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":224538,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6141058229891321,"acs":178052,"articleLive":2,"columnArticles":1244,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":289937,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6044659756647138,"acs":134131,"articleLive":2,"columnArticles":987,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":221900,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4611232790988736,"acs":170955,"articleLive":2,"columnArticles":1715,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":370736,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5963225718758084,"acs":272003,"articleLive":2,"columnArticles":1883,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":456134,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4268183403903113,"acs":187191,"articleLive":2,"columnArticles":1280,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":438573,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7697274873338211,"acs":223027,"articleLive":2,"columnArticles":1314,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":289748,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015160329117332,"acs":315524,"articleLive":2,"columnArticles":2067,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":393659,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45860549685957375,"acs":226497,"articleLive":2,"columnArticles":1425,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":493882,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6167660211726452,"acs":149089,"articleLive":2,"columnArticles":1333,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":241727,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41489584128448587,"acs":125016,"articleLive":2,"columnArticles":1000,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":301319,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5306667747417054,"acs":183313,"articleLive":2,"columnArticles":1701,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":345439,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386652515604073,"acs":319749,"articleLive":2,"columnArticles":1960,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":593595,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43338991686212636,"acs":184589,"articleLive":2,"columnArticles":1167,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":425919,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5159048746999821,"acs":98446,"articleLive":2,"columnArticles":695,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":190822,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6325810482981695,"acs":120470,"articleLive":2,"columnArticles":1108,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":190442,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48743185947910356,"acs":41847,"articleLive":2,"columnArticles":312,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":85852,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5171198499564134,"acs":469822,"articleLive":2,"columnArticles":3288,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":908536,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7100933055095824,"acs":59209,"articleLive":2,"columnArticles":481,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":83382,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6336724623312124,"acs":139330,"articleLive":2,"columnArticles":1226,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":219877,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30918871066964754,"acs":164852,"articleLive":2,"columnArticles":1531,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":533176,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.548704388126999,"acs":213936,"articleLive":2,"columnArticles":2045,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":389893,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5405543002203811,"acs":155018,"articleLive":2,"columnArticles":1345,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":286776,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556623070806879,"acs":569285,"articleLive":2,"columnArticles":2334,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":753359,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.702281429593957,"acs":101059,"articleLive":2,"columnArticles":631,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":143901,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6994804542727424,"acs":164387,"articleLive":2,"columnArticles":1301,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":235013,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45592182180489277,"acs":62004,"articleLive":2,"columnArticles":548,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":135997,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35014704358706655,"acs":351472,"articleLive":2,"columnArticles":1957,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1003784,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6112976294697118,"acs":71921,"articleLive":2,"columnArticles":592,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":117653,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6021946496449831,"acs":251892,"articleLive":2,"columnArticles":1899,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":418290,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5636932991999652,"acs":415283,"articleLive":2,"columnArticles":2280,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":736718,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6419980744072085,"acs":401417,"articleLive":2,"columnArticles":2526,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":625262,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.571635575035086,"acs":175551,"articleLive":2,"columnArticles":1601,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":307103,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661922390525213,"acs":519486,"articleLive":2,"columnArticles":2579,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":678010,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7044942338079321,"acs":251012,"articleLive":2,"columnArticles":1444,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":356301,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7212898096015816,"acs":134258,"articleLive":2,"columnArticles":893,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":186136,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6972107323950839,"acs":164175,"articleLive":2,"columnArticles":1316,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":235474,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7601923840760098,"acs":193304,"articleLive":2,"columnArticles":1196,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":254283,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7631519548569126,"acs":94669,"articleLive":2,"columnArticles":732,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124050,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5634027074416528,"acs":258661,"articleLive":2,"columnArticles":1477,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":459105,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4862543779686226,"acs":273645,"articleLive":2,"columnArticles":1807,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":562761,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.526106089323501,"acs":271748,"articleLive":2,"columnArticles":1706,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":516527,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6275501186907629,"acs":181089,"articleLive":2,"columnArticles":1278,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":288565,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7259192658023806,"acs":179236,"articleLive":2,"columnArticles":1339,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":246909,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5224082800403904,"acs":62083,"articleLive":2,"columnArticles":685,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":118840,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7042218237434734,"acs":160233,"articleLive":2,"columnArticles":1231,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":227532,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6143875347741625,"acs":90769,"articleLive":2,"columnArticles":770,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":147739,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7306503729502833,"acs":217755,"articleLive":2,"columnArticles":1750,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":298029,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.667053098480544,"acs":145575,"articleLive":2,"columnArticles":1212,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":218236,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6813614679176526,"acs":180246,"articleLive":2,"columnArticles":1588,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":264538,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5735073508864141,"acs":568484,"articleLive":2,"columnArticles":3417,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":991241,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6894385232327056,"acs":466259,"articleLive":2,"columnArticles":2667,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":676288,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5366157012405098,"acs":132455,"articleLive":2,"columnArticles":823,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":246834,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44476509993047353,"acs":161206,"articleLive":2,"columnArticles":1102,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":362452,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4730526458294553,"acs":279541,"articleLive":2,"columnArticles":1843,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":590930,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3952870681229017,"acs":37206,"articleLive":2,"columnArticles":330,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94124,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46817174839320824,"acs":124051,"articleLive":2,"columnArticles":655,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":264969,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5431375513392295,"acs":172444,"articleLive":2,"columnArticles":1120,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":317496,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6824148453978369,"acs":121650,"articleLive":2,"columnArticles":1123,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":178264,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44518805820955304,"acs":130047,"articleLive":2,"columnArticles":1183,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":292117,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7231917120695671,"acs":134727,"articleLive":2,"columnArticles":877,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":186295,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4923084537715304,"acs":49733,"articleLive":2,"columnArticles":438,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101020,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.676248821866164,"acs":73185,"articleLive":2,"columnArticles":528,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":108222,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5759418482391978,"acs":126535,"articleLive":2,"columnArticles":980,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":219701,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4860960828363894,"acs":100181,"articleLive":2,"columnArticles":799,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":206093,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192868922912014,"acs":504615,"articleLive":2,"columnArticles":2284,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":701549,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7198760557749013,"acs":100828,"articleLive":2,"columnArticles":757,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":140063,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6612272570530167,"acs":113134,"articleLive":2,"columnArticles":859,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":171097,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5153184935564127,"acs":195736,"articleLive":2,"columnArticles":1216,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":379835,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48959590418723714,"acs":53552,"articleLive":2,"columnArticles":545,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109380,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5124509648958947,"acs":534945,"articleLive":2,"columnArticles":2755,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1043895,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5526950287986708,"acs":300062,"articleLive":2,"columnArticles":1748,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":542907,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6208334139405313,"acs":128366,"articleLive":2,"columnArticles":1085,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":206764,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7037929760701954,"acs":417250,"articleLive":2,"columnArticles":1852,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":592859,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7504098643990795,"acs":303925,"articleLive":2,"columnArticles":1566,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":405012,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5260295744581392,"acs":236313,"articleLive":2,"columnArticles":1392,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":449239,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6814724858714899,"acs":100447,"articleLive":2,"columnArticles":788,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":147397,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6669609420162365,"acs":212291,"articleLive":2,"columnArticles":1256,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":318296,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3411217323873231,"acs":47069,"articleLive":2,"columnArticles":514,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":137983,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5354198088486511,"acs":133833,"articleLive":2,"columnArticles":1057,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":249959,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4837251151578256,"acs":170962,"articleLive":2,"columnArticles":1433,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":353428,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.421338796200824,"acs":185518,"articleLive":2,"columnArticles":1245,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":440306,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.566925463770625,"acs":212855,"articleLive":2,"columnArticles":1512,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":375455,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5317744822654596,"acs":113779,"articleLive":2,"columnArticles":898,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":213961,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5733008458627998,"acs":289408,"articleLive":2,"columnArticles":1606,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":504810,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7238723872387238,"acs":6580,"articleLive":2,"columnArticles":113,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9090,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5334430355241506,"acs":5511,"articleLive":2,"columnArticles":82,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10331,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.591147472204741,"acs":2818,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4767,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5463331048663468,"acs":15942,"articleLive":2,"columnArticles":192,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29180,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6142802460647598,"acs":338614,"articleLive":2,"columnArticles":1982,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":551237,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3361270401411557,"acs":7620,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22670,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4974786143448395,"acs":161789,"articleLive":2,"columnArticles":1099,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":325218,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32603475067099874,"acs":9232,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28316,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6103122072735133,"acs":59290,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97147,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.519158183689809,"acs":86241,"articleLive":2,"columnArticles":922,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":166117,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3307108261301982,"acs":40900,"articleLive":2,"columnArticles":372,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":123673,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5866239609850636,"acs":295425,"articleLive":2,"columnArticles":1939,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":503602,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43253734854722975,"acs":84571,"articleLive":2,"columnArticles":754,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":195523,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646718732422694,"acs":389959,"articleLive":2,"columnArticles":2205,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":586694,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41836141778036023,"acs":8640,"articleLive":2,"columnArticles":87,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20652,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7180468197054071,"acs":107539,"articleLive":2,"columnArticles":918,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":149766,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43991325505130646,"acs":91487,"articleLive":2,"columnArticles":597,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":207966,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8045017515092793,"acs":75558,"articleLive":2,"columnArticles":631,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":93919,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.48062336229485586,"acs":38335,"articleLive":2,"columnArticles":407,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":79761,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7395144021384481,"acs":305980,"articleLive":2,"columnArticles":1471,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":413758,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35593805622778596,"acs":253566,"articleLive":2,"columnArticles":1019,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":712388,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4629287357476879,"acs":128990,"articleLive":2,"columnArticles":501,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":278639,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6033587832332438,"acs":119961,"articleLive":2,"columnArticles":671,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":198822,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096796640994524,"acs":121867,"articleLive":2,"columnArticles":966,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":297469,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48677345487006324,"acs":87793,"articleLive":2,"columnArticles":514,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":180357,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7020538730604802,"acs":164381,"articleLive":2,"columnArticles":677,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":234143,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967114311494222,"acs":181894,"articleLive":2,"columnArticles":587,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":228306,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6769941854470302,"acs":151011,"articleLive":2,"columnArticles":543,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":223061,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.476539725139975,"acs":102985,"articleLive":2,"columnArticles":677,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":216110,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49631049019266277,"acs":71228,"articleLive":2,"columnArticles":631,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":143515,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7563150074294205,"acs":7635,"articleLive":2,"columnArticles":115,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10095,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48560390537653453,"acs":43868,"articleLive":2,"columnArticles":291,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":90337,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39221697293917396,"acs":90326,"articleLive":2,"columnArticles":696,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":230296,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45058945998698763,"acs":346278,"articleLive":2,"columnArticles":1721,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":768500,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.698331842340683,"acs":132704,"articleLive":2,"columnArticles":834,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":190030,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7491387299737611,"acs":191575,"articleLive":2,"columnArticles":1206,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":255727,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35604363255760707,"acs":21771,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61147,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3250718167460485,"acs":26140,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80413,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3446246447082428,"acs":10306,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29905,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43621656019776295,"acs":35645,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":81714,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653811828622426,"acs":102142,"articleLive":2,"columnArticles":390,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":153509,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5336116228107237,"acs":94723,"articleLive":2,"columnArticles":507,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":177513,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5154811913586255,"acs":391942,"articleLive":2,"columnArticles":2701,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":760342,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6523572179797887,"acs":142664,"articleLive":2,"columnArticles":1601,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":218690,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5568462869439786,"acs":332768,"articleLive":2,"columnArticles":2131,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":597594,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5241109545540578,"acs":49844,"articleLive":2,"columnArticles":326,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95102,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.619165909247276,"acs":170987,"articleLive":2,"columnArticles":1392,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":276157,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5163583825182687,"acs":235162,"articleLive":2,"columnArticles":1677,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":455424,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37787633300275236,"acs":169555,"articleLive":2,"columnArticles":735,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":448705,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5008652072773789,"acs":114332,"articleLive":2,"columnArticles":879,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":228269,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7231833840266233,"acs":717335,"articleLive":2,"columnArticles":7391,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":991913,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5433604695693718,"acs":143301,"articleLive":2,"columnArticles":941,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":263731,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167793236638814,"acs":145489,"articleLive":2,"columnArticles":982,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":202976,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4726594335472176,"acs":196606,"articleLive":2,"columnArticles":1394,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":415957,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5423361433340539,"acs":90325,"articleLive":2,"columnArticles":677,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":166548,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4821264593991867,"acs":29402,"articleLive":2,"columnArticles":326,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":60984,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46264729777068875,"acs":62072,"articleLive":2,"columnArticles":574,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":134167,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.43306419316082523,"acs":167611,"articleLive":2,"columnArticles":1538,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":387035,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3714135926031837,"acs":31172,"articleLive":2,"columnArticles":306,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":83928,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6462675591700068,"acs":444698,"articleLive":2,"columnArticles":2316,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":688102,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7371872847449181,"acs":100601,"articleLive":2,"columnArticles":1039,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":136466,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5581920273575205,"acs":370203,"articleLive":2,"columnArticles":1726,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":663218,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5423056447596641,"acs":31579,"articleLive":2,"columnArticles":280,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58231,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42492412341574265,"acs":111444,"articleLive":2,"columnArticles":893,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":262268,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28668663700657604,"acs":64696,"articleLive":2,"columnArticles":421,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":225668,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4766437570815043,"acs":140506,"articleLive":2,"columnArticles":993,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":294782,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7815366781476719,"acs":117311,"articleLive":2,"columnArticles":880,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":150103,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5229050847888865,"acs":41104,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":78607,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41810430415230976,"acs":71592,"articleLive":2,"columnArticles":658,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":171230,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754315963737478,"acs":136269,"articleLive":2,"columnArticles":4759,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":201751,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7878741373930214,"acs":308032,"articleLive":2,"columnArticles":1872,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":390966,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43728290624574634,"acs":86739,"articleLive":2,"columnArticles":702,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":198359,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5799493670886076,"acs":57270,"articleLive":2,"columnArticles":646,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":98750,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4641229424837094,"acs":36966,"articleLive":2,"columnArticles":316,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":79647,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7416060809873064,"acs":138931,"articleLive":2,"columnArticles":874,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":187338,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5045325068525054,"acs":168975,"articleLive":2,"columnArticles":1222,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":334914,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6909507061910345,"acs":160901,"articleLive":2,"columnArticles":1279,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":232869,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4771772767462423,"acs":34540,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72384,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49650922917627954,"acs":313130,"articleLive":2,"columnArticles":2004,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":630663,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660210454406074,"acs":171589,"articleLive":2,"columnArticles":984,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":257633,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6808244111909033,"acs":260335,"articleLive":2,"columnArticles":1398,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":382382,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.848076131438119,"acs":210138,"articleLive":2,"columnArticles":1015,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":247782,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7231615305345686,"acs":139649,"articleLive":2,"columnArticles":880,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":193109,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4968125406563692,"acs":194753,"articleLive":2,"columnArticles":1331,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":392005,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4783157421331497,"acs":170168,"articleLive":2,"columnArticles":771,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":355765,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7379838859047971,"acs":31875,"articleLive":2,"columnArticles":287,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43192,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6454685721067832,"acs":293674,"articleLive":2,"columnArticles":1697,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":454978,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6559099992598624,"acs":8862,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13511,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5502848378615249,"acs":5023,"articleLive":2,"columnArticles":58,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9128,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6032298482528191,"acs":4333,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7183,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47616695480365523,"acs":5784,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12147,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5241177065426231,"acs":5183,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9889,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4637351086194814,"acs":2647,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5708,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6383447061413163,"acs":5800,"articleLive":2,"columnArticles":101,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9086,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6347924635217453,"acs":4481,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7059,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5439568668563726,"acs":3632,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6677,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5637067437739017,"acs":12087,"articleLive":2,"columnArticles":157,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21442,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5007624797709449,"acs":32181,"articleLive":2,"columnArticles":345,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":64264,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5694627917217085,"acs":5173,"articleLive":2,"columnArticles":75,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9084,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4742399417440379,"acs":5210,"articleLive":2,"columnArticles":60,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":10986,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.640399192888695,"acs":11743,"articleLive":2,"columnArticles":186,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18337,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6826800855022304,"acs":143399,"articleLive":2,"columnArticles":1064,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":210053,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6921103045854791,"acs":78758,"articleLive":2,"columnArticles":654,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":113794,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5653108333996657,"acs":7102,"articleLive":2,"columnArticles":84,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12563,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7231689253727211,"acs":52241,"articleLive":2,"columnArticles":444,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72239,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49555568465694533,"acs":8530,"articleLive":2,"columnArticles":118,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17213,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4347044254193008,"acs":38437,"articleLive":2,"columnArticles":376,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":88421,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.515207430996854,"acs":106938,"articleLive":2,"columnArticles":834,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":207563,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5797934933087218,"acs":100513,"articleLive":2,"columnArticles":614,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":173360,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5891106141407191,"acs":6849,"articleLive":2,"columnArticles":154,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11626,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6741336012054244,"acs":6711,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":9955,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4474647151071615,"acs":3424,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7652,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6255241971884156,"acs":152444,"articleLive":2,"columnArticles":1102,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":243706,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3386687797147385,"acs":6411,"articleLive":2,"columnArticles":106,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":18930,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5530738860688099,"acs":9806,"articleLive":2,"columnArticles":139,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17730,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5530982683079491,"acs":2651,"articleLive":2,"columnArticles":45,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4793,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.647502356267672,"acs":3435,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5305,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.31081149193548385,"acs":12333,"articleLive":2,"columnArticles":163,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":39680,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4400353527500675,"acs":53771,"articleLive":2,"columnArticles":563,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122197,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46203530671117804,"acs":50932,"articleLive":2,"columnArticles":414,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110234,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49185667752442996,"acs":7097,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14429,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5701606732976282,"acs":7452,"articleLive":2,"columnArticles":84,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13070,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4534880021536165,"acs":185302,"articleLive":2,"columnArticles":1057,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":408615,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6320159559477095,"acs":204071,"articleLive":2,"columnArticles":1202,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":322889,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6849081843609388,"acs":5632,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8223,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.758284023668639,"acs":2563,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3380,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.39174767540152156,"acs":7415,"articleLive":2,"columnArticles":80,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":18928,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6387830341186185,"acs":494328,"articleLive":2,"columnArticles":3389,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":773859,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7715398863128313,"acs":24160,"articleLive":2,"columnArticles":205,"formTitle":"[284]顶端迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":31314,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6352540223507965,"acs":8015,"articleLive":2,"columnArticles":102,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12617,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5094472894225676,"acs":11540,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22652,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6595963152027225,"acs":179864,"articleLive":2,"columnArticles":1227,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":272688,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43220548283526794,"acs":3500,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8098,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7532585417050789,"acs":53110,"articleLive":2,"columnArticles":829,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70507,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.456736963823578,"acs":82948,"articleLive":2,"columnArticles":1101,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":181610,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5320889261744967,"acs":2537,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4768,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7083523617916785,"acs":114780,"articleLive":2,"columnArticles":766,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162038,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7126752420870068,"acs":4931,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6919,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5830122029543995,"acs":3631,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6228,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5231633359111075,"acs":64268,"articleLive":2,"columnArticles":504,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":122845,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6201201201201201,"acs":2478,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":3996,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5601530050012715,"acs":105730,"articleLive":2,"columnArticles":757,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":188752,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5772348173381886,"acs":4914,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8513,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.504381306425916,"acs":30392,"articleLive":2,"columnArticles":360,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60256,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5163719461195837,"acs":364256,"articleLive":2,"columnArticles":2022,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":705414,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.523512158198505,"acs":33198,"articleLive":2,"columnArticles":235,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":63414,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6562398175301402,"acs":2014,"articleLive":2,"columnArticles":38,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3069,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7263826305288408,"acs":129607,"articleLive":2,"columnArticles":795,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":178428,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5465898423033528,"acs":63464,"articleLive":2,"columnArticles":565,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116109,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3828804830403126,"acs":4312,"articleLive":2,"columnArticles":64,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11262,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3374162144909033,"acs":16914,"articleLive":2,"columnArticles":251,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50128,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5402860682509292,"acs":23986,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44395,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6097890751757706,"acs":2255,"articleLive":2,"columnArticles":42,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3698,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.608250983303177,"acs":117994,"articleLive":2,"columnArticles":937,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":193989,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3792172272325988,"acs":21907,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":57769,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.760916095890411,"acs":3555,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4672,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6830195072365555,"acs":56442,"articleLive":2,"columnArticles":381,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":82636,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6301484101122727,"acs":40804,"articleLive":2,"columnArticles":355,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":64753,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5461538461538461,"acs":4544,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8320,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4181630291005291,"acs":50581,"articleLive":2,"columnArticles":480,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":120960,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4765662985955986,"acs":67630,"articleLive":2,"columnArticles":532,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":141911,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48354889947810303,"acs":4262,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8814,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6846565868872466,"acs":20196,"articleLive":2,"columnArticles":179,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29498,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5183552276408134,"acs":23044,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44456,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.677007299270073,"acs":2968,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4384,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42435148175868276,"acs":26648,"articleLive":2,"columnArticles":231,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62797,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4447840983998435,"acs":307010,"articleLive":2,"columnArticles":1821,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":690245,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6321309946972787,"acs":10848,"articleLive":2,"columnArticles":150,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17161,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784283880980094,"acs":25360,"articleLive":2,"columnArticles":168,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67014,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5378870569311197,"acs":9363,"articleLive":2,"columnArticles":104,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17407,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5045531046935432,"acs":135804,"articleLive":2,"columnArticles":575,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":269157,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42125547843585326,"acs":24702,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58639,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6558569341881035,"acs":129314,"articleLive":2,"columnArticles":1070,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":197168,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4856303266892445,"acs":56354,"articleLive":2,"columnArticles":491,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":116043,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5337992053875849,"acs":18944,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35489,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4799547916577814,"acs":45014,"articleLive":2,"columnArticles":506,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93788,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4496071448759256,"acs":39770,"articleLive":2,"columnArticles":329,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":88455,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46922240885288014,"acs":4749,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10121,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41198777953427235,"acs":46389,"articleLive":2,"columnArticles":305,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":112598,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3697509765625,"acs":3029,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8192,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4012622517993418,"acs":22189,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55298,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6078445026275231,"acs":130937,"articleLive":2,"columnArticles":926,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":215412,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869094053034397,"acs":160188,"articleLive":2,"columnArticles":1373,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":203566,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8085429314830876,"acs":3729,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4612,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4944657123834887,"acs":11883,"articleLive":2,"columnArticles":177,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24032,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7274035242667275,"acs":51063,"articleLive":2,"columnArticles":488,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70199,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5161086283133527,"acs":87307,"articleLive":2,"columnArticles":768,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":169164,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6059120309062852,"acs":110728,"articleLive":2,"columnArticles":1051,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":182746,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7687182246747931,"acs":369991,"articleLive":2,"columnArticles":1950,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":481309,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5392306851710196,"acs":108559,"articleLive":2,"columnArticles":1031,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":201322,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7077393663069198,"acs":12263,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17327,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223622943944259,"acs":203299,"articleLive":2,"columnArticles":1499,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":326657,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5993613362810121,"acs":4880,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8142,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7389683395985238,"acs":215059,"articleLive":2,"columnArticles":1514,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":291026,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5501464691492493,"acs":250529,"articleLive":2,"columnArticles":1404,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":455386,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5900791904971403,"acs":5365,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9092,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5928542860951873,"acs":4447,"articleLive":2,"columnArticles":85,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7501,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42668735453840184,"acs":2200,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5156,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4537203439136337,"acs":70186,"articleLive":2,"columnArticles":543,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":154690,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4070087877767231,"acs":26585,"articleLive":2,"columnArticles":438,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65318,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35356433458397707,"acs":1602,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4531,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5204395234286195,"acs":24724,"articleLive":2,"columnArticles":388,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47506,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3519061583577713,"acs":4440,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12617,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7271493212669683,"acs":4821,"articleLive":2,"columnArticles":56,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6630,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6095626072041166,"acs":2843,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4664,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5654044750430293,"acs":3285,"articleLive":2,"columnArticles":64,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5810,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6905810782462765,"acs":3292,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4767,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48974766924895546,"acs":32937,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67253,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7208843268851165,"acs":1826,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2533,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3654271921203547,"acs":33836,"articleLive":2,"columnArticles":482,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92593,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7640952210488634,"acs":4269,"articleLive":2,"columnArticles":120,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5587,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.43880717011470827,"acs":77503,"articleLive":2,"columnArticles":614,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":176622,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45920599843882276,"acs":41768,"articleLive":2,"columnArticles":451,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":90957,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6169277273976367,"acs":4490,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7278,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.72224709042077,"acs":3227,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4468,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6129637792403216,"acs":80655,"articleLive":2,"columnArticles":507,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131582,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.51042679632631,"acs":14172,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27765,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.41799709724238027,"acs":20448,"articleLive":2,"columnArticles":208,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":48919,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5152808933063986,"acs":83155,"articleLive":2,"columnArticles":565,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":161378,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46827794561933533,"acs":14570,"articleLive":2,"columnArticles":122,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31114,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4642004627192714,"acs":75842,"articleLive":2,"columnArticles":813,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":163382,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5087902428304582,"acs":64827,"articleLive":2,"columnArticles":551,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":127414,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6389859930085033,"acs":79879,"articleLive":2,"columnArticles":565,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125009,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6390520559043954,"acs":3155,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4937,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.50320008090498,"acs":34830,"articleLive":2,"columnArticles":218,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":69217,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44146555690325817,"acs":21110,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47818,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6311560187763545,"acs":15866,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25138,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6011797985373258,"acs":69708,"articleLive":2,"columnArticles":763,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":115952,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5788619512900034,"acs":52075,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":89961,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41726700323330873,"acs":7356,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17629,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7496649242728857,"acs":22373,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":29844,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5338048354935194,"acs":222729,"articleLive":2,"columnArticles":1207,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":417248,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5273059837993206,"acs":6054,"articleLive":2,"columnArticles":110,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11481,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6918366786567451,"acs":100784,"articleLive":2,"columnArticles":988,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":145676,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4674093229891917,"acs":7049,"articleLive":2,"columnArticles":94,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15081,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3575065576299954,"acs":4634,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12962,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152571438570703,"acs":147227,"articleLive":2,"columnArticles":1581,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":285735,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3913442854619325,"acs":11077,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28305,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5526052761307771,"acs":122186,"articleLive":2,"columnArticles":1301,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":221109,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5206262175895242,"acs":51845,"articleLive":2,"columnArticles":427,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":99582,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4284037558685446,"acs":9125,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21300,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3775145338230644,"acs":15520,"articleLive":2,"columnArticles":192,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41111,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6574440052700923,"acs":14471,"articleLive":2,"columnArticles":121,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22011,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5919666188990981,"acs":42135,"articleLive":2,"columnArticles":528,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71178,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4162837356805385,"acs":19296,"articleLive":2,"columnArticles":196,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46353,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6138866719872307,"acs":53844,"articleLive":2,"columnArticles":656,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87710,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3271026527513005,"acs":80988,"articleLive":2,"columnArticles":589,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":247592,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45546363699562037,"acs":45862,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":100693,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5838647219774614,"acs":100719,"articleLive":2,"columnArticles":1126,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":172504,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5612482998714765,"acs":44979,"articleLive":2,"columnArticles":457,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":80141,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7374160197188466,"acs":119968,"articleLive":2,"columnArticles":794,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":162687,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48398126463700236,"acs":10333,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21350,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32385422418553284,"acs":3519,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10866,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558616719437477,"acs":94626,"articleLive":2,"columnArticles":1324,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":170233,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5645330535152151,"acs":39274,"articleLive":2,"columnArticles":318,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69569,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5016759776536313,"acs":898,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1790,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6741708963233822,"acs":74117,"articleLive":2,"columnArticles":377,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":109938,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6880056818727145,"acs":71684,"articleLive":2,"columnArticles":932,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":104191,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39213401378090573,"acs":85137,"articleLive":2,"columnArticles":1118,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":217112,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5382355271022519,"acs":149482,"articleLive":2,"columnArticles":1082,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":277726,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5075398197182771,"acs":174715,"articleLive":2,"columnArticles":989,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":344239,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4802789886660854,"acs":27544,"articleLive":2,"columnArticles":324,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":57350,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3633310946944258,"acs":2164,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":5956,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7562573388542118,"acs":12237,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16181,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20775287704421563,"acs":2744,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13208,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6224005700463162,"acs":33192,"articleLive":2,"columnArticles":306,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53329,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42731560891938253,"acs":1993,"articleLive":2,"columnArticles":48,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4664,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5701860841423948,"acs":8457,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14832,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5312052721000875,"acs":51588,"articleLive":2,"columnArticles":449,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97115,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6155394524959742,"acs":1529,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2484,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6682496607869742,"acs":6895,"articleLive":2,"columnArticles":113,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10318,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6129128235644153,"acs":4120,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6722,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6509387351778656,"acs":2635,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4048,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6996371423472726,"acs":58808,"articleLive":2,"columnArticles":475,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":84055,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5877613298712423,"acs":43914,"articleLive":2,"columnArticles":673,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74714,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7306711979609176,"acs":860,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1177,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3781709900933402,"acs":6604,"articleLive":2,"columnArticles":85,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17463,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5321418955304255,"acs":15811,"articleLive":2,"columnArticles":211,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29712,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.507876367752484,"acs":96915,"articleLive":2,"columnArticles":850,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":190824,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4876753675032139,"acs":8725,"articleLive":2,"columnArticles":141,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":17891,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5742644239431219,"acs":124307,"articleLive":2,"columnArticles":1026,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":216463,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5184562297259051,"acs":95257,"articleLive":2,"columnArticles":836,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":183732,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5904820261437909,"acs":2891,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4896,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3801944162904266,"acs":16505,"articleLive":2,"columnArticles":123,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43412,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.42579939627279795,"acs":47113,"articleLive":2,"columnArticles":476,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":110646,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.697584587520636,"acs":43523,"articleLive":2,"columnArticles":437,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62391,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47717789537960514,"acs":56265,"articleLive":2,"columnArticles":692,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":117912,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2520217615056609,"acs":3428,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13602,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5887835163113903,"acs":82697,"articleLive":2,"columnArticles":933,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":140454,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515759312320917,"acs":19250,"articleLive":2,"columnArticles":171,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34900,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6628734383487235,"acs":48814,"articleLive":2,"columnArticles":377,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73640,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6486483946603013,"acs":138046,"articleLive":2,"columnArticles":1086,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":212821,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5570545046837136,"acs":15402,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27649,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4860525306748466,"acs":60846,"articleLive":2,"columnArticles":618,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":125184,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7114051889256486,"acs":81712,"articleLive":2,"columnArticles":951,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":114860,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5090077837294945,"acs":97306,"articleLive":2,"columnArticles":847,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":191168,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5560371893293362,"acs":27451,"articleLive":2,"columnArticles":309,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49369,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.603032706858677,"acs":79060,"articleLive":2,"columnArticles":494,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":131104,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.577035972311533,"acs":152551,"articleLive":2,"columnArticles":1246,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":264370,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36246409233037596,"acs":57033,"articleLive":2,"columnArticles":459,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157348,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43582672989803184,"acs":28765,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66001,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6111111111111112,"acs":6754,"articleLive":2,"columnArticles":63,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11052,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115350544978368,"acs":79690,"articleLive":2,"columnArticles":639,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":155786,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4376979528775589,"acs":33996,"articleLive":2,"columnArticles":404,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":77670,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8122161562658355,"acs":169901,"articleLive":2,"columnArticles":1355,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":209182,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6047078964262786,"acs":14129,"articleLive":2,"columnArticles":130,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23365,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7090711896537581,"acs":77800,"articleLive":2,"columnArticles":935,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":109721,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35644226482389657,"acs":11193,"articleLive":2,"columnArticles":111,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31402,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5288874215912842,"acs":1602,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3029,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3738068455728748,"acs":11631,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31115,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4410445127791501,"acs":8749,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19837,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25115438666934353,"acs":25020,"articleLive":2,"columnArticles":298,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":99620,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43498542274052476,"acs":1492,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3430,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5468505897096946,"acs":63707,"articleLive":2,"columnArticles":335,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":116498,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6190246257846451,"acs":1282,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2071,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39995150633448506,"acs":6598,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16497,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.420159660671055,"acs":21000,"articleLive":2,"columnArticles":179,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":49981,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6118336290930306,"acs":75507,"articleLive":2,"columnArticles":598,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":123411,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33391692360132,"acs":21552,"articleLive":2,"columnArticles":239,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64543,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7016306661484073,"acs":37907,"articleLive":2,"columnArticles":483,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54027,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038435865195051,"acs":38899,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64419,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4381918819188192,"acs":6650,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15176,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4174412247129579,"acs":3054,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7316,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44835641581845487,"acs":29557,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":65923,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5398442756897049,"acs":5616,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10403,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4720352888022258,"acs":39701,"articleLive":2,"columnArticles":424,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":84106,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5905889519168539,"acs":15513,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26267,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6352583586626139,"acs":1463,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2303,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6070743808187227,"acs":122850,"articleLive":2,"columnArticles":990,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":202364,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5863577180274817,"acs":46385,"articleLive":2,"columnArticles":402,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79107,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5780306778822365,"acs":5841,"articleLive":2,"columnArticles":114,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10105,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3872998343456654,"acs":3507,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9055,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7199289835774523,"acs":1622,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2253,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4834669338677355,"acs":6755,"articleLive":2,"columnArticles":81,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":13972,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5467440361057382,"acs":47488,"articleLive":2,"columnArticles":400,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":86856,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.552156951433256,"acs":19532,"articleLive":2,"columnArticles":180,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35374,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34567531300076865,"acs":26533,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76757,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4934429239313605,"acs":150507,"articleLive":2,"columnArticles":1039,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":305014,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5426107155096912,"acs":28499,"articleLive":2,"columnArticles":435,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52522,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6873917086452459,"acs":102752,"articleLive":2,"columnArticles":1056,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":149481,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4047716428084526,"acs":2969,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7335,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4679862177044535,"acs":43599,"articleLive":2,"columnArticles":455,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":93163,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3715415019762846,"acs":2632,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7084,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7091371144738362,"acs":30695,"articleLive":2,"columnArticles":474,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43285,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5129031251462718,"acs":65747,"articleLive":2,"columnArticles":539,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":128186,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44117159102906356,"acs":29251,"articleLive":2,"columnArticles":356,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66303,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.635797449639623,"acs":103209,"articleLive":2,"columnArticles":974,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":162330,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5042906131556927,"acs":30735,"articleLive":2,"columnArticles":320,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":60947,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4832831972496777,"acs":5623,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11635,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5639457382576648,"acs":21576,"articleLive":2,"columnArticles":289,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38259,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41282148525838214,"acs":29390,"articleLive":2,"columnArticles":231,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":71193,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.677124243404334,"acs":14655,"articleLive":2,"columnArticles":211,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21643,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6748688753153632,"acs":243957,"articleLive":2,"columnArticles":1484,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":361488,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6076937372235643,"acs":3270,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5381,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7330263358197595,"acs":19261,"articleLive":2,"columnArticles":106,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26276,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5378997060657343,"acs":18117,"articleLive":2,"columnArticles":148,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":33681,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7308646578800178,"acs":50961,"articleLive":2,"columnArticles":572,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":69727,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5006759686758666,"acs":19628,"articleLive":2,"columnArticles":240,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39203,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6447987977959593,"acs":38617,"articleLive":2,"columnArticles":423,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":59890,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6537413730475845,"acs":86388,"articleLive":2,"columnArticles":620,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":132144,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5108092238710367,"acs":19139,"articleLive":2,"columnArticles":165,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37468,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6572277191639789,"acs":108204,"articleLive":2,"columnArticles":682,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":164637,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.397252265419468,"acs":2718,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6842,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5638645904999929,"acs":40159,"articleLive":2,"columnArticles":644,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71221,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7133359515260324,"acs":25429,"articleLive":2,"columnArticles":253,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35648,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36126570201939895,"acs":6816,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18867,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2746879859643526,"acs":68889,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":250790,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49537623294750605,"acs":72371,"articleLive":2,"columnArticles":756,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":146093,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5358811392795314,"acs":45193,"articleLive":2,"columnArticles":517,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84334,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7351358533182755,"acs":33198,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45159,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5785962877030162,"acs":1995,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3448,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4768102796674225,"acs":31541,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66150,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6450528025995126,"acs":39703,"articleLive":2,"columnArticles":463,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61550,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.620804151681494,"acs":78713,"articleLive":2,"columnArticles":638,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":126792,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6587012987012987,"acs":3804,"articleLive":2,"columnArticles":77,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5775,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3747682528471793,"acs":25470,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":67962,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5253205128205128,"acs":1639,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3120,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6749858730457713,"acs":14334,"articleLive":2,"columnArticles":138,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21236,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8420154625433218,"acs":15792,"articleLive":2,"columnArticles":102,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18755,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5374736101337086,"acs":3055,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5684,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.712111063752055,"acs":11695,"articleLive":2,"columnArticles":173,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16423,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.700413209904225,"acs":109331,"articleLive":2,"columnArticles":839,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":156095,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5976464590679298,"acs":14068,"articleLive":2,"columnArticles":184,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23539,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5821738344777737,"acs":38661,"articleLive":2,"columnArticles":407,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66408,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6074938831408506,"acs":72748,"articleLive":2,"columnArticles":802,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":119751,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45809347768682335,"acs":69392,"articleLive":2,"columnArticles":644,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":151480,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5522426527441292,"acs":149988,"articleLive":2,"columnArticles":1239,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":271598,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7105670901766347,"acs":2293,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3227,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41833008763388513,"acs":3437,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8216,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6283233857840478,"acs":15054,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23959,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6186979931473323,"acs":163056,"articleLive":2,"columnArticles":1141,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":263547,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3547960308710033,"acs":1609,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4535,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48062709966405376,"acs":2146,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4465,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43809952557398624,"acs":12651,"articleLive":2,"columnArticles":179,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":28877,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5677682523457314,"acs":58877,"articleLive":2,"columnArticles":757,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103699,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.577485133736187,"acs":23987,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41537,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6045631266625742,"acs":5909,"articleLive":2,"columnArticles":86,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9774,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.502978276103714,"acs":45936,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91328,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.34316770186335405,"acs":1105,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3220,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3260255069109039,"acs":14648,"articleLive":2,"columnArticles":214,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":44929,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7455577481244337,"acs":162085,"articleLive":2,"columnArticles":1326,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":217401,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5041594454072791,"acs":2909,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5770,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7282769128219778,"acs":61184,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84012,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4466285491290517,"acs":151073,"articleLive":2,"columnArticles":929,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":338252,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7748043010752688,"acs":90071,"articleLive":2,"columnArticles":751,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116250,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46603342551400745,"acs":3876,"articleLive":2,"columnArticles":60,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8317,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6064230675490729,"acs":32346,"articleLive":2,"columnArticles":324,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53339,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17928559909691985,"acs":4447,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24804,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6106791969243913,"acs":14296,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23410,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6898191913864647,"acs":69322,"articleLive":2,"columnArticles":644,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":100493,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4318077853050733,"acs":118938,"articleLive":2,"columnArticles":1086,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":275442,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5072463768115942,"acs":1190,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2346,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5642910469189686,"acs":9826,"articleLive":2,"columnArticles":154,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17413,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6610388269310202,"acs":12803,"articleLive":2,"columnArticles":112,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19368,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48862733771391437,"acs":6767,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":13849,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47328029685435585,"acs":84180,"articleLive":2,"columnArticles":734,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":177865,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6640776699029126,"acs":1026,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1545,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6482290649257184,"acs":12610,"articleLive":2,"columnArticles":113,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19453,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6834456953001516,"acs":42375,"articleLive":2,"columnArticles":436,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62002,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4686348203424297,"acs":25811,"articleLive":2,"columnArticles":280,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55077,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7030600327026396,"acs":15049,"articleLive":2,"columnArticles":85,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21405,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4955849889624724,"acs":9878,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":19932,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41097275436355896,"acs":7723,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18792,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5227842809364549,"acs":10004,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19136,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.405057704253441,"acs":99116,"articleLive":2,"columnArticles":861,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":244696,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40817568833114815,"acs":8717,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21356,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6184830633284242,"acs":50394,"articleLive":2,"columnArticles":491,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":81480,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744683251537203,"acs":13729,"articleLive":2,"columnArticles":61,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17727,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5956326908030443,"acs":8374,"articleLive":2,"columnArticles":99,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14059,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7465961054308174,"acs":14531,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19463,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3848495702005731,"acs":2149,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5584,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42691415313225056,"acs":1472,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3448,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7451775795320653,"acs":88542,"articleLive":2,"columnArticles":564,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":118820,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7609421072429652,"acs":62710,"articleLive":2,"columnArticles":461,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82411,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3421506612995975,"acs":1785,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5217,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5226183518410287,"acs":4471,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8555,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44127774540446046,"acs":8330,"articleLive":2,"columnArticles":135,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18877,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5179722359940506,"acs":29253,"articleLive":2,"columnArticles":270,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56476,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7967453954830596,"acs":103259,"articleLive":2,"columnArticles":237,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":129601,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42108775614727595,"acs":81395,"articleLive":2,"columnArticles":284,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":193297,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44129866792307365,"acs":10303,"articleLive":2,"columnArticles":80,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23347,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5177695882070181,"acs":16157,"articleLive":2,"columnArticles":210,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31205,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5219650363528117,"acs":28932,"articleLive":2,"columnArticles":273,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55429,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4814916575082426,"acs":19277,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40036,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5000079233024325,"acs":31553,"articleLive":2,"columnArticles":374,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63105,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6287648844268037,"acs":8079,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12849,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6710651828298887,"acs":12663,"articleLive":2,"columnArticles":110,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":18870,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3737544074812203,"acs":2438,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6523,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33355529015764024,"acs":109203,"articleLive":2,"columnArticles":1257,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":327391,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5694430576911557,"acs":28516,"articleLive":2,"columnArticles":313,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50077,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6612841425365373,"acs":12081,"articleLive":2,"columnArticles":85,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18269,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6557490685382549,"acs":7568,"articleLive":2,"columnArticles":101,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11541,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4858917745677719,"acs":6492,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13361,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6662635264162954,"acs":10467,"articleLive":2,"columnArticles":72,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15710,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5320054945054945,"acs":50349,"articleLive":2,"columnArticles":391,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":94640,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6678805535324108,"acs":7336,"articleLive":2,"columnArticles":63,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":10984,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8171710063335679,"acs":11612,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14210,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3452167222364709,"acs":8076,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23394,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4255832662912309,"acs":5290,"articleLive":2,"columnArticles":91,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12430,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4603736201528446,"acs":3253,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7066,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.787780531977933,"acs":188779,"articleLive":2,"columnArticles":1246,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":239634,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6188491529981178,"acs":4603,"articleLive":2,"columnArticles":45,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7438,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4659465699208443,"acs":11302,"articleLive":2,"columnArticles":79,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24256,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735672068003719,"acs":93187,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":120464,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5710027536911179,"acs":77967,"articleLive":2,"columnArticles":498,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":136544,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4366287840691944,"acs":65121,"articleLive":2,"columnArticles":421,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":149145,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5462318552396103,"acs":10988,"articleLive":2,"columnArticles":188,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20116,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4189267166762839,"acs":2178,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5199,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3428844317096466,"acs":2513,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7329,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6841715529226864,"acs":45273,"articleLive":2,"columnArticles":353,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66172,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8082957516959108,"acs":85314,"articleLive":2,"columnArticles":339,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":105548,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5248578940122077,"acs":80055,"articleLive":2,"columnArticles":759,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":152527,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40713370775445856,"acs":4132,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10149,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3676649481550136,"acs":6347,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17263,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2883484767504009,"acs":1079,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3742,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5977664265998287,"acs":18841,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31519,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3980608843350121,"acs":93977,"articleLive":2,"columnArticles":766,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":236087,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44102397926117953,"acs":1361,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3086,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5521405049396267,"acs":4024,"articleLive":2,"columnArticles":67,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7288,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5511078536392852,"acs":9775,"articleLive":2,"columnArticles":112,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17737,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6899766684803158,"acs":74819,"articleLive":2,"columnArticles":650,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":108437,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5925044000414121,"acs":11446,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19318,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37661119345578714,"acs":20073,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53299,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42481997495303697,"acs":10855,"articleLive":2,"columnArticles":212,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25552,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5324633358190405,"acs":21421,"articleLive":2,"columnArticles":241,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40230,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4885114885114885,"acs":2445,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5005,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4506425316312378,"acs":63683,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":141316,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4009848751319029,"acs":1140,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2843,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4342148551183095,"acs":68632,"articleLive":2,"columnArticles":696,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":158060,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5774197739378979,"acs":22222,"articleLive":2,"columnArticles":197,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38485,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6567065459528962,"acs":124109,"articleLive":2,"columnArticles":914,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":188987,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5846360226681633,"acs":21355,"articleLive":2,"columnArticles":279,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36527,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4817549668874172,"acs":29098,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60400,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5672010433618411,"acs":49144,"articleLive":2,"columnArticles":651,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86643,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5835272219637041,"acs":3762,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6447,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5715316393327233,"acs":32479,"articleLive":2,"columnArticles":237,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":56828,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5976760022602472,"acs":41251,"articleLive":2,"columnArticles":390,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69019,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.810390209486595,"acs":59729,"articleLive":2,"columnArticles":606,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":73704,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5978357169978483,"acs":9447,"articleLive":2,"columnArticles":138,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15802,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30870519385515727,"acs":844,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2734,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834241468310869,"acs":81954,"articleLive":2,"columnArticles":626,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":104610,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4548130753654262,"acs":26728,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":58767,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419531011304614,"acs":28381,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52368,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6550424128180962,"acs":695,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1061,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5608174627423024,"acs":16520,"articleLive":2,"columnArticles":213,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29457,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4087816680899516,"acs":28721,"articleLive":2,"columnArticles":270,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":70260,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4639874739039666,"acs":1778,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3832,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.654157883798949,"acs":22034,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33683,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27074737934500803,"acs":74876,"articleLive":2,"columnArticles":934,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":276553,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6176985981308412,"acs":2115,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3424,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6240331275880928,"acs":7987,"articleLive":2,"columnArticles":118,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12799,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5082848186296463,"acs":6810,"articleLive":2,"columnArticles":67,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13398,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6660479988239185,"acs":36245,"articleLive":2,"columnArticles":305,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54418,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45131604043486556,"acs":18930,"articleLive":2,"columnArticles":282,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":41944,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4862615852437226,"acs":53410,"articleLive":2,"columnArticles":667,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":109838,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5487348405449918,"acs":3665,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6679,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4348928896363486,"acs":47322,"articleLive":2,"columnArticles":413,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":108813,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4964573976611321,"acs":92632,"articleLive":2,"columnArticles":762,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":186586,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4011338495575221,"acs":2901,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7232,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5870264917058677,"acs":7113,"articleLive":2,"columnArticles":130,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12117,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6170195136098107,"acs":14893,"articleLive":2,"columnArticles":250,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24137,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38549950298210733,"acs":43435,"articleLive":2,"columnArticles":476,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":112672,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5411784364099672,"acs":25910,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47877,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40168604489314913,"acs":86577,"articleLive":2,"columnArticles":821,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":215534,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5029194239003504,"acs":2584,"articleLive":2,"columnArticles":62,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5138,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6949711209894464,"acs":45964,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66138,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4340475722429723,"acs":2208,"articleLive":2,"columnArticles":50,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5087,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.665589678680079,"acs":59947,"articleLive":2,"columnArticles":606,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90066,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4310667498440424,"acs":20039,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46487,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3558819288524523,"acs":17277,"articleLive":2,"columnArticles":195,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48547,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4410575679172057,"acs":38185,"articleLive":2,"columnArticles":272,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86576,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5107520040717649,"acs":8028,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15718,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.484889087390204,"acs":3257,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6717,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6476258892776864,"acs":55894,"articleLive":2,"columnArticles":566,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86306,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49058419243986257,"acs":3569,"articleLive":2,"columnArticles":47,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7275,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5776921182893385,"acs":68040,"articleLive":2,"columnArticles":737,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":117779,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6096389494154307,"acs":26020,"articleLive":2,"columnArticles":283,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42681,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5345100105374078,"acs":4058,"articleLive":2,"columnArticles":78,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7592,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6648548404448793,"acs":129779,"articleLive":2,"columnArticles":1286,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":195199,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6317996195000182,"acs":52138,"articleLive":2,"columnArticles":475,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82523,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6052026222234346,"acs":66562,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":109983,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44648391298489365,"acs":29822,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":66793,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.477292350198584,"acs":2764,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5791,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7601035404141616,"acs":81927,"articleLive":2,"columnArticles":518,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":107784,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7233542617960426,"acs":76039,"articleLive":2,"columnArticles":563,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":105120,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7403333906169445,"acs":4308,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5819,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5127235564639755,"acs":60204,"articleLive":2,"columnArticles":547,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117420,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5562612851832183,"acs":288046,"articleLive":2,"columnArticles":1429,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":517825,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6454659342777296,"acs":66980,"articleLive":2,"columnArticles":433,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":103770,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6440898476592906,"acs":57923,"articleLive":2,"columnArticles":390,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":89930,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.32113648968890235,"acs":63691,"articleLive":2,"columnArticles":438,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":198330,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3381774144716924,"acs":2234,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6606,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7588131326656312,"acs":70839,"articleLive":2,"columnArticles":509,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93355,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.35204979028548233,"acs":5204,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14782,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5594679186228482,"acs":715,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1278,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6718055802381375,"acs":15121,"articleLive":2,"columnArticles":168,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22508,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4134620466115877,"acs":23471,"articleLive":2,"columnArticles":217,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":56767,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.721537073786758,"acs":99987,"articleLive":2,"columnArticles":668,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":138575,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4102883865939205,"acs":2632,"articleLive":2,"columnArticles":44,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6415,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4618776836486016,"acs":3980,"articleLive":2,"columnArticles":73,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8617,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.511522227792422,"acs":31631,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61837,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5644110644445038,"acs":84393,"articleLive":2,"columnArticles":587,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":149524,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37028852568378917,"acs":8881,"articleLive":2,"columnArticles":86,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":23984,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48509536143159876,"acs":20602,"articleLive":2,"columnArticles":274,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42470,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46957157954637835,"acs":28881,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61505,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32176757311441767,"acs":5017,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15592,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7204658901830283,"acs":1299,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1803,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4622477108886822,"acs":137668,"articleLive":2,"columnArticles":861,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":297823,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6085658614573706,"acs":48723,"articleLive":2,"columnArticles":624,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80062,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524553571428571,"acs":21780,"articleLive":2,"columnArticles":395,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39424,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4095466741985595,"acs":2900,"articleLive":2,"columnArticles":49,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7081,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7601738974542847,"acs":33922,"articleLive":2,"columnArticles":310,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44624,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5125850977453001,"acs":8207,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16011,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49001248439450684,"acs":3925,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8010,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5075268817204301,"acs":4012,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7905,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6108098336948662,"acs":3379,"articleLive":2,"columnArticles":53,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5532,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805190344936904,"acs":65922,"articleLive":2,"columnArticles":564,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":113557,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.48228625413320736,"acs":2042,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4234,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40586059190031154,"acs":20845,"articleLive":2,"columnArticles":263,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51360,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4632768361581921,"acs":1558,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3363,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4609393721543254,"acs":3847,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8346,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5016374283244665,"acs":41205,"articleLive":2,"columnArticles":585,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82141,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6797267346520447,"acs":212227,"articleLive":2,"columnArticles":1512,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":312224,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.629506735340729,"acs":50844,"articleLive":2,"columnArticles":585,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":80768,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3670266777439306,"acs":3976,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10833,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4949854416046587,"acs":1530,"articleLive":2,"columnArticles":44,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3091,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5199405386179788,"acs":57012,"articleLive":2,"columnArticles":519,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":109651,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4589771149626047,"acs":40994,"articleLive":2,"columnArticles":364,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89316,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3923687089715536,"acs":2869,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7312,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5874404405759631,"acs":134508,"articleLive":2,"columnArticles":1292,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":228973,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4163012567654344,"acs":45381,"articleLive":2,"columnArticles":403,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109010,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6017447464815886,"acs":12485,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20748,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5054165110197982,"acs":1353,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2677,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7217391304347827,"acs":1992,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2760,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027046520014424,"acs":1394,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2773,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5301892689173635,"acs":69555,"articleLive":2,"columnArticles":589,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":131189,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5912100036778227,"acs":3215,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5438,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43101961629661567,"acs":7998,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18556,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.4990395697272378,"acs":1299,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2603,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5658349802371542,"acs":4581,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8096,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4195491309585269,"acs":2438,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5811,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.46174142480211083,"acs":3500,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7580,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6589861751152074,"acs":1859,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2821,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8393009377664109,"acs":3938,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4692,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5907553551296505,"acs":2096,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3548,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6999528227708759,"acs":17804,"articleLive":2,"columnArticles":140,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25436,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7630914531512998,"acs":81605,"articleLive":2,"columnArticles":978,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":106940,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4937891872707914,"acs":4174,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8453,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6650129175335513,"acs":29087,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43739,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080260918888258,"acs":54923,"articleLive":2,"columnArticles":634,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77572,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4777923784494087,"acs":39996,"articleLive":2,"columnArticles":496,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83710,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5059677265348993,"acs":5299,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10473,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.58675971331573,"acs":12444,"articleLive":2,"columnArticles":148,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21208,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5548837209302325,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2150,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513921372090433,"acs":152893,"articleLive":2,"columnArticles":1112,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":179580,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49278152069297404,"acs":6144,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12468,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7133494625302422,"acs":23293,"articleLive":2,"columnArticles":333,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32653,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5901814300960512,"acs":1106,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1874,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.45993822674418605,"acs":5063,"articleLive":2,"columnArticles":80,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11008,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.568904593639576,"acs":1771,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3113,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3235072245111124,"acs":5575,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17233,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5941570760086,"acs":23490,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39535,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4365170871189411,"acs":18930,"articleLive":2,"columnArticles":235,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43366,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28701012769704976,"acs":3259,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11355,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6172798948751642,"acs":43217,"articleLive":2,"columnArticles":659,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70012,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4276747503566334,"acs":1499,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3505,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.595904249854457,"acs":69604,"articleLive":2,"columnArticles":669,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":116804,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6867017867471198,"acs":43929,"articleLive":2,"columnArticles":485,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":63971,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5120717055495518,"acs":40277,"articleLive":2,"columnArticles":403,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":78655,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.47180115916183685,"acs":4233,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8972,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39114021500190144,"acs":42170,"articleLive":2,"columnArticles":398,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":107813,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6079755005268704,"acs":18463,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30368,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6921803615175793,"acs":20908,"articleLive":2,"columnArticles":294,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30206,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4501335190990363,"acs":3877,"articleLive":2,"columnArticles":66,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8613,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.695250901534136,"acs":11375,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16361,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4638631357885571,"acs":9056,"articleLive":2,"columnArticles":98,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19523,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3924912006257333,"acs":5018,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12785,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3409090909090909,"acs":7335,"articleLive":2,"columnArticles":102,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21516,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5340520993772182,"acs":7975,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14933,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5300202839756593,"acs":23517,"articleLive":2,"columnArticles":277,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44370,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7935088590826296,"acs":43128,"articleLive":2,"columnArticles":536,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":54351,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46318607764390896,"acs":1384,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2988,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4090979421321368,"acs":5288,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12926,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7059401080019637,"acs":1438,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2037,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4192407997681831,"acs":7234,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17255,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5765594063986085,"acs":31159,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54043,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48187650045259556,"acs":12244,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25409,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7713386805461149,"acs":39717,"articleLive":2,"columnArticles":398,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51491,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.290514487165363,"acs":2637,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9077,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6569021259919663,"acs":13410,"articleLive":2,"columnArticles":151,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20414,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.845009204336265,"acs":16525,"articleLive":2,"columnArticles":217,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19556,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4807797612528748,"acs":4390,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9131,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4184445973847213,"acs":4864,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11624,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7337369630546225,"acs":16603,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22628,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7047709235209235,"acs":15629,"articleLive":2,"columnArticles":199,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22176,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6305869996499008,"acs":10807,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17138,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5498654424568624,"acs":6947,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12634,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6999050332383666,"acs":22847,"articleLive":2,"columnArticles":352,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32643,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4337686415456423,"acs":26672,"articleLive":2,"columnArticles":316,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61489,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5103270223752151,"acs":3558,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6972,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5911280434401822,"acs":13499,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22836,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43289426842292633,"acs":3648,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8427,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42131940563146836,"acs":21861,"articleLive":2,"columnArticles":249,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":51887,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5074584156405192,"acs":54975,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108334,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6927876216620913,"acs":24984,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36063,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5028149190710767,"acs":2858,"articleLive":2,"columnArticles":40,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5684,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42756598240469207,"acs":2916,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6820,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6151392961876833,"acs":16781,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27280,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3909761027226251,"acs":6577,"articleLive":2,"columnArticles":90,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16822,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3739333950948364,"acs":7669,"articleLive":2,"columnArticles":112,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20509,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3907101461811262,"acs":9034,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23122,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49194167306216424,"acs":3205,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6515,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3655335901451975,"acs":8635,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23623,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5432962939711637,"acs":51925,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95574,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4053584987525762,"acs":7474,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18438,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7958140960732766,"acs":85667,"articleLive":2,"columnArticles":917,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107647,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4298642533936652,"acs":5130,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11934,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5284225485551871,"acs":13386,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25332,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5740641711229947,"acs":4294,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7480,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4792236020897154,"acs":37701,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78671,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3959125281013693,"acs":19372,"articleLive":2,"columnArticles":244,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48930,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5008077544426495,"acs":7130,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14237,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5747053872053872,"acs":19117,"articleLive":2,"columnArticles":268,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33264,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35956043956043954,"acs":8998,"articleLive":2,"columnArticles":113,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25025,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6578241466077956,"acs":55423,"articleLive":2,"columnArticles":543,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84252,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48821270513681525,"acs":28351,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58071,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38039912520503005,"acs":2783,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7316,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5130426302111719,"acs":89430,"articleLive":2,"columnArticles":985,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":174313,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.421172128397271,"acs":37657,"articleLive":2,"columnArticles":555,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89410,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5111478117258464,"acs":8666,"articleLive":2,"columnArticles":121,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16954,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6815082230244686,"acs":18689,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27423,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44879068378620485,"acs":9018,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20094,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4264875137175129,"acs":15934,"articleLive":2,"columnArticles":185,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37361,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4490022172949002,"acs":2430,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5412,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.48041746156435866,"acs":4281,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8911,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7143535396354388,"acs":84258,"articleLive":2,"columnArticles":726,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":117950,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3837524469206445,"acs":10194,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26564,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3599537037037037,"acs":4354,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12096,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4080898106093067,"acs":4762,"articleLive":2,"columnArticles":57,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11669,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.627,"acs":16302,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26000,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46710117939168216,"acs":3010,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6444,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5547600619195047,"acs":2867,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5168,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30209970623624677,"acs":27869,"articleLive":2,"columnArticles":363,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92251,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5871617905131093,"acs":89669,"articleLive":2,"columnArticles":772,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":152716,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8084591834109445,"acs":31424,"articleLive":2,"columnArticles":439,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38869,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1918800379326695,"acs":16187,"articleLive":2,"columnArticles":128,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84360,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6043933378022998,"acs":35163,"articleLive":2,"columnArticles":561,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58179,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45519010259505127,"acs":3017,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6628,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6573681904483716,"acs":9002,"articleLive":2,"columnArticles":128,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13694,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22469246924692468,"acs":7489,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33330,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702926391957225,"acs":83741,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":124932,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6241870074221441,"acs":16315,"articleLive":2,"columnArticles":236,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26138,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.551750772399588,"acs":6429,"articleLive":2,"columnArticles":95,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11652,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42932300398913104,"acs":14852,"articleLive":2,"columnArticles":190,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34594,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34184135259404075,"acs":9442,"articleLive":2,"columnArticles":125,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27621,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520280474649407,"acs":60443,"articleLive":2,"columnArticles":722,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92700,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5111260957518543,"acs":15160,"articleLive":2,"columnArticles":112,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29660,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4148146650219409,"acs":20513,"articleLive":2,"columnArticles":227,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49451,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4793370664545738,"acs":44598,"articleLive":2,"columnArticles":353,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":93041,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7061621319157866,"acs":151440,"articleLive":2,"columnArticles":1638,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":214455,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7572303826181713,"acs":68100,"articleLive":2,"columnArticles":483,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":89933,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2807062436028659,"acs":4388,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15632,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5543279035547409,"acs":21473,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38737,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2526364829952141,"acs":5965,"articleLive":2,"columnArticles":77,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23611,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.53781329542067,"acs":46907,"articleLive":2,"columnArticles":572,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87218,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4869684499314129,"acs":1775,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3645,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6886738396893105,"acs":10817,"articleLive":2,"columnArticles":110,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15707,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6618237495746853,"acs":19451,"articleLive":2,"columnArticles":252,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29390,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6914909525945865,"acs":4624,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6687,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4243557150690394,"acs":8513,"articleLive":2,"columnArticles":115,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20061,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29155331959889363,"acs":51230,"articleLive":2,"columnArticles":336,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":175714,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.64048000376843,"acs":54387,"articleLive":2,"columnArticles":456,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":84916,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6758666081614744,"acs":15403,"articleLive":2,"columnArticles":147,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22790,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.726109919128569,"acs":8799,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12118,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33066295135260654,"acs":2848,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8613,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6386453036553775,"acs":33283,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52115,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7247168284789643,"acs":10749,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14832,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7749275961936285,"acs":13111,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16919,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5449157108767608,"acs":7079,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":12991,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867491723159388,"acs":59548,"articleLive":2,"columnArticles":717,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101488,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7445040118015328,"acs":62076,"articleLive":2,"columnArticles":708,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83379,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3378335949764521,"acs":5380,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15925,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5375128468653648,"acs":4184,"articleLive":2,"columnArticles":46,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7784,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4929701230228471,"acs":3366,"articleLive":2,"columnArticles":49,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6828,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.545378466510836,"acs":18899,"articleLive":2,"columnArticles":231,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34653,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32944318069429335,"acs":3331,"articleLive":2,"columnArticles":77,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10111,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.530467899891186,"acs":2925,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5514,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45347354290189057,"acs":20268,"articleLive":2,"columnArticles":277,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":44695,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7005205502614829,"acs":58001,"articleLive":2,"columnArticles":601,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":82797,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2774756544833692,"acs":2194,"articleLive":2,"columnArticles":39,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7907,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31695600876453733,"acs":11283,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35598,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6986292165031581,"acs":20794,"articleLive":2,"columnArticles":190,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29764,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.459414297043163,"acs":16221,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35308,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31911616040051993,"acs":6629,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20773,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.42474598803532426,"acs":4473,"articleLive":2,"columnArticles":68,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10531,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5607341932257732,"acs":228756,"articleLive":2,"columnArticles":1051,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":407958,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40414175918018785,"acs":1893,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4684,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888747777495555,"acs":48992,"articleLive":2,"columnArticles":615,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":125984,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4691203680552083,"acs":9381,"articleLive":2,"columnArticles":114,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":19997,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4414801469059663,"acs":6371,"articleLive":2,"columnArticles":75,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14431,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5699646780266273,"acs":29368,"articleLive":2,"columnArticles":435,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51526,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35669819851151147,"acs":20513,"articleLive":2,"columnArticles":222,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":57508,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6318602993585175,"acs":5319,"articleLive":2,"columnArticles":99,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8418,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48337662337662335,"acs":1861,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3850,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7373075432477187,"acs":20927,"articleLive":2,"columnArticles":307,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28383,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140666343533226,"acs":89866,"articleLive":2,"columnArticles":825,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":125851,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3386475787647091,"acs":6245,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18441,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3590802224898217,"acs":6262,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17439,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38745063624396664,"acs":50331,"articleLive":2,"columnArticles":674,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":129903,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5220485842488009,"acs":6748,"articleLive":2,"columnArticles":122,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":12926,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3391432791728213,"acs":3444,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10155,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4196547144754316,"acs":2212,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5271,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.644039693505841,"acs":25636,"articleLive":2,"columnArticles":231,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39805,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449844881075491,"acs":33728,"articleLive":2,"columnArticles":342,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":61888,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6637773283251469,"acs":20676,"articleLive":2,"columnArticles":264,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31149,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6321949774057337,"acs":8534,"articleLive":2,"columnArticles":82,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13499,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7249144008056395,"acs":35992,"articleLive":2,"columnArticles":310,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49650,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47451559402936777,"acs":23461,"articleLive":2,"columnArticles":264,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49442,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.475181173536975,"acs":6098,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12833,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37848315968015506,"acs":1562,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4127,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.587388184409712,"acs":11951,"articleLive":2,"columnArticles":127,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20346,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8186076739985483,"acs":96987,"articleLive":2,"columnArticles":801,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118478,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4534805890227577,"acs":5420,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11952,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42108814846056514,"acs":4992,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11855,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39245022806207336,"acs":62035,"articleLive":2,"columnArticles":614,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158071,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7300549983824005,"acs":22566,"articleLive":2,"columnArticles":212,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30910,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47039473684210525,"acs":1859,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3952,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6894232331437855,"acs":21217,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30775,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4860247808010538,"acs":35421,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72879,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.624336679607636,"acs":27178,"articleLive":2,"columnArticles":299,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43531,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125229855250129,"acs":25982,"articleLive":2,"columnArticles":335,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42418,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3918364990473991,"acs":6787,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17321,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37083888149134486,"acs":8355,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22530,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7747035573122529,"acs":9800,"articleLive":2,"columnArticles":145,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12650,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6641303696602959,"acs":11085,"articleLive":2,"columnArticles":168,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16691,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.35161808583888,"acs":3064,"articleLive":2,"columnArticles":58,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8714,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5527112031212676,"acs":13883,"articleLive":2,"columnArticles":169,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25118,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3007091592617908,"acs":7039,"articleLive":2,"columnArticles":105,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23408,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3284348987771041,"acs":3196,"articleLive":2,"columnArticles":49,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9731,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4375882672460619,"acs":4028,"articleLive":2,"columnArticles":51,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9205,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36057141402052406,"acs":14160,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39271,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5359885461408304,"acs":24708,"articleLive":2,"columnArticles":229,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46098,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7432545096255874,"acs":19613,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26388,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.554652466367713,"acs":1979,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3568,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6765200362111331,"acs":36618,"articleLive":2,"columnArticles":302,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54127,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4423483546980309,"acs":13389,"articleLive":2,"columnArticles":130,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30268,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5028890217174736,"acs":2524,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5019,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43161634103019536,"acs":1458,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3378,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.683355046839134,"acs":33045,"articleLive":2,"columnArticles":391,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48357,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40341880341880343,"acs":3068,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7605,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4635029885890237,"acs":7677,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16563,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4988407419251679,"acs":24958,"articleLive":2,"columnArticles":326,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50032,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6515261472785485,"acs":15262,"articleLive":2,"columnArticles":195,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23425,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4141755969167137,"acs":11015,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26595,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.43987075928917607,"acs":6807,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15475,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41054313099041534,"acs":1285,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3130,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6409277410531115,"acs":67482,"articleLive":2,"columnArticles":636,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105288,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46620273371246135,"acs":37382,"articleLive":2,"columnArticles":385,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80184,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4474708171206226,"acs":3105,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6939,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5973268827752263,"acs":53585,"articleLive":2,"columnArticles":500,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89708,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7106948846572995,"acs":170861,"articleLive":2,"columnArticles":1340,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":240414,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735238679700171,"acs":43210,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91252,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7119202500633607,"acs":8427,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11837,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7343300452116728,"acs":14293,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19464,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5323928160488268,"acs":21284,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":39978,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.544966731058167,"acs":2539,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4659,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6341745139881361,"acs":32393,"articleLive":2,"columnArticles":454,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51079,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4171552559900282,"acs":9036,"articleLive":2,"columnArticles":143,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21661,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6005023269557509,"acs":16258,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27074,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6774176379796689,"acs":25456,"articleLive":2,"columnArticles":244,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":37578,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5328359583678732,"acs":23140,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43428,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49804802395850045,"acs":9313,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18699,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4712208598311911,"acs":52535,"articleLive":2,"columnArticles":594,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111487,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.502714113389626,"acs":33340,"articleLive":2,"columnArticles":501,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66320,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.51971454058876,"acs":8739,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16815,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4527173392121154,"acs":23616,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52165,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5569567597153804,"acs":50878,"articleLive":2,"columnArticles":805,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91350,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5090304049971649,"acs":54762,"articleLive":2,"columnArticles":1400,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":107581,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5399406050234057,"acs":21454,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39734,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4957490808823529,"acs":4315,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8704,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5105978184278024,"acs":36231,"articleLive":2,"columnArticles":392,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":70958,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.614462676962677,"acs":7639,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12432,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6905609872286369,"acs":30442,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44083,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.40953814098854036,"acs":3538,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8639,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2925406306431449,"acs":2106,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7199,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7357993438896495,"acs":56970,"articleLive":2,"columnArticles":599,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77426,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5766060261512223,"acs":12171,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21108,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5970424156557159,"acs":67424,"articleLive":2,"columnArticles":712,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":112930,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5319638012797946,"acs":25688,"articleLive":2,"columnArticles":420,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":48289,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.627404561756659,"acs":44259,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70543,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4652449822904368,"acs":6305,"articleLive":2,"columnArticles":85,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13552,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7223990618194003,"acs":17248,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23876,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928881313913852,"acs":15306,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25816,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45211357395056884,"acs":18439,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40784,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6267039605710543,"acs":60272,"articleLive":2,"columnArticles":577,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96173,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3339136111413339,"acs":3069,"articleLive":2,"columnArticles":64,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9191,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39715586085544125,"acs":46947,"articleLive":2,"columnArticles":919,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118208,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5502669937941983,"acs":38128,"articleLive":2,"columnArticles":449,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":69290,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.355204447370346,"acs":4856,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13671,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5838971583220568,"acs":5178,"articleLive":2,"columnArticles":80,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8868,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5609330371310695,"acs":3535,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6302,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5161752613649713,"acs":43942,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85130,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5975627835265515,"acs":20154,"articleLive":2,"columnArticles":262,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33727,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5367332794270533,"acs":9293,"articleLive":2,"columnArticles":138,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17314,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7833331068317411,"acs":57640,"articleLive":2,"columnArticles":655,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73583,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7044173267680012,"acs":19742,"articleLive":2,"columnArticles":266,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28026,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5645791783007579,"acs":7077,"articleLive":2,"columnArticles":155,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12535,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.55727792068954,"acs":33362,"articleLive":2,"columnArticles":383,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59866,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095564683272412,"acs":75318,"articleLive":2,"columnArticles":649,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106148,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6704929101958136,"acs":9930,"articleLive":2,"columnArticles":169,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14810,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4341708213067436,"acs":13237,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30488,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7317090777837936,"acs":20272,"articleLive":2,"columnArticles":424,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27705,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.655356863970014,"acs":16785,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25612,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105933170620358,"acs":40469,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56951,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5671168526130358,"acs":4829,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8515,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39773620499921397,"acs":2530,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6361,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39081607187422013,"acs":10962,"articleLive":2,"columnArticles":166,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28049,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4328329297820823,"acs":4469,"articleLive":2,"columnArticles":98,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10325,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6328221242255986,"acs":35445,"articleLive":2,"columnArticles":385,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56011,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2999446596568899,"acs":3252,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10842,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4383423950290127,"acs":9594,"articleLive":2,"columnArticles":112,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21887,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7934037602967994,"acs":25235,"articleLive":2,"columnArticles":317,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31806,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5549382716049382,"acs":4495,"articleLive":2,"columnArticles":59,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8100,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5211989745612305,"acs":2643,"articleLive":2,"columnArticles":30,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5071,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48226850548831973,"acs":6854,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14212,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5299624600268805,"acs":11435,"articleLive":2,"columnArticles":151,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21577,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.691358024691358,"acs":7672,"articleLive":2,"columnArticles":100,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11097,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20874357090374723,"acs":5682,"articleLive":2,"columnArticles":72,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27220,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6411724295855278,"acs":8400,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13101,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6597112689498589,"acs":65667,"articleLive":2,"columnArticles":912,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99539,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7248812869797071,"acs":105484,"articleLive":2,"columnArticles":980,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":145519,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4553047721833795,"acs":9703,"articleLive":2,"columnArticles":133,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21311,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6446502926799831,"acs":42730,"articleLive":2,"columnArticles":402,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":66284,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7572424892703863,"acs":11292,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":14912,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7534047399796443,"acs":31090,"articleLive":2,"columnArticles":369,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41266,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.58125,"acs":47988,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82560,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.458807147830123,"acs":5931,"articleLive":2,"columnArticles":95,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12927,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37627617645662187,"acs":7924,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21059,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5869537682077264,"acs":4634,"articleLive":2,"columnArticles":85,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7895,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4097306479009949,"acs":3377,"articleLive":2,"columnArticles":65,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8242,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46466809421841543,"acs":3038,"articleLive":2,"columnArticles":38,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6538,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34136958194408823,"acs":1331,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3899,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.362570281124498,"acs":2257,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6225,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.530778739184178,"acs":4294,"articleLive":2,"columnArticles":63,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8090,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6048034934497817,"acs":2770,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4580,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5432662051604783,"acs":3453,"articleLive":2,"columnArticles":46,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6356,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7048677654273668,"acs":1839,"articleLive":2,"columnArticles":39,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2609,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.650715746421268,"acs":4773,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7335,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5421122994652406,"acs":2433,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4488,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4734892336188933,"acs":2045,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4319,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42213114754098363,"acs":824,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1952,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8643295702119231,"acs":13092,"articleLive":2,"columnArticles":63,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15147,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8191717905030003,"acs":11058,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13499,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4820986124876115,"acs":7783,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16144,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5867493981622758,"acs":34610,"articleLive":2,"columnArticles":672,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58986,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5807584269662921,"acs":3308,"articleLive":2,"columnArticles":54,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5696,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33651149747616377,"acs":2400,"articleLive":2,"columnArticles":53,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7132,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6692304901498386,"acs":18446,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27563,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6928827970387744,"acs":9453,"articleLive":2,"columnArticles":71,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13643,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4959726629240908,"acs":10160,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20485,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7207641837128522,"acs":7470,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10364,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6223613026413494,"acs":11734,"articleLive":2,"columnArticles":182,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18854,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7342652795838751,"acs":11293,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15380,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4903857359282135,"acs":4208,"articleLive":2,"columnArticles":90,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8581,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5705058365758755,"acs":14662,"articleLive":2,"columnArticles":143,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25700,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7609030615662893,"acs":11358,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":14927,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5282818581610473,"acs":10451,"articleLive":2,"columnArticles":95,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19783,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5364057239057239,"acs":10196,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19008,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.773350471293916,"acs":3610,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4668,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6896128680479825,"acs":5059,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7336,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5335097001763669,"acs":1815,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3402,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45023696682464454,"acs":1045,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2321,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854939583459834,"acs":19285,"articleLive":2,"columnArticles":285,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":32938,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5448467966573816,"acs":3912,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7180,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3785209596267817,"acs":27911,"articleLive":2,"columnArticles":285,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":73737,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4902876354127755,"acs":2625,"articleLive":2,"columnArticles":51,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5354,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3795093795093795,"acs":3682,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9702,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6091041448655535,"acs":26775,"articleLive":2,"columnArticles":377,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":43958,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3727291710169138,"acs":19635,"articleLive":2,"columnArticles":385,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52679,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5481020942408377,"acs":1675,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3056,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5195256247352816,"acs":6133,"articleLive":2,"columnArticles":109,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11805,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47159017032895595,"acs":7254,"articleLive":2,"columnArticles":102,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15382,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5805482087040154,"acs":4829,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8318,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6994513031550068,"acs":5099,"articleLive":2,"columnArticles":100,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7290,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6663881927039822,"acs":2393,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3591,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37038079819807135,"acs":5262,"articleLive":2,"columnArticles":66,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14207,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6367450867881222,"acs":35510,"articleLive":2,"columnArticles":1101,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55768,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610824330796658,"acs":28603,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37582,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5590371896346091,"acs":5156,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9223,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5760928961748634,"acs":4217,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7320,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41000998502246633,"acs":6570,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16024,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8395988718270134,"acs":66979,"articleLive":2,"columnArticles":681,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79775,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5767338956600755,"acs":58392,"articleLive":2,"columnArticles":582,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101246,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6296442242738122,"acs":11185,"articleLive":2,"columnArticles":202,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17764,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712915601023018,"acs":24126,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31280,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6448222829801777,"acs":7547,"articleLive":2,"columnArticles":86,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11704,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5399020227560051,"acs":6833,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12656,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6534652628018098,"acs":77269,"articleLive":2,"columnArticles":577,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118245,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619169730352073,"acs":42949,"articleLive":2,"columnArticles":478,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76433,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5192926784400295,"acs":22583,"articleLive":2,"columnArticles":368,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43488,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5216592360525365,"acs":17317,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33196,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6423055708769995,"acs":2329,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3626,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8665068778657774,"acs":8315,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9596,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6085946573751452,"acs":2620,"articleLive":2,"columnArticles":48,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4305,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5757894736842105,"acs":1094,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1900,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070288270053214,"acs":64971,"articleLive":2,"columnArticles":872,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":91893,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7050598619243206,"acs":8068,"articleLive":2,"columnArticles":103,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11443,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3181217096234936,"acs":12750,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40079,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4913247932544187,"acs":3030,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6167,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6931557188791916,"acs":6036,"articleLive":2,"columnArticles":92,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8708,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4139392013557886,"acs":3908,"articleLive":2,"columnArticles":72,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9441,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448564505470299,"acs":37102,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68095,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3802886091495241,"acs":6193,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16285,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6283697047496791,"acs":5874,"articleLive":2,"columnArticles":101,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9348,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4548420584309654,"acs":3067,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6743,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.38825394177025113,"acs":4654,"articleLive":2,"columnArticles":53,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":11987,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6464198625581911,"acs":2916,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4511,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7760864227841886,"acs":3161,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4073,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5360807113543091,"acs":6270,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11696,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5701263724880878,"acs":2752,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4827,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6080162457562666,"acs":77547,"articleLive":2,"columnArticles":860,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":127541,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43225487425826503,"acs":6119,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14156,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4779947983068999,"acs":9373,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19609,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6518797719145646,"acs":6745,"articleLive":2,"columnArticles":95,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10347,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5102082797634353,"acs":9921,"articleLive":2,"columnArticles":64,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19445,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3705301763658918,"acs":6870,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18541,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6366679802729496,"acs":166404,"articleLive":2,"columnArticles":1128,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":261367,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4417117349128681,"acs":10291,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23298,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46905421729553043,"acs":6601,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14073,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28667894413750766,"acs":4203,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14661,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5601654031702274,"acs":4064,"articleLive":2,"columnArticles":81,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7255,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7145368742481725,"acs":7722,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10807,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44230124119423014,"acs":5274,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":11924,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6042343161449539,"acs":4652,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7699,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48546511627906974,"acs":4175,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8600,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38570618264322176,"acs":1360,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3526,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37082332386984057,"acs":1698,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4579,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5692393203112593,"acs":14338,"articleLive":2,"columnArticles":222,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25188,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4796267804853839,"acs":9664,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20149,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43139311309211675,"acs":4936,"articleLive":2,"columnArticles":81,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11442,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.31741366642174873,"acs":3024,"articleLive":2,"columnArticles":45,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9527,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5512338783385803,"acs":5428,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9847,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4877097151775263,"acs":3750,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7689,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.686882819546264,"acs":59403,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86482,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6334158565304028,"acs":10490,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16561,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4690844889101409,"acs":38259,"articleLive":2,"columnArticles":493,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81561,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2675998727446257,"acs":5888,"articleLive":2,"columnArticles":99,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22003,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6087471722503501,"acs":5651,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9283,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8374972363475569,"acs":7576,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9046,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48326133909287255,"acs":2685,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5556,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43330835518920946,"acs":2313,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5338,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5707598127475694,"acs":1585,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2777,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224583793119992,"acs":6721,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20843,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166501397277563,"acs":13681,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22186,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.474443710068297,"acs":12921,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27234,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2674959437533802,"acs":2473,"articleLive":2,"columnArticles":53,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9245,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7578309832497397,"acs":8008,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10567,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.619475847893114,"acs":4822,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7784,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49069247952345496,"acs":7249,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14773,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4499425827330619,"acs":4310,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9579,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26524706288873534,"acs":6141,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23152,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4620169698176118,"acs":18568,"articleLive":2,"columnArticles":183,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40189,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6363674365137423,"acs":30447,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":47845,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7758749069247952,"acs":3126,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4029,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37203495630461925,"acs":1490,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4005,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.39718978824460716,"acs":2007,"articleLive":2,"columnArticles":41,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5053,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5988857938718662,"acs":645,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1077,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5855222700518317,"acs":13330,"articleLive":2,"columnArticles":260,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22766,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.608269209927387,"acs":11225,"articleLive":2,"columnArticles":203,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18454,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3943059370378196,"acs":7465,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18932,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4421152929966651,"acs":1856,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4198,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6942905837239028,"acs":3259,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4694,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6451742710332447,"acs":20843,"articleLive":2,"columnArticles":325,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32306,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6510738750742227,"acs":44956,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69049,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26717829734071036,"acs":5988,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22412,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49853062184083696,"acs":4241,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8507,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6047687067355235,"acs":5504,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9101,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.510847258868367,"acs":3485,"articleLive":2,"columnArticles":62,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6822,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6361126449475428,"acs":13824,"articleLive":2,"columnArticles":263,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21732,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.692987743620655,"acs":3449,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4977,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.37006969441678794,"acs":4832,"articleLive":2,"columnArticles":60,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13057,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7473948282516403,"acs":3873,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5182,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43790849673202614,"acs":737,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1683,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.686675919500347,"acs":17811,"articleLive":2,"columnArticles":250,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25938,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24700851186315226,"acs":6007,"articleLive":2,"columnArticles":85,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24319,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.503404678384513,"acs":26836,"articleLive":2,"columnArticles":294,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53309,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6214727085478887,"acs":12069,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19420,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7276046420654584,"acs":5580,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7669,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4674644073718229,"acs":5352,"articleLive":2,"columnArticles":82,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11449,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6155748969308291,"acs":6719,"articleLive":2,"columnArticles":87,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10915,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7303143118706134,"acs":59831,"articleLive":2,"columnArticles":830,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":81925,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49683550957757733,"acs":47258,"articleLive":2,"columnArticles":612,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95118,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5294195019291477,"acs":12075,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22808,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4489864864864865,"acs":2658,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5920,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6555625392834695,"acs":7301,"articleLive":2,"columnArticles":61,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11137,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5099405615904898,"acs":4976,"articleLive":2,"columnArticles":96,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9758,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7743549236440231,"acs":5882,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7596,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6349026280960484,"acs":3358,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5289,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41203703703703703,"acs":1958,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4752,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5380934854619065,"acs":1462,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2717,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6945570630486831,"acs":21757,"articleLive":2,"columnArticles":350,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31325,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42244056406862496,"acs":8298,"articleLive":2,"columnArticles":113,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19643,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.630719296408753,"acs":12048,"articleLive":2,"columnArticles":171,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19102,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5267796610169492,"acs":3885,"articleLive":2,"columnArticles":72,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7375,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439002287621427,"acs":76362,"articleLive":2,"columnArticles":1109,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90487,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6725246956122215,"acs":5855,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8706,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4753060363022372,"acs":3378,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7107,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32670237184391737,"acs":4697,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14377,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5397421250204015,"acs":3307,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6127,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5971386684191902,"acs":11812,"articleLive":2,"columnArticles":136,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19781,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6625397245762712,"acs":10007,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15104,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5397408963585434,"acs":3083,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5712,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4179545059906234,"acs":2407,"articleLive":2,"columnArticles":43,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5759,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49285370162196884,"acs":3069,"articleLive":2,"columnArticles":62,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6227,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5617724371010139,"acs":2992,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5326,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4695205003474635,"acs":33782,"articleLive":2,"columnArticles":420,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":71950,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48157352406352283,"acs":7945,"articleLive":2,"columnArticles":115,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16498,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3433541532893585,"acs":5882,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17131,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46244682411618016,"acs":6305,"articleLive":2,"columnArticles":110,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13634,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.562172463077656,"acs":1180,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2099,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7106424717999019,"acs":10143,"articleLive":2,"columnArticles":131,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14273,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6588110403397027,"acs":3103,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4710,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4910432778633941,"acs":34731,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70729,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49395475819032764,"acs":2533,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5128,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.595020277280015,"acs":6309,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10603,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.471172203130966,"acs":1234,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2619,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5403428093645485,"acs":2585,"articleLive":2,"columnArticles":55,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4784,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6199440345967947,"acs":2437,"articleLive":2,"columnArticles":41,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3931,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5108162676665705,"acs":3542,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6934,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4811722331368697,"acs":2939,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6108,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6169211014410044,"acs":8648,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14018,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5595348837209302,"acs":34887,"articleLive":2,"columnArticles":479,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62350,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5748164014687882,"acs":22542,"articleLive":2,"columnArticles":319,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39216,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5622406639004149,"acs":2710,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4820,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7724231552409581,"acs":7966,"articleLive":2,"columnArticles":95,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10313,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7485372837047181,"acs":18039,"articleLive":2,"columnArticles":312,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24099,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3931643277501132,"acs":5211,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13254,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5986890922582241,"acs":14523,"articleLive":2,"columnArticles":228,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24258,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6809675947056139,"acs":2984,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4382,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6660854402789886,"acs":1528,"articleLive":2,"columnArticles":36,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2294,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.562962962962963,"acs":1824,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3240,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.561299176578225,"acs":1227,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2186,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4788424124513619,"acs":1969,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4112,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6035543403964456,"acs":12362,"articleLive":2,"columnArticles":251,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20482,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7281671664167916,"acs":7771,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10672,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5258477830322137,"acs":13010,"articleLive":2,"columnArticles":198,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24741,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4193722943722944,"acs":3100,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7392,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5699917169565731,"acs":4817,"articleLive":2,"columnArticles":83,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8451,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9218802840716943,"acs":2726,"articleLive":2,"columnArticles":66,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2957,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8239836725688124,"acs":29876,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36258,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6072403483686468,"acs":9343,"articleLive":2,"columnArticles":145,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15386,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5845690794303333,"acs":7963,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13622,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4914741295151318,"acs":30206,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61460,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8037674481637078,"acs":5931,"articleLive":2,"columnArticles":82,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7379,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5069401284441682,"acs":2447,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4827,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5190568475452196,"acs":1607,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3096,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5442554668517876,"acs":1568,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2881,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6009882643607165,"acs":973,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1619,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5412569758171671,"acs":8147,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15052,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5013448090371168,"acs":6524,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13013,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7250275885688192,"acs":19053,"articleLive":2,"columnArticles":234,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26279,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5973187686196624,"acs":3609,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6042,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6194029850746269,"acs":1577,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2546,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5056512174770538,"acs":6666,"articleLive":2,"columnArticles":69,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13183,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318112493338968,"acs":45268,"articleLive":2,"columnArticles":616,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54421,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.810724106324473,"acs":12383,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15274,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41834586466165413,"acs":6955,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16625,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6601991319887669,"acs":2586,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3917,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8133730676103558,"acs":4367,"articleLive":2,"columnArticles":59,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5369,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6456521739130435,"acs":4752,"articleLive":2,"columnArticles":92,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7360,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6035634743875279,"acs":15447,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25593,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.563440414507772,"acs":13593,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24125,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6264096385542168,"acs":6499,"articleLive":2,"columnArticles":97,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10375,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8095087019579406,"acs":53583,"articleLive":2,"columnArticles":695,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66192,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5198038195734562,"acs":6995,"articleLive":2,"columnArticles":156,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13457,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4696780243826196,"acs":6010,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12796,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35913564514817126,"acs":13246,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":36883,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6567644276253548,"acs":6942,"articleLive":2,"columnArticles":72,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10570,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8085092048306413,"acs":48002,"articleLive":2,"columnArticles":636,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59371,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4536720499823176,"acs":7697,"articleLive":2,"columnArticles":122,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16966,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.457603065351593,"acs":6449,"articleLive":2,"columnArticles":92,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14093,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.597254004576659,"acs":2610,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4370,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7865040524094358,"acs":30374,"articleLive":2,"columnArticles":432,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38619,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4668757501839161,"acs":24116,"articleLive":2,"columnArticles":363,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51654,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36096075778078485,"acs":3201,"articleLive":2,"columnArticles":74,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8868,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8182652210175146,"acs":19622,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":23980,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8220061699541927,"acs":8793,"articleLive":2,"columnArticles":83,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10697,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7242191500256017,"acs":21216,"articleLive":2,"columnArticles":383,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29295,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7469789273943873,"acs":14959,"articleLive":2,"columnArticles":226,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20026,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5754077210625558,"acs":17394,"articleLive":2,"columnArticles":272,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30229,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3312274368231047,"acs":1835,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5540,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7506748117630345,"acs":5284,"articleLive":2,"columnArticles":59,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7039,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7556163135110504,"acs":16582,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21945,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129873880812554,"acs":37029,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51935,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3783175274612813,"acs":5545,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14657,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6675733805668016,"acs":10553,"articleLive":2,"columnArticles":150,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15808,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8318348318348319,"acs":34972,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42042,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7393325690994778,"acs":11609,"articleLive":2,"columnArticles":192,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15702,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.810320781032078,"acs":12782,"articleLive":2,"columnArticles":262,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15774,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4402027562173293,"acs":2779,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6313,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6143270622286541,"acs":10188,"articleLive":2,"columnArticles":192,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16584,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6545113565326109,"acs":6282,"articleLive":2,"columnArticles":112,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9598,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6169454894741055,"acs":30830,"articleLive":2,"columnArticles":512,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":49972,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5866538646183389,"acs":2444,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4166,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.614323906008161,"acs":4366,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7107,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5938132733408324,"acs":5279,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8890,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7550145935539961,"acs":24316,"articleLive":2,"columnArticles":478,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32206,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5889741800418702,"acs":5908,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10031,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7289579158316634,"acs":10185,"articleLive":2,"columnArticles":181,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13972,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4727302685780194,"acs":5738,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12138,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6888160383306015,"acs":5463,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7931,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46208401527550463,"acs":5929,"articleLive":2,"columnArticles":121,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12831,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7719414893617021,"acs":6966,"articleLive":2,"columnArticles":157,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9024,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37816764132553604,"acs":1164,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3078,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5355082011904221,"acs":11786,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22009,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6867575249617375,"acs":9423,"articleLive":2,"columnArticles":134,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13721,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5434466724789305,"acs":5610,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10323,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4898492637448811,"acs":5622,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11477,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5860614242321971,"acs":3473,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5926,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4220161673799334,"acs":1775,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4206,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7059720734298114,"acs":38880,"articleLive":2,"columnArticles":619,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55073,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6396007362310633,"acs":9035,"articleLive":2,"columnArticles":129,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14126,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3983123981206252,"acs":8308,"articleLive":2,"columnArticles":130,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20858,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5740984469597262,"acs":4362,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7598,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.47881717372760874,"acs":3368,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7034,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.820256385164889,"acs":41911,"articleLive":2,"columnArticles":637,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51095,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5445193785214274,"acs":12757,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23428,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5924494649227111,"acs":5979,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10092,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.366601352632577,"acs":5800,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15821,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.434961382452631,"acs":15656,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":35994,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7400056974646282,"acs":7793,"articleLive":2,"columnArticles":115,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10531,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30482849853538696,"acs":3226,"articleLive":2,"columnArticles":50,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10583,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5060513151524931,"acs":3136,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6197,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8475640636078193,"acs":8368,"articleLive":2,"columnArticles":84,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9873,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7548752892120719,"acs":29690,"articleLive":2,"columnArticles":543,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39331,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.444571351787154,"acs":6617,"articleLive":2,"columnArticles":71,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14884,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2837675950883498,"acs":11370,"articleLive":2,"columnArticles":152,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40068,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28148724936733505,"acs":2892,"articleLive":2,"columnArticles":70,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10274,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6617138908085695,"acs":3830,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5788,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315584249552544,"acs":45778,"articleLive":2,"columnArticles":505,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62576,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5291721419185282,"acs":4027,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7610,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4935110797210206,"acs":5590,"articleLive":2,"columnArticles":111,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11327,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5509005481597494,"acs":2814,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5108,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5053323853537149,"acs":8529,"articleLive":2,"columnArticles":140,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16878,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4021369596891695,"acs":7452,"articleLive":2,"columnArticles":200,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18531,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5252005149024656,"acs":5304,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10099,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36528999552706126,"acs":4900,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13414,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6731273975368464,"acs":3334,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4953,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250419988541353,"acs":84962,"articleLive":2,"columnArticles":1087,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":102979,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5380760762280768,"acs":7087,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13171,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41830317740511913,"acs":15166,"articleLive":2,"columnArticles":221,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36256,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.524645312271464,"acs":3587,"articleLive":2,"columnArticles":87,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6837,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.608793686583991,"acs":2700,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4435,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900613355696973,"acs":48046,"articleLive":2,"columnArticles":575,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60813,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5800421490543832,"acs":21193,"articleLive":2,"columnArticles":264,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36537,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5131545820745217,"acs":8153,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15888,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40248020816032776,"acs":7270,"articleLive":2,"columnArticles":162,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18063,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7394517074023873,"acs":16912,"articleLive":2,"columnArticles":225,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22871,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5740605254406385,"acs":8631,"articleLive":2,"columnArticles":171,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15035,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.502853689652857,"acs":7489,"articleLive":2,"columnArticles":153,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14893,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3243453259771544,"acs":4174,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12869,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8624128815188656,"acs":7177,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8322,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8375556454876568,"acs":10348,"articleLive":2,"columnArticles":160,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12355,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.728044458058023,"acs":16638,"articleLive":2,"columnArticles":250,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22853,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7315971792651244,"acs":11827,"articleLive":2,"columnArticles":152,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16166,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6929457992889665,"acs":11110,"articleLive":2,"columnArticles":174,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16033,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3229602325086836,"acs":4556,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14107,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5433380084151472,"acs":1937,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3565,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7010652117433099,"acs":13492,"articleLive":2,"columnArticles":201,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19245,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.311881434326354,"acs":6271,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20107,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6950777754101853,"acs":9786,"articleLive":2,"columnArticles":170,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14079,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5409090909090909,"acs":4165,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7700,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8311707504507434,"acs":28121,"articleLive":2,"columnArticles":479,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33833,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3534309342869915,"acs":6325,"articleLive":2,"columnArticles":115,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17896,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3994840722298878,"acs":6659,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16669,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4031857674803475,"acs":7796,"articleLive":2,"columnArticles":143,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19336,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8562367864693446,"acs":4050,"articleLive":2,"columnArticles":60,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4730,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6648621280573298,"acs":17071,"articleLive":2,"columnArticles":274,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25676,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7485912896940334,"acs":14215,"articleLive":2,"columnArticles":211,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18989,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41218695809977013,"acs":10221,"articleLive":2,"columnArticles":142,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":24797,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3736303871439007,"acs":1023,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2738,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.761612620508326,"acs":4345,"articleLive":2,"columnArticles":64,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5705,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6709068820124348,"acs":9388,"articleLive":2,"columnArticles":150,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13993,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6051194173717468,"acs":5650,"articleLive":2,"columnArticles":97,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9337,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41686207631635047,"acs":3911,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9382,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7533730781299027,"acs":9604,"articleLive":2,"columnArticles":175,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12748,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6909468627260038,"acs":21286,"articleLive":2,"columnArticles":362,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30807,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49290853031860227,"acs":7194,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14595,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5075495724940877,"acs":5580,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10994,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5688256729751969,"acs":4839,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8507,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6664764296313206,"acs":5839,"articleLive":2,"columnArticles":65,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8761,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6151505371386418,"acs":13342,"articleLive":2,"columnArticles":203,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21689,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8066188197767146,"acs":8092,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10032,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4751632313404174,"acs":7423,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15622,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5505115089514067,"acs":7749,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14076,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5556430963167225,"acs":2821,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5077,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6930452569675275,"acs":10842,"articleLive":2,"columnArticles":220,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15644,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6027945742768426,"acs":7377,"articleLive":2,"columnArticles":148,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12238,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6849885488236519,"acs":6580,"articleLive":2,"columnArticles":178,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9606,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4091507089606783,"acs":2799,"articleLive":2,"columnArticles":50,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6841,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5188424489137883,"acs":12873,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24811,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7326805524111388,"acs":25890,"articleLive":2,"columnArticles":415,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35336,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4189261031366295,"acs":7880,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18810,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5968973159320364,"acs":2424,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4061,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7479608482871125,"acs":2751,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3678,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5400680693069307,"acs":10473,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19392,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541971383147853,"acs":34859,"articleLive":2,"columnArticles":510,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":62900,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39778317823484083,"acs":6711,"articleLive":2,"columnArticles":143,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16871,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43793008532892924,"acs":3182,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7266,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7090997095837367,"acs":1465,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2066,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.657608695652174,"acs":1089,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1656,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5938158819395642,"acs":845,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1423,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5045239121068505,"acs":1171,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2321,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5843071786310517,"acs":700,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1198,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462401553565649,"acs":78438,"articleLive":2,"columnArticles":1030,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92690,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3938466917227515,"acs":4506,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11441,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6441823056300268,"acs":6007,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9325,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4651077822433321,"acs":2546,"articleLive":2,"columnArticles":45,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5474,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6197310772019943,"acs":4102,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6619,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8212480237347023,"acs":42075,"articleLive":2,"columnArticles":632,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":51233,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5873400597486049,"acs":10420,"articleLive":2,"columnArticles":175,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17741,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4825754574400963,"acs":32888,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68151,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5617722667473158,"acs":3715,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6613,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6985759493670886,"acs":2649,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3792,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6474461004196209,"acs":17898,"articleLive":2,"columnArticles":374,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27644,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.791605739352952,"acs":34647,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43768,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4104838709677419,"acs":5599,"articleLive":2,"columnArticles":139,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13640,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5253997166565473,"acs":2596,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4941,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8568334416287633,"acs":3956,"articleLive":2,"columnArticles":50,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4617,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5731126728632963,"acs":12640,"articleLive":2,"columnArticles":215,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22055,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6174313848732453,"acs":5894,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9546,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7107857563272513,"acs":9661,"articleLive":2,"columnArticles":154,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13592,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6278492611965942,"acs":16444,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26191,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8025292802562648,"acs":24051,"articleLive":2,"columnArticles":341,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29969,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5227332045727411,"acs":10014,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19157,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4990330446481123,"acs":5935,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11893,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36481357445858453,"acs":1634,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4479,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3968216130313866,"acs":4994,"articleLive":2,"columnArticles":80,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12585,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.633137348376503,"acs":11953,"articleLive":2,"columnArticles":205,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18879,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5225846925972396,"acs":13328,"articleLive":2,"columnArticles":207,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25504,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.63288,"acs":7911,"articleLive":2,"columnArticles":137,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12500,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4423122482823975,"acs":5601,"articleLive":2,"columnArticles":89,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12663,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5965281430825881,"acs":2268,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3802,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7455939071425084,"acs":15272,"articleLive":2,"columnArticles":310,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20483,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5005972696245734,"acs":5867,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11720,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4276179991743498,"acs":6215,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14534,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5915213071318172,"acs":2679,"articleLive":2,"columnArticles":64,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4529,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7685904872389792,"acs":26501,"articleLive":2,"columnArticles":369,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34480,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30915825900472776,"acs":6343,"articleLive":2,"columnArticles":80,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20517,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4843881212306283,"acs":6345,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13099,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6179775280898876,"acs":1650,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2670,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7077549066539014,"acs":2957,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4178,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7946685878962536,"acs":2206,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2776,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8428835198131519,"acs":53411,"articleLive":2,"columnArticles":724,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63367,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5437546193643754,"acs":7357,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13530,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6173665589909245,"acs":8027,"articleLive":2,"columnArticles":130,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13002,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6745358897439242,"acs":15515,"articleLive":2,"columnArticles":165,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23001,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.718421052631579,"acs":1911,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2660,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7212947685140251,"acs":14863,"articleLive":2,"columnArticles":231,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20606,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8651299993139878,"acs":12611,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14577,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28953626634958385,"acs":4870,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16820,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5796025333042149,"acs":2654,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4579,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5659163987138264,"acs":1936,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3421,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692435268234896,"acs":128409,"articleLive":2,"columnArticles":1285,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147725,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5142159605310005,"acs":10110,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19661,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5866787289381432,"acs":31128,"articleLive":2,"columnArticles":404,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53058,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30038707354397337,"acs":3337,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11109,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8069815195071869,"acs":786,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":974,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6602912791717845,"acs":3763,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5699,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585511177852593,"acs":70894,"articleLive":2,"columnArticles":680,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82574,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31034343434343437,"acs":7681,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24750,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2369358475767182,"acs":7250,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30599,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6909080026336266,"acs":11543,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16707,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8555718475073314,"acs":1167,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1364,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6718148022980737,"acs":19879,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29590,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.663029332265492,"acs":6623,"articleLive":2,"columnArticles":79,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9989,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5673346102843672,"acs":7701,"articleLive":2,"columnArticles":146,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13574,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.36869104749296705,"acs":2228,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6043,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.542648477332231,"acs":3938,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7257,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5377075020934929,"acs":10916,"articleLive":2,"columnArticles":165,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20301,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39063969896519285,"acs":8305,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21260,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33442370598422166,"acs":5214,"articleLive":2,"columnArticles":66,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15591,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37590934527140457,"acs":2687,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7148,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.3022256930886372,"acs":774,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2561,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5918633270595048,"acs":4088,"articleLive":2,"columnArticles":60,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6907,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7172248127737741,"acs":25379,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35385,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5129546137661557,"acs":8533,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16635,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5946249498596069,"acs":7412,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12465,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3628552544613351,"acs":3294,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9078,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8428781204111601,"acs":574,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":681,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5895731707317073,"acs":9669,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16400,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5526100027329871,"acs":6066,"articleLive":2,"columnArticles":52,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10977,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5467220093656875,"acs":5137,"articleLive":2,"columnArticles":76,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9396,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5773537477148081,"acs":5053,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8752,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6790042581067802,"acs":4146,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6106,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8489155474420829,"acs":58593,"articleLive":2,"columnArticles":742,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69021,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37970157464072063,"acs":11044,"articleLive":2,"columnArticles":148,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29086,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.32220063654776177,"acs":7795,"articleLive":2,"columnArticles":135,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24193,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3424013984485961,"acs":3134,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9153,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5829268292682926,"acs":239,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":410,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7321582115219261,"acs":3406,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4652,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6744046971838643,"acs":24810,"articleLive":2,"columnArticles":397,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36788,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29757074068062545,"acs":5500,"articleLive":2,"columnArticles":123,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18483,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33244927728417983,"acs":2507,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7541,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39654135338345864,"acs":2637,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6650,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.708092485549133,"acs":735,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1038,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5772112201637726,"acs":9939,"articleLive":2,"columnArticles":170,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17219,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42802470209619903,"acs":4921,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11497,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6637845849802372,"acs":5374,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8096,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6147380766223612,"acs":3145,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5116,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5036042402826855,"acs":3563,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7075,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851304827731203,"acs":29875,"articleLive":2,"columnArticles":358,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38051,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6905243503967636,"acs":8876,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12854,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5669414998036906,"acs":8664,"articleLive":2,"columnArticles":146,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15282,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32790114613180515,"acs":1831,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5584,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6141804788213628,"acs":2668,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4344,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6186440677966102,"acs":292,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":472,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7893402185439624,"acs":17120,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21689,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45310839076912524,"acs":13214,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29163,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4398968739929101,"acs":4095,"articleLive":2,"columnArticles":78,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9309,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36578925653931843,"acs":4433,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12119,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5990566037735849,"acs":127,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":212,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5392939623886506,"acs":16346,"articleLive":2,"columnArticles":246,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30310,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31753212693417254,"acs":4843,"articleLive":2,"columnArticles":85,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15252,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4605273391926577,"acs":5921,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12857,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38276770494343715,"acs":2470,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6453,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5518154311649016,"acs":2918,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5288,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5459386006267506,"acs":19686,"articleLive":2,"columnArticles":319,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36059,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5536296296296296,"acs":7474,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13500,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41404241645244216,"acs":5154,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12448,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5366339262012211,"acs":4043,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7534,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7128309572301426,"acs":350,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":491,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6694124107633168,"acs":2438,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3642,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.65957579150339,"acs":21208,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32154,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8166031652989449,"acs":11145,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13648,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5109726665544143,"acs":9104,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17817,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2956451798230495,"acs":7719,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26109,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7117726657645467,"acs":526,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":739,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4383282364933741,"acs":3010,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6867,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5785216925549009,"acs":10801,"articleLive":2,"columnArticles":165,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18670,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.768381628227873,"acs":7796,"articleLive":2,"columnArticles":105,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10146,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6226099092812282,"acs":4461,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7165,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3674270557029178,"acs":3463,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9425,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5745206760638654,"acs":8600,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14969,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7803055798613449,"acs":11593,"articleLive":2,"columnArticles":167,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14857,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3093031740240788,"acs":4239,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13705,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37806044376434583,"acs":3953,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10456,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5409015025041736,"acs":648,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1198,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7246636771300449,"acs":3232,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4460,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4455434352568812,"acs":7883,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17693,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39776393547356653,"acs":12452,"articleLive":2,"columnArticles":200,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":31305,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4554349759829212,"acs":2560,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5621,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47356268760101594,"acs":2051,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4331,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.896398891966759,"acs":1618,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1805,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.758428220584952,"acs":3397,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4479,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8050008461668641,"acs":19027,"articleLive":2,"columnArticles":319,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23636,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2956209237321975,"acs":4442,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15026,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3265011348786024,"acs":4747,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14539,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5967788323267185,"acs":4150,"articleLive":2,"columnArticles":67,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":6954,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4765225724020443,"acs":17902,"articleLive":2,"columnArticles":252,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37568,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32486145614370343,"acs":5100,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15699,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.582263522586883,"acs":10840,"articleLive":2,"columnArticles":202,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18617,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.618791120003078,"acs":16083,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25991,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6372093023255814,"acs":274,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":430,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8083916083916084,"acs":3468,"articleLive":2,"columnArticles":45,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4290,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6709577026453529,"acs":9486,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14138,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.68532470873608,"acs":18647,"articleLive":2,"columnArticles":242,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27209,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6644508079361833,"acs":25988,"articleLive":2,"columnArticles":327,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39112,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.43012309920347574,"acs":2376,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5524,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6247960848287113,"acs":383,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":613,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8245866283249461,"acs":3441,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4173,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8392337164750958,"acs":43808,"articleLive":2,"columnArticles":697,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52200,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2933833665186093,"acs":3831,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13058,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26866666666666666,"acs":3627,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13500,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5778474399164054,"acs":1106,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1914,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4447596988998263,"acs":7681,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17270,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5310392701309005,"acs":5355,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10084,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3140085720730882,"acs":4176,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13299,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4646638758926373,"acs":1887,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4061,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7535233322893831,"acs":2406,"articleLive":2,"columnArticles":40,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3193,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6621315192743764,"acs":292,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":441,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6719534598897734,"acs":10973,"articleLive":2,"columnArticles":149,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16330,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41938287700999566,"acs":3860,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9204,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6789193976970771,"acs":16863,"articleLive":2,"columnArticles":206,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24838,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48963497070752593,"acs":2173,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4438,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.785876993166287,"acs":690,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":878,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443811727021977,"acs":56940,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67434,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4154546463861441,"acs":3742,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9007,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7354782984236666,"acs":3406,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4631,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3407703641338666,"acs":1619,"articleLive":2,"columnArticles":33,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4751,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5453850563730174,"acs":2854,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5233,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6390578999018646,"acs":9768,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15285,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5117890825950272,"acs":7163,"articleLive":2,"columnArticles":123,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13996,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27009313556398756,"acs":2349,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8697,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6105109489051095,"acs":2091,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3425,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7350993377483444,"acs":444,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":604,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7221979938944614,"acs":1656,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2293,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8212214261344251,"acs":16849,"articleLive":2,"columnArticles":285,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20517,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49620963968179693,"acs":5302,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10685,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27570247933884295,"acs":5004,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18150,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6199432221433641,"acs":1747,"articleLive":2,"columnArticles":32,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2818,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5946969696969697,"acs":314,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":528,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6746732928400515,"acs":7331,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10866,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3720789989446706,"acs":2468,"articleLive":2,"columnArticles":42,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6633,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4402687904430065,"acs":1769,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4018,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14959674974228368,"acs":2467,"articleLive":2,"columnArticles":54,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16491,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7832489645651174,"acs":3404,"articleLive":2,"columnArticles":44,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4346,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6260912535002471,"acs":11403,"articleLive":2,"columnArticles":197,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18213,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5430954587581094,"acs":2930,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5395,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3866890490767256,"acs":3916,"articleLive":2,"columnArticles":84,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10127,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3808706506475269,"acs":2441,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6409,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8418803418803419,"acs":394,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":468,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5241751269035533,"acs":8261,"articleLive":2,"columnArticles":98,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15760,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7682483646557989,"acs":7399,"articleLive":2,"columnArticles":115,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9631,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49307344103644735,"acs":25271,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51252,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3185763888888889,"acs":1468,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4608,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.656,"acs":2706,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4125,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5256570713391739,"acs":420,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":799,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5482185273159145,"acs":1154,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2105,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7066060653553796,"acs":9017,"articleLive":2,"columnArticles":176,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12761,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8068078668683812,"acs":5333,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6610,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7111336545777327,"acs":2804,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3943,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40326713645099294,"acs":1259,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3122,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6605902324366676,"acs":12647,"articleLive":2,"columnArticles":216,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19145,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7706111501373012,"acs":12067,"articleLive":2,"columnArticles":278,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15659,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4509571049322342,"acs":6455,"articleLive":2,"columnArticles":106,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14314,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45164526484751205,"acs":2251,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4984,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5467980295566502,"acs":1110,"articleLive":2,"columnArticles":23,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2030,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4122257053291536,"acs":789,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1914,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5366338770853248,"acs":34805,"articleLive":2,"columnArticles":354,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":64858,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5143080309593127,"acs":7243,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14083,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27704760378265747,"acs":3457,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12478,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47399813606710156,"acs":2543,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5365,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7953667953667953,"acs":1236,"articleLive":2,"columnArticles":29,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1554,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6814882032667876,"acs":751,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1102,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6564428829171018,"acs":6913,"articleLive":2,"columnArticles":176,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10531,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5066832024252446,"acs":3677,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7257,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.273971512691971,"acs":3443,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12567,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38301922710831904,"acs":2012,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5253,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7807726864330637,"acs":7821,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10017,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46462585034013604,"acs":5464,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11760,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2991817136674106,"acs":8848,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29574,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4124154886293792,"acs":1342,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3254,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7406015037593985,"acs":394,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":532,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7230462065031374,"acs":2535,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3506,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8119877049180327,"acs":20605,"articleLive":2,"columnArticles":284,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25376,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.572863568215892,"acs":7642,"articleLive":2,"columnArticles":131,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13340,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5452060342209173,"acs":5385,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9877,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6644381589097454,"acs":5168,"articleLive":2,"columnArticles":81,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7778,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6977401129943502,"acs":247,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":354,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6026213050752928,"acs":2161,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3586,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4429718613305478,"acs":6785,"articleLive":2,"columnArticles":129,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15317,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7580769458770525,"acs":12788,"articleLive":2,"columnArticles":234,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16869,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5264396284829721,"acs":4251,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8075,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4669109228303183,"acs":2039,"articleLive":2,"columnArticles":40,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4367,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8507574753765293,"acs":38524,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45282,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3538179424487493,"acs":7525,"articleLive":2,"columnArticles":168,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21268,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.363914373088685,"acs":2499,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6867,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43639102778707733,"acs":2607,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5974,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7638238050609185,"acs":815,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1067,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3900584795321637,"acs":2001,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5130,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8304874558809501,"acs":17412,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20966,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4970915619389587,"acs":6922,"articleLive":2,"columnArticles":110,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13925,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46462731581214994,"acs":5392,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11605,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3845157110463233,"acs":2374,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6174,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5191693290734825,"acs":325,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":626,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8960331864143116,"acs":3456,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3857,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8279300520679831,"acs":16855,"articleLive":2,"columnArticles":356,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20358,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5997069835585219,"acs":3684,"articleLive":2,"columnArticles":85,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6143,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4709562109025916,"acs":2635,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5595,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4016877637130802,"acs":952,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2370,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8055916247362441,"acs":19853,"articleLive":2,"columnArticles":265,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24644,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8668765593441844,"acs":14593,"articleLive":2,"columnArticles":190,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16834,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5185982537973927,"acs":4336,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8361,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48841893252769386,"acs":2425,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4965,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6472727272727272,"acs":178,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":275,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8,"acs":2252,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2815,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6358776114492515,"acs":7731,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12158,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.46127469250838615,"acs":6188,"articleLive":2,"columnArticles":131,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13415,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39816889685639284,"acs":6219,"articleLive":2,"columnArticles":112,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15619,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5257682071134769,"acs":2173,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4133,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5337915234822451,"acs":466,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":873,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7978290366350068,"acs":1764,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2211,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7109685580050596,"acs":7869,"articleLive":2,"columnArticles":181,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11068,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6099212598425197,"acs":3873,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6350,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4769956104698423,"acs":2934,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6151,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38438347904733194,"acs":1275,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3317,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7815794579910743,"acs":12084,"articleLive":2,"columnArticles":184,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15461,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34689416479446233,"acs":5713,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16469,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5849441873128233,"acs":4297,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7346,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032322227747389,"acs":14168,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28154,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6991017964071856,"acs":934,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1336,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.704421261798311,"acs":1418,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2013,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6938012542209359,"acs":11506,"articleLive":2,"columnArticles":184,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16584,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3590646485867074,"acs":30081,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83776,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26232996745389303,"acs":6287,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":23966,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49641224282448565,"acs":15635,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31496,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6368421052631579,"acs":242,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":380,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7298230470435908,"acs":1691,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2317,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6741554608068219,"acs":8222,"articleLive":2,"columnArticles":192,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12196,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43273809523809526,"acs":2181,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5040,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48868778280542985,"acs":1944,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3978,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.36829699469652327,"acs":625,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1697,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8693788145430037,"acs":46437,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53414,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6456802024340282,"acs":10717,"articleLive":2,"columnArticles":165,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16598,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5148051382538645,"acs":4729,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9186,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5064504158389906,"acs":23201,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45811,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5631229235880398,"acs":339,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":602,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7882932568571218,"acs":10720,"articleLive":2,"columnArticles":146,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13599,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4799373313604317,"acs":5514,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11489,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5749579831932773,"acs":3421,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5950,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3578099838969404,"acs":1111,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3105,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.622306348281887,"acs":2137,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3434,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5307557117750439,"acs":604,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1138,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4717521478781567,"acs":1812,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3841,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7925866452562559,"acs":11846,"articleLive":2,"columnArticles":204,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":14946,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4578548212351029,"acs":2113,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4615,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232198302628855,"acs":27951,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38648,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48861480075901326,"acs":1030,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2108,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44910170212095923,"acs":28522,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63509,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3103507713522365,"acs":3601,"articleLive":2,"columnArticles":103,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11603,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539461274814252,"acs":28429,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43473,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4710613743661479,"acs":2694,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5719,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7008547008547008,"acs":574,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":819,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.842061855670103,"acs":2042,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2425,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7090098426852864,"acs":8428,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11887,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6969149267684637,"acs":22364,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32090,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3628262987845531,"acs":28299,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77996,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48415442235666956,"acs":3361,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6942,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5921985815602837,"acs":835,"articleLive":2,"columnArticles":36,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1410,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7039827771797632,"acs":1308,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1858,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7495251017639077,"acs":11048,"articleLive":2,"columnArticles":222,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14740,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5320727272727273,"acs":3658,"articleLive":2,"columnArticles":84,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6875,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4574243490499648,"acs":3250,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7105,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4715059588299025,"acs":2176,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4615,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6808112773302647,"acs":9466,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13904,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6300200274059239,"acs":5977,"articleLive":2,"columnArticles":127,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9487,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4217413185707096,"acs":4190,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9935,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4013653818802446,"acs":2822,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7031,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7936170212765957,"acs":373,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":470,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9201578627808136,"acs":3031,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3294,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6378065091395453,"acs":7153,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11215,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4292386735170481,"acs":4595,"articleLive":2,"columnArticles":96,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10705,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.538740137110335,"acs":4165,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7731,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4297603195739015,"acs":2582,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6008,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6964856230031949,"acs":654,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":939,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6102786934372191,"acs":4073,"articleLive":2,"columnArticles":81,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6674,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47523536635284486,"acs":2322,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4886,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5515763697581879,"acs":3604,"articleLive":2,"columnArticles":82,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6534,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37590168314186484,"acs":1407,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3743,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7885714285714286,"acs":828,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1050,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7653232860122452,"acs":11375,"articleLive":2,"columnArticles":201,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14863,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8560844758579579,"acs":10053,"articleLive":2,"columnArticles":170,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11743,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37030379291749055,"acs":4120,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11126,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3655897114178168,"acs":2331,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6376,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5165165165165165,"acs":344,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":666,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8427066877303844,"acs":16003,"articleLive":2,"columnArticles":199,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18990,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5505524861878454,"acs":5979,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10860,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4743047830923248,"acs":4264,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8990,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46415392725355825,"acs":1761,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3794,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7826721120186698,"acs":5366,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6856,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5145348837209303,"acs":177,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":344,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6475953565505804,"acs":5467,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8442,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.66455078125,"acs":5444,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8192,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5192063088272704,"acs":4082,"articleLive":2,"columnArticles":60,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7862,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.292498782269849,"acs":1201,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4106,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7987927565392354,"acs":1191,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1491,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42122386488684754,"acs":8804,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20901,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34962735642262166,"acs":6380,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18248,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3415761962203458,"acs":3398,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9948,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541687496528357,"acs":11777,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18003,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7169811320754716,"acs":228,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":318,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7102587800369686,"acs":1537,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2164,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6454707278481012,"acs":13054,"articleLive":2,"columnArticles":143,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20224,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8089218724514761,"acs":9919,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12262,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5134776154387062,"acs":6572,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12799,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4137674220661772,"acs":3889,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9399,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5763888888888888,"acs":166,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":288,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7873166522864539,"acs":1825,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2318,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48835478830270107,"acs":6563,"articleLive":2,"columnArticles":121,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13439,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5725131900656286,"acs":4449,"articleLive":2,"columnArticles":71,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7771,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5219021646497358,"acs":3062,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5867,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5186988271741536,"acs":2344,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4519,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6833884471962288,"acs":9713,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14213,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37926279988969575,"acs":4126,"articleLive":2,"columnArticles":109,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10879,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2623547880690738,"acs":4178,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15925,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40920518274995166,"acs":2116,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5171,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5725094577553594,"acs":454,"articleLive":2,"columnArticles":27,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":793,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48859554209045664,"acs":11289,"articleLive":2,"columnArticles":148,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23105,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6626011041211965,"acs":5161,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7789,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5857245706057801,"acs":5695,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9723,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2676412398329303,"acs":2435,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9098,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6265682656826568,"acs":1698,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2710,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6245733788395904,"acs":183,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":293,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6609240407204385,"acs":844,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1277,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7937201907790143,"acs":7988,"articleLive":2,"columnArticles":187,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10064,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5140573849412671,"acs":5339,"articleLive":2,"columnArticles":73,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10386,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.344439048081593,"acs":3546,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10295,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2997289972899729,"acs":1659,"articleLive":2,"columnArticles":38,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5535,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7527084999636443,"acs":10352,"articleLive":2,"columnArticles":152,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13753,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6981286549707603,"acs":5969,"articleLive":2,"columnArticles":96,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8550,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3738377591851582,"acs":25692,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68725,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3672883787661406,"acs":2304,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6273,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5151515151515151,"acs":102,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":198,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9015179563124769,"acs":2435,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2701,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8099637754894379,"acs":19900,"articleLive":2,"columnArticles":199,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24569,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7133544900934901,"acs":8317,"articleLive":2,"columnArticles":103,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11659,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6567911714770798,"acs":7737,"articleLive":2,"columnArticles":153,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11780,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2861949207727371,"acs":2637,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9214,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43926788685524126,"acs":264,"articleLive":2,"columnArticles":21,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":601,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.794769465908126,"acs":9360,"articleLive":2,"columnArticles":138,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11777,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8677397568662765,"acs":7709,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8884,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6826409239786244,"acs":3960,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5801,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4866401364411598,"acs":856,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1759,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7392040643522438,"acs":873,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1181,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8243596120368067,"acs":13259,"articleLive":2,"columnArticles":211,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16084,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6846149011721082,"acs":43573,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63646,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3515015370063845,"acs":5946,"articleLive":2,"columnArticles":127,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16916,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5097265294615168,"acs":3616,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7094,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7068965517241379,"acs":410,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":580,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7958044848610106,"acs":7701,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9677,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42940081875697805,"acs":28845,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67175,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5752659574468085,"acs":6489,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11280,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38939634630659253,"acs":1961,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5036,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5142531356898518,"acs":902,"articleLive":2,"columnArticles":28,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1754,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6628571428571428,"acs":116,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":175,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5061124694376528,"acs":621,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1227,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7999061143058327,"acs":6816,"articleLive":2,"columnArticles":111,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8521,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5366546852796121,"acs":6420,"articleLive":2,"columnArticles":61,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":11963,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335580972545048,"acs":27530,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43453,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3614084070110129,"acs":2330,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6447,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6826940074244299,"acs":7724,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11314,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3284641558136806,"acs":5599,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17046,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6089299461123941,"acs":2373,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3897,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40210143463325926,"acs":1990,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4949,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7121212121212122,"acs":188,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":264,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6477987421383647,"acs":1030,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1590,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7894129623345776,"acs":11632,"articleLive":2,"columnArticles":121,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14735,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6815991665581456,"acs":10468,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15358,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35665460394049053,"acs":4435,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12435,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45102125885785743,"acs":2164,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4798,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6346516007532956,"acs":337,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":531,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7673895943364423,"acs":6829,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8899,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.771774658719477,"acs":4014,"articleLive":2,"columnArticles":66,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5201,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6183989550289233,"acs":3314,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5359,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31232532140860814,"acs":2235,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7156,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9066705044254155,"acs":12600,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13897,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3873258187627585,"acs":4364,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11267,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5136952919387855,"acs":5270,"articleLive":2,"columnArticles":61,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10259,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5973570658036678,"acs":2215,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3708,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.743202416918429,"acs":492,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":662,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5454545454545454,"acs":156,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":286,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7883933569695839,"acs":12675,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16077,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4561222005842259,"acs":7495,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16432,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27605203462802647,"acs":5963,"articleLive":2,"columnArticles":127,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21601,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.620583717357911,"acs":2020,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3255,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8120300751879699,"acs":2052,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2527,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8912386706948641,"acs":295,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":331,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7476808905380334,"acs":403,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":539,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7279151943462897,"acs":5974,"articleLive":2,"columnArticles":93,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8207,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8204856885879054,"acs":31016,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37802,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4284565916398714,"acs":2132,"articleLive":2,"columnArticles":55,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4976,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4125250724314687,"acs":1851,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4487,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7717573221757322,"acs":7378,"articleLive":2,"columnArticles":98,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9560,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3532215357458076,"acs":6003,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16995,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27813357731015553,"acs":3648,"articleLive":2,"columnArticles":110,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13116,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37491877842755034,"acs":1731,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4617,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6894160583941605,"acs":1889,"articleLive":2,"columnArticles":37,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2740,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5249457700650759,"acs":242,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":461,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5715351812366738,"acs":5361,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9380,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6454879129224149,"acs":5100,"articleLive":2,"columnArticles":64,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7901,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3170339761248852,"acs":2762,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8712,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2702354909278085,"acs":2100,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7771,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7063253012048193,"acs":938,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1328,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.477797513321492,"acs":269,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":563,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3359154929577465,"acs":477,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1420,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5917354123798917,"acs":31346,"articleLive":2,"columnArticles":409,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":52973,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4583364250204051,"acs":37062,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":80862,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5308449974079834,"acs":2048,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3858,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5068903535050928,"acs":846,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1669,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5310215876253612,"acs":6248,"articleLive":2,"columnArticles":78,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11766,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3097000686865603,"acs":4058,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13103,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6284598403803702,"acs":3701,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5889,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4349040139616056,"acs":1246,"articleLive":2,"columnArticles":34,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2865,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6593806921675774,"acs":724,"articleLive":2,"columnArticles":26,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1098,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4482758620689655,"acs":78,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":174,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6435342203669885,"acs":7400,"articleLive":2,"columnArticles":101,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11499,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2787302108112542,"acs":3398,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12191,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5703011170471103,"acs":4697,"articleLive":2,"columnArticles":93,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8236,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42398360095661086,"acs":2482,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5854,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5880893300248139,"acs":474,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":806,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6639676113360324,"acs":164,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":247,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3253889674681754,"acs":4601,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14140,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6748329621380846,"acs":3636,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5388,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.571150442477876,"acs":3227,"articleLive":2,"columnArticles":69,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5650,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2715839564921822,"acs":1598,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":5884,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8375503459671589,"acs":8110,"articleLive":2,"columnArticles":83,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9683,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44097174832810154,"acs":3231,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7327,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.390771349862259,"acs":2837,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7260,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5517403574788335,"acs":1173,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2126,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2878306878306878,"acs":272,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":945,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4847328244274809,"acs":127,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":262,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.39059304703476483,"acs":382,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":978,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9158986175115207,"acs":10335,"articleLive":2,"columnArticles":90,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11284,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34440197982582543,"acs":5497,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15961,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3608852048795746,"acs":4615,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12788,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23725553061878807,"acs":1480,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6238,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.37579617834394907,"acs":59,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":157,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6978299643281808,"acs":4695,"articleLive":2,"columnArticles":58,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6728,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3440477336156289,"acs":3575,"articleLive":2,"columnArticles":60,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10391,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4122969837587007,"acs":1777,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4310,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3970797720797721,"acs":2230,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5616,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9146203248961088,"acs":12105,"articleLive":2,"columnArticles":106,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13235,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4794568245125348,"acs":5508,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11488,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5608480176211453,"acs":2037,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3632,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3272892112420671,"acs":1083,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3309,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5454545454545454,"acs":432,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":792,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7493188010899182,"acs":275,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":367,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7396502103165818,"acs":6682,"articleLive":2,"columnArticles":94,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9034,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4497669185018486,"acs":5596,"articleLive":2,"columnArticles":63,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12442,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24232371547600678,"acs":3141,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12962,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34412213740458014,"acs":1127,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3275,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6248153618906942,"acs":423,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":677,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7932489451476793,"acs":376,"articleLive":2,"columnArticles":24,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":474,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7719672131147541,"acs":4709,"articleLive":2,"columnArticles":83,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6100,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3919680924219502,"acs":2850,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7271,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4069489685124864,"acs":1874,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4605,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5771158950162194,"acs":1957,"articleLive":2,"columnArticles":52,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3391,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6643842616249361,"acs":6501,"articleLive":2,"columnArticles":74,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9785,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30404670596989297,"acs":5312,"articleLive":2,"columnArticles":81,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17471,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5413105413105413,"acs":3990,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7371,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5158687466379774,"acs":959,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1859,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5355450236966824,"acs":226,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":422,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5508474576271186,"acs":130,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":236,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6666666666666666,"acs":292,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":438,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.544999204961043,"acs":6855,"articleLive":2,"columnArticles":79,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12578,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3253400968411344,"acs":4233,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13011,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4810848562449075,"acs":4133,"articleLive":2,"columnArticles":68,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8591,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4955023923444976,"acs":2589,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5225,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.44193548387096776,"acs":137,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":310,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6043895747599451,"acs":4406,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7290,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4230703697393082,"acs":2483,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5869,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4121487368719841,"acs":1452,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3523,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2761430511543685,"acs":610,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2209,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.535633791870677,"acs":6892,"articleLive":2,"columnArticles":63,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12867,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.42975848411897183,"acs":5534,"articleLive":2,"columnArticles":74,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12877,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6146067415730337,"acs":4376,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7120,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3828817733990148,"acs":3109,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8120,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7323340471092077,"acs":342,"articleLive":2,"columnArticles":12,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":467,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7241379310344828,"acs":42,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":58,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7777489962440098,"acs":6005,"articleLive":2,"columnArticles":56,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7721,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3578882275643503,"acs":4630,"articleLive":2,"columnArticles":67,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12937,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27946548740626803,"acs":2907,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10402,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4789971409720695,"acs":2178,"articleLive":2,"columnArticles":49,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4547,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5620347394540943,"acs":453,"articleLive":2,"columnArticles":19,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":806,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4498714652956298,"acs":175,"articleLive":2,"columnArticles":7,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":389,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7430928626247122,"acs":3873,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5212,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3807876530069186,"acs":2862,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7516,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2878765395459267,"acs":1940,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6739,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2467005076142132,"acs":729,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2955,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5305676855895196,"acs":243,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":458,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.816874508482193,"acs":7271,"articleLive":2,"columnArticles":80,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":8901,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5810157194679565,"acs":5766,"articleLive":2,"columnArticles":92,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9924,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.298692636072572,"acs":4478,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":14992,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4544943820224719,"acs":809,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1780,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6527777777777778,"acs":47,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":72,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5803489439853077,"acs":5688,"articleLive":2,"columnArticles":63,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9801,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4121086522093109,"acs":5568,"articleLive":2,"columnArticles":79,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13511,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2755300147549895,"acs":3548,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12877,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4598228927517219,"acs":1402,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3049,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6798418972332015,"acs":172,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":253,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.4367816091954023,"acs":38,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":87,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5948905109489051,"acs":163,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":274,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6623484471018103,"acs":3988,"articleLive":2,"columnArticles":55,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6021,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5930780258038091,"acs":2896,"articleLive":2,"columnArticles":56,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4883,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38253142609449503,"acs":1765,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4614,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3632465543644717,"acs":1186,"articleLive":2,"columnArticles":35,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3265,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5507420778178901,"acs":5492,"articleLive":2,"columnArticles":45,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":9972,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24641385425903709,"acs":4724,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19171,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34062859963797926,"acs":2070,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6077,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.41817229641267345,"acs":1597,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3819,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6547619047619048,"acs":55,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":84,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7808186292161805,"acs":6505,"articleLive":2,"columnArticles":82,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8331,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3577085196065909,"acs":5601,"articleLive":2,"columnArticles":123,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15658,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5706979046361986,"acs":3459,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6061,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3914243260454256,"acs":1844,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4711,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.40217391304347827,"acs":74,"articleLive":2,"columnArticles":3,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":184,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.675,"acs":27,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":40,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8847526772055074,"acs":3470,"articleLive":2,"columnArticles":46,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":3922,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.2940178672396246,"acs":2600,"articleLive":2,"columnArticles":48,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":8843,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.41818181818181815,"acs":1978,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4730,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41661195009848984,"acs":1269,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3046,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6351351351351351,"acs":47,"articleLive":2,"columnArticles":2,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":74,"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.9054954821507925,"acs":6113,"articleLive":2,"columnArticles":51,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":6751,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.35445370776656426,"acs":4039,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11395,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32624544349939244,"acs":2685,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8230,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5196820590461771,"acs":1373,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2642,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8611111111111112,"acs":31,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":36,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5532225465977992,"acs":4927,"articleLive":2,"columnArticles":64,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":8906,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34612105711849955,"acs":3248,"articleLive":2,"columnArticles":87,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9384,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41005714285714284,"acs":1794,"articleLive":2,"columnArticles":46,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4375,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.3440822111977321,"acs":971,"articleLive":2,"columnArticles":30,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2822,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8395061728395061,"acs":68,"articleLive":2,"columnArticles":3,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":81,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.8108108108108109,"acs":30,"articleLive":2,"columnArticles":4,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":37,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6599335915882678,"acs":2385,"articleLive":2,"columnArticles":29,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":3614,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7539023580205911,"acs":2270,"articleLive":2,"columnArticles":30,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3011,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.46630518977536795,"acs":1806,"articleLive":2,"columnArticles":48,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":3873,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.24183673469387756,"acs":948,"articleLive":2,"columnArticles":35,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":3920,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9775280898876404,"acs":87,"articleLive":2,"columnArticles":5,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":89,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5359314107560406,"acs":3438,"articleLive":2,"columnArticles":34,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":6415,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.41054018445322793,"acs":3116,"articleLive":2,"columnArticles":42,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":7590,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.20450024863252114,"acs":1645,"articleLive":2,"columnArticles":62,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8044,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3276255707762557,"acs":861,"articleLive":2,"columnArticles":33,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":2628,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.8451524816042357,"acs":81089,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":95946,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6905293044007301,"acs":13620,"articleLive":2,"columnArticles":236,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19724,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21921051074155176,"acs":11112,"articleLive":2,"columnArticles":183,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50691,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3773364485981308,"acs":2584,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6848,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.20001951409893648,"acs":2050,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10249,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8399190439475713,"acs":43575,"articleLive":2,"columnArticles":658,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":51880,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7696212031441324,"acs":38969,"articleLive":2,"columnArticles":470,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50634,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28779152648685635,"acs":5047,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17537,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27501887425551547,"acs":6557,"articleLive":2,"columnArticles":106,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23842,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5881773399014778,"acs":1791,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3045,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6893018583626318,"acs":6862,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9955,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4104035065102488,"acs":6367,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15514,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6127148880960104,"acs":9445,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15415,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21060782036391792,"acs":2720,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12915,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5756756756756757,"acs":852,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1480,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.31150895140664964,"acs":609,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1955,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7989970181621036,"acs":23580,"articleLive":2,"columnArticles":249,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29512,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2864305911751167,"acs":17423,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":60828,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162154355190253,"acs":19658,"articleLive":2,"columnArticles":204,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38081,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3116860260471665,"acs":1771,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5682,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33485477178423234,"acs":807,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2410,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3334576094250988,"acs":8944,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26822,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3418982695332984,"acs":2608,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7628,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2816553428042001,"acs":912,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3238,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3323790438018895,"acs":1161,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3493,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3337378640776699,"acs":550,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1648,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32823622462430796,"acs":1245,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3793,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2814424657916005,"acs":10099,"articleLive":2,"columnArticles":173,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":35883,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18662232076866223,"acs":5050,"articleLive":2,"columnArticles":122,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27060,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34917161613004066,"acs":5585,"articleLive":2,"columnArticles":97,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":15995,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25235432607416125,"acs":1715,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6796,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40566770186335405,"acs":1045,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2576,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21671333397702036,"acs":4489,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20714,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.48180677540777916,"acs":2304,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4782,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3974403320650294,"acs":1149,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2891,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26125511596180084,"acs":766,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2932,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19358909641595154,"acs":767,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3962,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5653753026634383,"acs":467,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":826,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5024370430544273,"acs":3711,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7386,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.2299474167431767,"acs":2755,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":11981,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4147615937295885,"acs":1270,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3062,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19862475442043223,"acs":1011,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5090,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3958762886597938,"acs":384,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":970,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8556105610561056,"acs":2074,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2424,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.1840175953079179,"acs":1004,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5456,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3647162340519138,"acs":829,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2273,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3515625,"acs":765,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2176,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15019762845849802,"acs":266,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1771,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22240663900414936,"acs":268,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1205,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5441352682731994,"acs":4087,"articleLive":2,"columnArticles":94,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7511,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6961578400830737,"acs":3352,"articleLive":2,"columnArticles":67,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4815,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4132251720747296,"acs":1681,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4068,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678162264458101,"acs":399915,"articleLive":2,"columnArticles":2785,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":589704,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40320841718394956,"acs":260669,"articleLive":2,"columnArticles":2081,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":646487,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7607649378594645,"acs":285315,"articleLive":2,"columnArticles":1935,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":375037,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.751639088743968,"acs":301396,"articleLive":2,"columnArticles":2080,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":400985,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6977535059928661,"acs":188967,"articleLive":2,"columnArticles":1448,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":270822,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7157622315768783,"acs":262188,"articleLive":2,"columnArticles":1661,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":366306,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600372210817137,"acs":262717,"articleLive":2,"columnArticles":1855,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":729694,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4435887396021618,"acs":194857,"articleLive":2,"columnArticles":1309,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":439274,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49304132175252247,"acs":261234,"articleLive":2,"columnArticles":1630,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":529842,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.452122655299064,"acs":170122,"articleLive":2,"columnArticles":1133,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":376274,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5264047808622371,"acs":176523,"articleLive":2,"columnArticles":1706,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":335337,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5692418297820071,"acs":157565,"articleLive":2,"columnArticles":1308,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":276798,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3119921636035414,"acs":83130,"articleLive":2,"columnArticles":490,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":266449,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7470984263351369,"acs":198968,"articleLive":2,"columnArticles":1251,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":266321,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33971385067010523,"acs":123824,"articleLive":2,"columnArticles":759,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":364495,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7771819306482253,"acs":150143,"articleLive":2,"columnArticles":1126,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":193189,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5964588373890022,"acs":188345,"articleLive":2,"columnArticles":1454,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":315772,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3765211977132507,"acs":66520,"articleLive":2,"columnArticles":444,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":176670,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2416661409374803,"acs":76613,"articleLive":2,"columnArticles":852,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":317020,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6430396253027117,"acs":193308,"articleLive":2,"columnArticles":1630,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":300616,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7979662200230262,"acs":260603,"articleLive":2,"columnArticles":2445,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":326584,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7427565423134191,"acs":291321,"articleLive":2,"columnArticles":1825,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":392216,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7286220559449391,"acs":184627,"articleLive":2,"columnArticles":1185,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":253392,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46543806918166286,"acs":144943,"articleLive":2,"columnArticles":1184,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":311412,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7917823661546878,"acs":191046,"articleLive":2,"columnArticles":1401,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":241286,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801843407393034,"acs":149499,"articleLive":2,"columnArticles":1083,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":257675,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4402230467481956,"acs":145105,"articleLive":2,"columnArticles":1480,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":329617,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5690816827365766,"acs":140294,"articleLive":2,"columnArticles":935,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":246527,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6154140433718083,"acs":112606,"articleLive":2,"columnArticles":945,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":182976,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.644561295951331,"acs":136676,"articleLive":2,"columnArticles":952,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":212045,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6864725777838085,"acs":136595,"articleLive":2,"columnArticles":1094,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":198981,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5888722798604842,"acs":119365,"articleLive":2,"columnArticles":1133,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":202701,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5512403237156932,"acs":112797,"articleLive":2,"columnArticles":951,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":204624,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5765653711472455,"acs":133039,"articleLive":2,"columnArticles":868,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":230744,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7200215363395482,"acs":119021,"articleLive":2,"columnArticles":824,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":165302,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6545205272690682,"acs":104074,"articleLive":2,"columnArticles":897,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":159008,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5612989071554777,"acs":77196,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":137531,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792498632008432,"acs":157728,"articleLive":2,"columnArticles":1114,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":272297,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6909993087785129,"acs":167946,"articleLive":2,"columnArticles":1024,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":243048,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5700646651270208,"acs":246838,"articleLive":2,"columnArticles":1813,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":433000,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5811528479463568,"acs":62922,"articleLive":2,"columnArticles":459,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":108271,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054467572634835,"acs":221203,"articleLive":2,"columnArticles":1521,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":365355,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48562928699915003,"acs":49135,"articleLive":2,"columnArticles":509,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":101178,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4149105799390641,"acs":55425,"articleLive":2,"columnArticles":460,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":133583,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5612686482177428,"acs":108427,"articleLive":2,"columnArticles":806,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":193182,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5360709822993734,"acs":119264,"articleLive":2,"columnArticles":1438,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":222478,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889332410085129,"acs":118398,"articleLive":2,"columnArticles":991,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":171857,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4645815388700052,"acs":150484,"articleLive":2,"columnArticles":1035,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":323913,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6512912253093522,"acs":87740,"articleLive":2,"columnArticles":518,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":134717,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6145924097202052,"acs":152355,"articleLive":2,"columnArticles":1053,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":247896,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48293496703913,"acs":101610,"articleLive":2,"columnArticles":843,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":210401,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6495468052938504,"acs":174428,"articleLive":2,"columnArticles":1046,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":268538,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5380027557620479,"acs":188981,"articleLive":2,"columnArticles":1584,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":351264,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4471832776259838,"acs":167103,"articleLive":2,"columnArticles":1465,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":373679,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7564737287462074,"acs":161812,"articleLive":2,"columnArticles":1143,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":213903,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7898698510666845,"acs":176607,"articleLive":2,"columnArticles":1268,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":223590,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5879541438607077,"acs":136423,"articleLive":2,"columnArticles":939,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":232030,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6992148926572958,"acs":114709,"articleLive":2,"columnArticles":1027,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":164054,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8002209865982322,"acs":89804,"articleLive":2,"columnArticles":692,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":112224,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6659201101378719,"acs":133501,"articleLive":2,"columnArticles":836,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":200476,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7071990875113298,"acs":138884,"articleLive":2,"columnArticles":1858,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":196386,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4419094310941603,"acs":129076,"articleLive":2,"columnArticles":975,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":292087,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8576757001965759,"acs":204192,"articleLive":2,"columnArticles":1783,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":238076,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4443046346385389,"acs":131001,"articleLive":2,"columnArticles":1186,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":294845,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47514475356588054,"acs":94206,"articleLive":2,"columnArticles":1065,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":198268,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5613640282807381,"acs":65107,"articleLive":2,"columnArticles":590,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":115980,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4595400970338812,"acs":102579,"articleLive":2,"columnArticles":978,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":223221,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.655526685183526,"acs":109745,"articleLive":2,"columnArticles":764,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":167415,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6337242472266245,"acs":129961,"articleLive":2,"columnArticles":946,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":205075,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8569029349882313,"acs":137251,"articleLive":2,"columnArticles":1294,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":160171,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.583948135078577,"acs":71157,"articleLive":2,"columnArticles":493,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":121855,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5976277748033442,"acs":72555,"articleLive":2,"columnArticles":523,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":121405,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2865692327075721,"acs":68235,"articleLive":2,"columnArticles":555,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":238110,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6938184825304942,"acs":117460,"articleLive":2,"columnArticles":687,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":169295,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7004716698071315,"acs":116728,"articleLive":2,"columnArticles":686,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":166642,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20295994007800192,"acs":7858,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":38717,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5749424740141236,"acs":7246,"articleLive":2,"columnArticles":120,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":12603,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7819098097141368,"acs":8999,"articleLive":2,"columnArticles":136,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":11509,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.685164528722811,"acs":7371,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":10758,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7117272486070576,"acs":5365,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":7538,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6623735050597976,"acs":6480,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":9783,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.45419722901385495,"acs":5573,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":12270,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5069640418752844,"acs":5569,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":10985,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.546671490593343,"acs":4533,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":8292,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4368856024358417,"acs":5022,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":11495,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5665047783174056,"acs":3616,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6383,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6626740530019464,"acs":4426,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":6679,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6570443774235244,"acs":3050,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":4642,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5066201076676852,"acs":3482,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":6873,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6392548841435711,"acs":2814,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4402,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4959807073954984,"acs":4319,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":8708,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.520755545793982,"acs":2371,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4553,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5308179351337382,"acs":4108,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":7739,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4699171533342388,"acs":3460,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":7363,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7012380759082606,"acs":3455,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":4927,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5343182517697753,"acs":5208,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":9747,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5208723803032884,"acs":6114,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":11738,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.704408654628274,"acs":4330,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6147,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7701585580701992,"acs":11366,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":14758,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6007604562737643,"acs":3634,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6049,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6492549270950169,"acs":4052,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6241,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6047206453540483,"acs":6072,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":10041,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6219709208400647,"acs":1925,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3095,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29395296752519595,"acs":2100,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":7144,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5444411850982693,"acs":1856,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3409,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5627569528415961,"acs":2327,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4135,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6034271725826194,"acs":2958,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":4902,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7988227146814404,"acs":2307,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":2888,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.581767955801105,"acs":2106,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":3620,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6872427983539094,"acs":2171,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3159,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5855766856013831,"acs":2371,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4049,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.43877379147717704,"acs":2605,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":5937,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7770052148000993,"acs":3129,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4027,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5188775510204081,"acs":2034,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":3920,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5773152081563296,"acs":1359,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2354,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7872460496613995,"acs":2790,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3544,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8488034807831762,"acs":2341,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2758,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6521348314606742,"acs":1451,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2225,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6459671663097787,"acs":2715,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4203,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8111710568073628,"acs":2556,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3151,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7245438493231312,"acs":2462,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3398,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6831275720164609,"acs":2324,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3402,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6694063926940639,"acs":1466,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2190,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7481191694252182,"acs":2486,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3323,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6141675656238763,"acs":1708,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":2781,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41585263745464696,"acs":1490,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3583,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7358333333333333,"acs":2649,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3600,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6305748904356793,"acs":2446,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":3879,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8428453267162944,"acs":2038,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2418,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8918623702894594,"acs":1633,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1831,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7296286401282394,"acs":2731,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":3743,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3538563389606091,"acs":1069,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3021,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5890949971894323,"acs":1048,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1779,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6237482117310443,"acs":1744,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":2796,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6787900612171408,"acs":1885,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":2777,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5340957221516307,"acs":1261,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2361,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7595712098009189,"acs":1488,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":1959,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7244143033292232,"acs":1175,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1622,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6310550763105508,"acs":951,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1507,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6298932384341637,"acs":885,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1405,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6515151515151515,"acs":946,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1452,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6472868217054264,"acs":835,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1290,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5090355329949239,"acs":2507,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":4925,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7249124854142357,"acs":2485,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3428,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6710565698892547,"acs":2242,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3341,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.49836065573770494,"acs":912,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1830,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4204685573366215,"acs":3069,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":7299,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.540940106141016,"acs":1427,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2638,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.545502367175171,"acs":2074,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":3802,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7129443326626426,"acs":2126,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":2982,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6713406292749658,"acs":3926,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":5848,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5859008707300737,"acs":3499,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":5972,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6296983758700696,"acs":2714,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4310,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8547037161031135,"acs":2553,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":2987,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8023799405014874,"acs":1888,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2353,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7836048879837068,"acs":3078,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":3928,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6357560568086884,"acs":2283,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3591,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8579718998167379,"acs":2809,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3274,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6770770163735598,"acs":2233,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3298,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8565230864580106,"acs":2764,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3227,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7619250425894378,"acs":1789,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2348,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6397774687065368,"acs":1840,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":2876,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7380004191993292,"acs":3521,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":4771,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6273696682464455,"acs":2118,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3376,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5219172470299058,"acs":1274,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2441,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.761414503133393,"acs":1701,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2234,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6764408493427705,"acs":1338,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":1978,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5698765432098766,"acs":1154,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2025,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.583645443196005,"acs":935,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1602,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6622745298707944,"acs":5177,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":7817,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4927099044746104,"acs":980,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":1989,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5407554671968191,"acs":816,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1509,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7734481196193929,"acs":1707,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2207,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.69049008168028,"acs":2367,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3428,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.742215416028586,"acs":1454,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":1959,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4793814432989691,"acs":1860,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":3880,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5920275590551181,"acs":1203,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2032,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4953449005501481,"acs":2341,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":4726,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.581986143187067,"acs":1008,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1732,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.693935790725327,"acs":2918,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4205,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5484710474951203,"acs":843,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1537,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5430006277463905,"acs":865,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1593,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5686719636776391,"acs":501,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":881,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6116751269035533,"acs":964,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1576,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8344491783323189,"acs":1371,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1643,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6875891583452212,"acs":482,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":701,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.557815223707147,"acs":960,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1721,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5877243775332948,"acs":1015,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1727,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4232209737827715,"acs":452,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1068,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.28425878757004586,"acs":558,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":1963,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6356701779876498,"acs":3500,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5506,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6307870370370371,"acs":545,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":864,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6988416988416989,"acs":724,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1036,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.45710291804997377,"acs":2616,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":5723,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.719948403008202,"acs":88743,"articleLive":2,"columnArticles":1528,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":123263,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6481679198564322,"acs":57066,"articleLive":2,"columnArticles":1101,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":88042,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5791410230957581,"acs":43757,"articleLive":2,"columnArticles":484,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":75555,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5508843462449722,"acs":39992,"articleLive":2,"columnArticles":769,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":72596,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3324210002488181,"acs":32064,"articleLive":2,"columnArticles":551,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":96456,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47185888914107843,"acs":72763,"articleLive":2,"columnArticles":1167,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":154205,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7538818345219458,"acs":65011,"articleLive":2,"columnArticles":957,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":86235,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6211383986410618,"acs":43148,"articleLive":2,"columnArticles":483,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":69466,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5503339815675996,"acs":32544,"articleLive":2,"columnArticles":413,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":59135,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6827523413111343,"acs":62988,"articleLive":2,"columnArticles":685,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":92256,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800541679205537,"acs":64803,"articleLive":2,"columnArticles":943,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83075,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8545458905916493,"acs":71264,"articleLive":2,"columnArticles":680,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83394,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6549841999425452,"acs":25080,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38291,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46670830253129064,"acs":36617,"articleLive":2,"columnArticles":520,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78458,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4834918858421936,"acs":38880,"articleLive":2,"columnArticles":502,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":80415,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6849213932076783,"acs":47313,"articleLive":2,"columnArticles":422,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":69078,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5320976491862568,"acs":27071,"articleLive":2,"columnArticles":280,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":50876,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5379449958030909,"acs":10895,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20253,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6135880597014925,"acs":25694,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":41875,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3863615045492918,"acs":8238,"articleLive":2,"columnArticles":123,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21322,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7125015343071069,"acs":23219,"articleLive":2,"columnArticles":338,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32588,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5433655120196857,"acs":14353,"articleLive":2,"columnArticles":192,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26415,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5876509330406147,"acs":10707,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18220,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5315943264138309,"acs":17465,"articleLive":2,"columnArticles":242,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":32854,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7900849208170759,"acs":34424,"articleLive":2,"columnArticles":419,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43570,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8057862399567889,"acs":23869,"articleLive":2,"columnArticles":520,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29622,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5843295379860384,"acs":32896,"articleLive":2,"columnArticles":382,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56297,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.351678132165937,"acs":25305,"articleLive":2,"columnArticles":320,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":71955,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5904471243592403,"acs":19927,"articleLive":2,"columnArticles":240,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33749,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7169901230289378,"acs":16551,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23084,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47659850230414746,"acs":6619,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13888,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7170549528721323,"acs":16128,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22492,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4864142538975501,"acs":17472,"articleLive":2,"columnArticles":257,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":35920,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.505372860305632,"acs":9359,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18519,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6897576794883343,"acs":7657,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11101,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38681010289990647,"acs":10751,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":27794,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38681885125184096,"acs":5253,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13580,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5276877425245378,"acs":11559,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":21905,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7033677146762769,"acs":11320,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16094,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5534363177805801,"acs":3511,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6344,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36314423306806926,"acs":42530,"articleLive":2,"columnArticles":471,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117116,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36140215487815736,"acs":12176,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33691,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6758706143211165,"acs":51819,"articleLive":2,"columnArticles":433,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76670,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8201834137085936,"acs":20749,"articleLive":2,"columnArticles":324,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25298,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6799898650788624,"acs":21470,"articleLive":2,"columnArticles":477,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31574,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6563804783630582,"acs":23738,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36165,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8130198640282578,"acs":21406,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26329,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.718536670750919,"acs":16420,"articleLive":2,"columnArticles":235,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22852,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8132629371676777,"acs":21719,"articleLive":2,"columnArticles":344,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26706,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5587413736444299,"acs":13602,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24344,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49480364472649996,"acs":33994,"articleLive":2,"columnArticles":324,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68702,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7607521961932651,"acs":16627,"articleLive":2,"columnArticles":296,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21856,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5016226582091754,"acs":6801,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13558,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5341318907779495,"acs":4147,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7764,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5548033368378646,"acs":56464,"articleLive":2,"columnArticles":2372,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":101773,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396627988973652,"acs":34614,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46797,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39555784186159104,"acs":13072,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33047,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5531120808451998,"acs":19266,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":34832,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.455340456292535,"acs":12913,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28359,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6275805119735756,"acs":4560,"articleLive":2,"columnArticles":83,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7266,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6667537670934588,"acs":7655,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11481,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8319515725753389,"acs":25288,"articleLive":2,"columnArticles":400,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30396,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7657080337605502,"acs":14697,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19194,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4426669132605881,"acs":9574,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21628,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4601809664377848,"acs":7171,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15583,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46408839779005523,"acs":10752,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23168,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42352510320948195,"acs":12721,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30036,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329078280458043,"acs":19521,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26635,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37448559670781895,"acs":2275,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6075,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5506393861892583,"acs":2153,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3910,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6824194084413426,"acs":10267,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15045,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4410393714611772,"acs":50241,"articleLive":2,"columnArticles":581,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":113915,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4310534418297779,"acs":1960,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4547,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5487203206907185,"acs":3559,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6486,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5036434502626673,"acs":8916,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17703,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45330004870920604,"acs":14890,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32848,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6004495791729835,"acs":34458,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57387,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3439243434480882,"acs":15165,"articleLive":2,"columnArticles":313,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44094,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6114785641272322,"acs":20339,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33262,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7216841759684832,"acs":8793,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12184,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46512424183134415,"acs":9509,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20444,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5832083958020989,"acs":2723,"articleLive":2,"columnArticles":58,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4669,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4718254316010867,"acs":10768,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22822,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.545446744241925,"acs":31781,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58266,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3876185907685748,"acs":14545,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37524,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5968530101641908,"acs":12214,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20464,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6448086163273833,"acs":27779,"articleLive":2,"columnArticles":453,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":43081,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3874866690366157,"acs":5450,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14065,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45023192887514496,"acs":4659,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10348,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41183706297014716,"acs":8705,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21137,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27160453384000527,"acs":8291,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30526,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5492935635792778,"acs":13996,"articleLive":2,"columnArticles":146,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25480,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5708448729784251,"acs":66782,"articleLive":2,"columnArticles":927,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":116988,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.686653956148713,"acs":14406,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20980,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6313564476885645,"acs":20759,"articleLive":2,"columnArticles":289,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":32880,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5526818846283594,"acs":24575,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44465,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5971644656556785,"acs":76827,"articleLive":2,"columnArticles":759,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":128653,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40252309389218255,"acs":5839,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14506,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5183656097041924,"acs":60895,"articleLive":2,"columnArticles":1137,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117475,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4451866404715128,"acs":7931,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17815,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4450304007941432,"acs":7173,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16118,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5791952630870677,"acs":8608,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14862,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5701317715959004,"acs":3894,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6830,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6360155454532418,"acs":44350,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69731,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3744303905285124,"acs":8792,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23481,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37845535265538616,"acs":4518,"articleLive":2,"columnArticles":100,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11938,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5229268292682927,"acs":10720,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20500,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5053105889925974,"acs":1570,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3107,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3422231067767937,"acs":3439,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10049,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] -[{"acceptance":0.6517509727626459,"acs":9380,"articleLive":2,"columnArticles":165,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":14392,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.5206876903300356,"acs":2552246,"articleLive":2,"columnArticles":14361,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4901683,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4090815122393443,"acs":1017110,"articleLive":2,"columnArticles":7224,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2486326,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38092994320028956,"acs":1261971,"articleLive":2,"columnArticles":7528,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3312869,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4087012329580807,"acs":521551,"articleLive":2,"columnArticles":3877,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1276118,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35524152143444926,"acs":748993,"articleLive":2,"columnArticles":4052,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2108405,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5071002178972667,"acs":307429,"articleLive":2,"columnArticles":2490,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":606249,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35256515475582434,"acs":846284,"articleLive":2,"columnArticles":5322,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2400362,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21722448924148602,"acs":351817,"articleLive":2,"columnArticles":2705,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1619601,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5838827745590308,"acs":779922,"articleLive":2,"columnArticles":4966,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1335751,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3162142568243042,"acs":207182,"articleLive":2,"columnArticles":1247,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":655195,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.627556987597021,"acs":543010,"articleLive":2,"columnArticles":3083,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":865276,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6647093585784555,"acs":229459,"articleLive":2,"columnArticles":1790,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":345202,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.63194665227532,"acs":473074,"articleLive":2,"columnArticles":3923,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":748598,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4097936472517436,"acs":631751,"articleLive":2,"columnArticles":3943,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1541632,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3363737447969749,"acs":667346,"articleLive":2,"columnArticles":3143,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1983942,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45906111825394336,"acs":263502,"articleLive":2,"columnArticles":1446,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":574002,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5729723162544228,"acs":344275,"articleLive":2,"columnArticles":3108,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":600858,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39868670919836985,"acs":224223,"articleLive":2,"columnArticles":1541,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":562404,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42954849326339606,"acs":526239,"articleLive":2,"columnArticles":3937,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1225098,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44501507489197356,"acs":793210,"articleLive":2,"columnArticles":5625,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1782434,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6673607625538185,"acs":724637,"articleLive":2,"columnArticles":3518,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1085825,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.772656809744024,"acs":355878,"articleLive":2,"columnArticles":2675,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":460590,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5598764908470896,"acs":330008,"articleLive":2,"columnArticles":2128,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":589430,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7029724680518888,"acs":320592,"articleLive":2,"columnArticles":2542,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":456052,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6576183542360804,"acs":233492,"articleLive":2,"columnArticles":2220,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":355057,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5389656544606789,"acs":823477,"articleLive":2,"columnArticles":4586,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1527884,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5971093563638811,"acs":488116,"articleLive":2,"columnArticles":4128,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":817465,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40580433189187526,"acs":475024,"articleLive":2,"columnArticles":3268,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1170574,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20773216569726732,"acs":111252,"articleLive":2,"columnArticles":901,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":535555,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3587911965640786,"acs":80615,"articleLive":2,"columnArticles":599,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":224685,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.373132692126517,"acs":217833,"articleLive":2,"columnArticles":1757,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":583795,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35676220521193047,"acs":193607,"articleLive":2,"columnArticles":1309,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":542678,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4276823482913148,"acs":371156,"articleLive":2,"columnArticles":2450,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":867831,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4235951691785607,"acs":348008,"articleLive":2,"columnArticles":3346,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":821558,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4631519112242417,"acs":518204,"articleLive":2,"columnArticles":3994,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1118864,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6403630373294378,"acs":206024,"articleLive":2,"columnArticles":1463,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":321730,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706400230922641,"acs":102227,"articleLive":2,"columnArticles":862,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":152432,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5804428014754714,"acs":217626,"articleLive":2,"columnArticles":2285,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":374931,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277723858102417,"acs":340433,"articleLive":2,"columnArticles":1987,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":467774,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6226641816665849,"acs":203128,"articleLive":2,"columnArticles":1412,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":326224,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41974852906832205,"acs":167151,"articleLive":2,"columnArticles":1426,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":398217,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5816241636290567,"acs":329974,"articleLive":2,"columnArticles":2460,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":567332,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4490049783679611,"acs":172175,"articleLive":2,"columnArticles":1158,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":383459,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3282480978522585,"acs":85205,"articleLive":2,"columnArticles":555,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":259575,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4298320250028745,"acs":205608,"articleLive":2,"columnArticles":1646,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":478345,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7830171926118087,"acs":427702,"articleLive":2,"columnArticles":2737,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":546223,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6379556930620822,"acs":218570,"articleLive":2,"columnArticles":1504,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":342610,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7351941050543024,"acs":225287,"articleLive":2,"columnArticles":1900,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":306432,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6652824200681995,"acs":236460,"articleLive":2,"columnArticles":1335,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":355428,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37623891676403876,"acs":218956,"articleLive":2,"columnArticles":1295,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":581960,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.738713927615025,"acs":155305,"articleLive":2,"columnArticles":1553,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":210237,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8229904850210831,"acs":74558,"articleLive":2,"columnArticles":612,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90594,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5527030677613717,"acs":693581,"articleLive":2,"columnArticles":3827,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1254889,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48133211981636337,"acs":191446,"articleLive":2,"columnArticles":2026,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":397742,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4325234815114614,"acs":330220,"articleLive":2,"columnArticles":2529,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":763473,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4695009355635408,"acs":305870,"articleLive":2,"columnArticles":2345,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":651479,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4113507313688563,"acs":87150,"articleLive":2,"columnArticles":934,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":211863,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3763242925094893,"acs":250638,"articleLive":2,"columnArticles":2692,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":666016,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.790018901735523,"acs":128732,"articleLive":2,"columnArticles":1592,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":162948,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5242233225674122,"acs":90731,"articleLive":2,"columnArticles":962,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173077,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4175996440870392,"acs":198995,"articleLive":2,"columnArticles":2020,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":476521,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6622179734702931,"acs":317958,"articleLive":2,"columnArticles":2448,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":480141,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39183022811341395,"acs":184103,"articleLive":2,"columnArticles":1735,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":469854,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883704805862586,"acs":272033,"articleLive":2,"columnArticles":2104,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":395184,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2694458980173266,"acs":46342,"articleLive":2,"columnArticles":644,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":171990,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4573779878579193,"acs":353861,"articleLive":2,"columnArticles":3202,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":773673,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5429256342763609,"acs":196361,"articleLive":2,"columnArticles":1797,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":361672,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5243826520024901,"acs":37905,"articleLive":2,"columnArticles":575,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72285,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39213426507270155,"acs":391290,"articleLive":2,"columnArticles":1968,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":997847,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5301023298859013,"acs":581958,"articleLive":2,"columnArticles":3633,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1097822,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4215187002139328,"acs":94773,"articleLive":2,"columnArticles":834,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":224837,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6141766975653916,"acs":178430,"articleLive":2,"columnArticles":1247,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":290519,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6044889934631114,"acs":134364,"articleLive":2,"columnArticles":989,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":222277,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46127457448212167,"acs":171304,"articleLive":2,"columnArticles":1718,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":371371,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5963391452901713,"acs":272623,"articleLive":2,"columnArticles":1888,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":457161,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4269217028809899,"acs":187618,"articleLive":2,"columnArticles":1282,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":439467,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.769788234646065,"acs":223595,"articleLive":2,"columnArticles":1317,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":290463,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015187626774848,"acs":316119,"articleLive":2,"columnArticles":2070,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":394400,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45860424706524155,"acs":226977,"articleLive":2,"columnArticles":1430,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":494930,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6167634237547259,"acs":149266,"articleLive":2,"columnArticles":1336,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":242015,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4148614300721432,"acs":125189,"articleLive":2,"columnArticles":1002,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":301761,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5307480296761966,"acs":183711,"articleLive":2,"columnArticles":1704,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":346136,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385679794474484,"acs":320323,"articleLive":2,"columnArticles":1962,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":594768,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4334535788874122,"acs":184923,"articleLive":2,"columnArticles":1168,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":426627,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5159533277521976,"acs":98609,"articleLive":2,"columnArticles":695,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":191120,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.632508296677659,"acs":120644,"articleLive":2,"columnArticles":1108,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":190739,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48711028385295485,"acs":41872,"articleLive":2,"columnArticles":312,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":85960,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5171640700776945,"acs":470806,"articleLive":2,"columnArticles":3293,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":910361,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7099295108845247,"acs":59321,"articleLive":2,"columnArticles":483,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":83559,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337899667737894,"acs":139629,"articleLive":2,"columnArticles":1229,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":220308,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3092904589032628,"acs":165111,"articleLive":2,"columnArticles":1531,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":533838,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5487916026625704,"acs":214358,"articleLive":2,"columnArticles":2046,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":390600,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5407281622654246,"acs":155395,"articleLive":2,"columnArticles":1347,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":287381,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556915635459146,"acs":570563,"articleLive":2,"columnArticles":2339,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":755021,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7021378396932273,"acs":101256,"articleLive":2,"columnArticles":632,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":144211,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6995313534715502,"acs":164790,"articleLive":2,"columnArticles":1303,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":235572,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4559068463801718,"acs":62136,"articleLive":2,"columnArticles":548,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":136291,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35019430103335536,"acs":352175,"articleLive":2,"columnArticles":1960,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1005656,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6114283290204895,"acs":72066,"articleLive":2,"columnArticles":594,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":117865,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6021510251613149,"acs":252335,"articleLive":2,"columnArticles":1902,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":419056,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5638031082888153,"acs":416138,"articleLive":2,"columnArticles":2283,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":738091,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420490277764477,"acs":402245,"articleLive":2,"columnArticles":2529,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":626502,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5716770485194481,"acs":175841,"articleLive":2,"columnArticles":1602,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":307588,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661338165737528,"acs":520437,"articleLive":2,"columnArticles":2582,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":679303,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7045844164575117,"acs":251531,"articleLive":2,"columnArticles":1446,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":356992,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7214091501445296,"acs":134519,"articleLive":2,"columnArticles":894,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":186467,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6973554714675988,"acs":164389,"articleLive":2,"columnArticles":1317,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":235732,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7602489105256959,"acs":193643,"articleLive":2,"columnArticles":1200,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":254710,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7631303535776389,"acs":94793,"articleLive":2,"columnArticles":732,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124216,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5634869207854052,"acs":259142,"articleLive":2,"columnArticles":1480,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":459890,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4863411242141712,"acs":274168,"articleLive":2,"columnArticles":1809,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":563736,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5262002743484225,"acs":272356,"articleLive":2,"columnArticles":1709,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":517590,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.627611834434176,"acs":181393,"articleLive":2,"columnArticles":1280,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":289021,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7259461666255714,"acs":179594,"articleLive":2,"columnArticles":1346,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":247393,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5223241281999597,"acs":62190,"articleLive":2,"columnArticles":685,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":119064,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.70443583042464,"acs":160648,"articleLive":2,"columnArticles":1234,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":228052,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6145748878439004,"acs":90962,"articleLive":2,"columnArticles":771,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":148008,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7307895794267345,"acs":218243,"articleLive":2,"columnArticles":1755,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":298640,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.667303866645325,"acs":145916,"articleLive":2,"columnArticles":1215,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":218665,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6814556763754533,"acs":180551,"articleLive":2,"columnArticles":1588,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":264949,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5734838080893102,"acs":569591,"articleLive":2,"columnArticles":3422,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":993212,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6895041601660229,"acs":467137,"articleLive":2,"columnArticles":2671,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":677497,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5366278881625784,"acs":132663,"articleLive":2,"columnArticles":824,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":247216,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44484709964339314,"acs":161544,"articleLive":2,"columnArticles":1103,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":363145,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47306955384568594,"acs":279990,"articleLive":2,"columnArticles":1847,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":591858,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39542632779752745,"acs":37263,"articleLive":2,"columnArticles":330,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94235,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46832093012734965,"acs":124224,"articleLive":2,"columnArticles":655,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":265254,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5431746999117248,"acs":172905,"articleLive":2,"columnArticles":1123,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":318323,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6825506136343277,"acs":121909,"articleLive":2,"columnArticles":1126,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":178608,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44520089133139207,"acs":130264,"articleLive":2,"columnArticles":1184,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":292596,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230800542014129,"acs":135007,"articleLive":2,"columnArticles":878,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":186711,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49235470981524704,"acs":49781,"articleLive":2,"columnArticles":440,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101108,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6762968977799103,"acs":73293,"articleLive":2,"columnArticles":528,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":108374,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5760510445685616,"acs":126756,"articleLive":2,"columnArticles":982,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":220043,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48604028340767214,"acs":100361,"articleLive":2,"columnArticles":803,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":206487,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7193679431268296,"acs":505743,"articleLive":2,"columnArticles":2289,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":703038,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197530336085326,"acs":100954,"articleLive":2,"columnArticles":758,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":140262,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6613489770306161,"acs":113299,"articleLive":2,"columnArticles":859,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":171315,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5155174905092805,"acs":196224,"articleLive":2,"columnArticles":1218,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":380635,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48982798468944977,"acs":53620,"articleLive":2,"columnArticles":545,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109467,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5124942625458996,"acs":535946,"articleLive":2,"columnArticles":2761,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1045760,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5527821179757725,"acs":300719,"articleLive":2,"columnArticles":1752,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":544010,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.620982653657312,"acs":128626,"articleLive":2,"columnArticles":1087,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":207133,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7037787580978798,"acs":418141,"articleLive":2,"columnArticles":1855,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":594137,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7504860613139549,"acs":304557,"articleLive":2,"columnArticles":1569,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":405813,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5260983702677132,"acs":236880,"articleLive":2,"columnArticles":1396,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":450258,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6815878263933116,"acs":100601,"articleLive":2,"columnArticles":789,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":147598,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6669875815353739,"acs":212689,"articleLive":2,"columnArticles":1256,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":318880,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3413381806594584,"acs":47133,"articleLive":2,"columnArticles":515,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138083,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5353725358637657,"acs":134053,"articleLive":2,"columnArticles":1058,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":250392,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48381674040672873,"acs":171245,"articleLive":2,"columnArticles":1436,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":353946,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4214022642022597,"acs":185929,"articleLive":2,"columnArticles":1248,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":441215,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5669762137070938,"acs":213263,"articleLive":2,"columnArticles":1515,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":376141,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5317455501146023,"acs":113910,"articleLive":2,"columnArticles":900,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":214219,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5733710700780051,"acs":289901,"articleLive":2,"columnArticles":1607,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":505608,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7239863751236127,"acs":6589,"articleLive":2,"columnArticles":114,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9101,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5337387778743122,"acs":5529,"articleLive":2,"columnArticles":82,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10359,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5914519170333123,"acs":2823,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4773,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5465402778728355,"acs":15971,"articleLive":2,"columnArticles":193,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29222,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6143821274869223,"acs":339193,"articleLive":2,"columnArticles":1988,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":552088,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3362258831820985,"acs":7633,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22702,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49741238005783006,"acs":162048,"articleLive":2,"columnArticles":1100,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":325782,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32587791905885666,"acs":9252,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28391,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6101156515034696,"acs":59349,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97275,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192316941204761,"acs":86369,"articleLive":2,"columnArticles":923,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":166340,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3308684795786465,"acs":41210,"articleLive":2,"columnArticles":374,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":124551,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5867380501375096,"acs":296122,"articleLive":2,"columnArticles":1944,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":504692,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43258143060596316,"acs":84744,"articleLive":2,"columnArticles":755,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":195903,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646912193835447,"acs":390649,"articleLive":2,"columnArticles":2208,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":587715,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41848089017900336,"acs":8650,"articleLive":2,"columnArticles":87,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20670,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7181713889333546,"acs":107674,"articleLive":2,"columnArticles":919,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":149928,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43998328265287007,"acs":91590,"articleLive":2,"columnArticles":597,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":208167,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8045207956600362,"acs":75633,"articleLive":2,"columnArticles":632,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94010,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4806738476953908,"acs":38377,"articleLive":2,"columnArticles":408,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":79840,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7395047997703251,"acs":306524,"articleLive":2,"columnArticles":1472,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":414499,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3559029578566402,"acs":253909,"articleLive":2,"columnArticles":1021,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":713422,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46294538093617327,"acs":129215,"articleLive":2,"columnArticles":501,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":279115,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.603208625943086,"acs":120167,"articleLive":2,"columnArticles":672,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":199213,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096437311383618,"acs":122030,"articleLive":2,"columnArticles":968,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":297893,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4868198173263216,"acs":87944,"articleLive":2,"columnArticles":514,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":180650,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7019145137441889,"acs":164726,"articleLive":2,"columnArticles":679,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":234681,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967202361429977,"acs":182190,"articleLive":2,"columnArticles":588,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":228675,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6769389079032727,"acs":151306,"articleLive":2,"columnArticles":544,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":223515,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4766609062092802,"acs":103158,"articleLive":2,"columnArticles":677,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":216418,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49652260998984604,"acs":71393,"articleLive":2,"columnArticles":632,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":143786,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7564546443762984,"acs":7647,"articleLive":2,"columnArticles":116,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10109,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5206812827887214,"acs":72055,"articleLive":2,"columnArticles":530,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":138386,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39232819712632466,"acs":90516,"articleLive":2,"columnArticles":697,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":230715,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45055149015261053,"acs":347131,"articleLive":2,"columnArticles":1727,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":770458,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6984177032260777,"acs":132904,"articleLive":2,"columnArticles":836,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":190293,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7491741313736362,"acs":191859,"articleLive":2,"columnArticles":1209,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":256094,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3560775601548589,"acs":21798,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61217,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3251702201679837,"acs":26171,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80484,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3448045439358503,"acs":10320,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29930,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43626540191668295,"acs":35690,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":81808,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6654112596350864,"acs":102297,"articleLive":2,"columnArticles":391,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":153735,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.533647519317939,"acs":94890,"articleLive":2,"columnArticles":507,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":177814,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5155775056041747,"acs":392835,"articleLive":2,"columnArticles":2706,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":761932,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6524175443079563,"acs":142976,"articleLive":2,"columnArticles":1602,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":219148,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5570849634334167,"acs":333490,"articleLive":2,"columnArticles":2134,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":598634,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5241276443772189,"acs":49898,"articleLive":2,"columnArticles":326,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95202,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.619175844233765,"acs":171308,"articleLive":2,"columnArticles":1394,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":276671,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5164237055280324,"acs":235687,"articleLive":2,"columnArticles":1681,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":456383,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37793354055522405,"acs":169736,"articleLive":2,"columnArticles":735,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":449116,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5008268367587999,"acs":114480,"articleLive":2,"columnArticles":881,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":228582,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7232453206034296,"acs":718895,"articleLive":2,"columnArticles":7396,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":993985,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5432354298947305,"acs":143563,"articleLive":2,"columnArticles":942,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":264274,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7168165096102772,"acs":145746,"articleLive":2,"columnArticles":986,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":203324,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4727702649230555,"acs":197140,"articleLive":2,"columnArticles":1396,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":416989,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5424533675494505,"acs":90472,"articleLive":2,"columnArticles":677,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":166783,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4824238256626881,"acs":29465,"articleLive":2,"columnArticles":327,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61077,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4627651258533535,"acs":62160,"articleLive":2,"columnArticles":574,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":134323,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.43317440272157937,"acs":168076,"articleLive":2,"columnArticles":1544,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":388010,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3715231078684583,"acs":31215,"articleLive":2,"columnArticles":307,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84019,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6462960760481422,"acs":445594,"articleLive":2,"columnArticles":2323,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":689458,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7370359813186572,"acs":100842,"articleLive":2,"columnArticles":1042,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":136821,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5581485160268499,"acs":371435,"articleLive":2,"columnArticles":1731,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":665477,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.542331583101685,"acs":31606,"articleLive":2,"columnArticles":280,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58278,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42496839732557606,"acs":111612,"articleLive":2,"columnArticles":893,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":262636,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28658361178110686,"acs":64755,"articleLive":2,"columnArticles":421,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":225955,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47678214636459076,"acs":140789,"articleLive":2,"columnArticles":999,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":295290,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7816887824669926,"acs":117523,"articleLive":2,"columnArticles":881,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":150345,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5229758189338002,"acs":41222,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":78822,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4180575480830913,"acs":71686,"articleLive":2,"columnArticles":660,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":171474,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.675455827416442,"acs":136513,"articleLive":2,"columnArticles":4760,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":202105,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7879423609941351,"acs":308730,"articleLive":2,"columnArticles":1874,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":391818,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4373416988514197,"acs":86853,"articleLive":2,"columnArticles":703,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":198593,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5798668296773802,"acs":57390,"articleLive":2,"columnArticles":648,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":98971,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46425842654408356,"acs":37065,"articleLive":2,"columnArticles":318,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":79837,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7417425421668763,"acs":139142,"articleLive":2,"columnArticles":877,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":187588,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5045478259573389,"acs":169243,"articleLive":2,"columnArticles":1223,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":335435,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6908761344840294,"acs":161227,"articleLive":2,"columnArticles":1281,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":233366,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.477203395679481,"acs":34571,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72445,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4967048867092084,"acs":313765,"articleLive":2,"columnArticles":2008,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":631693,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660466846461452,"acs":171888,"articleLive":2,"columnArticles":988,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":258072,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6807961050549749,"acs":260926,"articleLive":2,"columnArticles":1400,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":383266,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481432066717992,"acs":210415,"articleLive":2,"columnArticles":1015,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":248089,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.723299088469632,"acs":139894,"articleLive":2,"columnArticles":881,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":193411,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4969011288290467,"acs":195225,"articleLive":2,"columnArticles":1333,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":392885,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4784317576097629,"acs":170537,"articleLive":2,"columnArticles":772,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":356450,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7380913860447916,"acs":31935,"articleLive":2,"columnArticles":287,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43267,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6455244503710982,"acs":294323,"articleLive":2,"columnArticles":1701,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":455944,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6559521170472179,"acs":8877,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13533,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5502952110212115,"acs":5033,"articleLive":2,"columnArticles":58,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9146,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6019673039623165,"acs":4345,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7218,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47565481566631085,"acs":5793,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12179,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5239248940036342,"acs":5190,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9906,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4640168096655577,"acs":2650,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5711,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6381600614776595,"acs":5813,"articleLive":2,"columnArticles":101,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9109,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6348847078794737,"acs":4488,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7069,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5440298507462686,"acs":3645,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6700,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5639759653453817,"acs":12108,"articleLive":2,"columnArticles":157,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21469,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5006986709725499,"acs":32249,"articleLive":2,"columnArticles":345,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":64408,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5695269526952695,"acs":5177,"articleLive":2,"columnArticles":75,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9090,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4745778100599237,"acs":5227,"articleLive":2,"columnArticles":61,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11014,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6404922674798519,"acs":11762,"articleLive":2,"columnArticles":186,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18364,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6827552441569182,"acs":143636,"articleLive":2,"columnArticles":1066,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":210377,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6921186589433035,"acs":78860,"articleLive":2,"columnArticles":655,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":113940,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5652381331001034,"acs":7109,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12577,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.723219463698876,"acs":52377,"articleLive":2,"columnArticles":445,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72422,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49496002780674314,"acs":8544,"articleLive":2,"columnArticles":118,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17262,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43466335571984877,"acs":38509,"articleLive":2,"columnArticles":376,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":88595,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152241507109095,"acs":107044,"articleLive":2,"columnArticles":836,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":207762,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.579830286830235,"acs":100651,"articleLive":2,"columnArticles":615,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":173587,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5893562231759657,"acs":6866,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11650,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.674015432408057,"acs":6726,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":9979,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4473718533976784,"acs":3430,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7667,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6256023800157356,"acs":152667,"articleLive":2,"columnArticles":1104,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":244032,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33870882740447955,"acs":6427,"articleLive":2,"columnArticles":106,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":18975,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.553310065300608,"acs":9829,"articleLive":2,"columnArticles":139,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17764,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.553311120366514,"acs":2657,"articleLive":2,"columnArticles":45,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4802,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6477999247837533,"acs":3445,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5318,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3110730737281949,"acs":12358,"articleLive":2,"columnArticles":163,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":39727,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44015570311733343,"acs":53824,"articleLive":2,"columnArticles":563,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122284,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46199731660441673,"acs":50962,"articleLive":2,"columnArticles":415,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110308,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49200193892389726,"acs":7105,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14441,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5701526717557251,"acs":7469,"articleLive":2,"columnArticles":84,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13100,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45345668579944914,"acs":186207,"articleLive":2,"columnArticles":1059,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":410639,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.632057623346111,"acs":204458,"articleLive":2,"columnArticles":1202,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":323480,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6846518410499454,"acs":5634,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8229,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7585697399527187,"acs":2567,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3384,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.39167983149025803,"acs":7438,"articleLive":2,"columnArticles":80,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":18990,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6388680951834906,"acs":495853,"articleLive":2,"columnArticles":3394,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":776143,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7714276717677435,"acs":24499,"articleLive":2,"columnArticles":205,"formTitle":"[284]顶端迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":31758,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6350902184235517,"acs":8025,"articleLive":2,"columnArticles":103,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12636,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5095046972169541,"acs":11552,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22673,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6595175146290913,"acs":180105,"articleLive":2,"columnArticles":1228,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":273086,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43166707707461216,"acs":3506,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8122,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533082088917854,"acs":53170,"articleLive":2,"columnArticles":829,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70582,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45667196252948,"acs":83070,"articleLive":2,"columnArticles":1104,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":181903,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5316164154103853,"acs":2539,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4776,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7082608963689045,"acs":114887,"articleLive":2,"columnArticles":766,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162210,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7120644975525482,"acs":4946,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6946,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5829459849334829,"acs":3637,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6239,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5230254067848957,"acs":64352,"articleLive":2,"columnArticles":505,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123038,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6202151613710283,"acs":2479,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":3997,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5602151276857908,"acs":105935,"articleLive":2,"columnArticles":758,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":189097,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5774466087772824,"acs":4921,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8522,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5044164194687039,"acs":30438,"articleLive":2,"columnArticles":361,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60343,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5165240479742296,"acs":364948,"articleLive":2,"columnArticles":2026,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":706546,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5236978756884343,"acs":33281,"articleLive":2,"columnArticles":235,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":63550,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6563517915309446,"acs":2015,"articleLive":2,"columnArticles":38,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3070,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7263848208735391,"acs":129704,"articleLive":2,"columnArticles":796,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":178561,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5466450980054725,"acs":63530,"articleLive":2,"columnArticles":566,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116218,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.38306737588652484,"acs":4321,"articleLive":2,"columnArticles":64,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11280,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3374170800215144,"acs":16938,"articleLive":2,"columnArticles":251,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50199,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5402159244264507,"acs":24018,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44460,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6099405726634252,"acs":2258,"articleLive":2,"columnArticles":42,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3702,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6083938394405479,"acs":118231,"articleLive":2,"columnArticles":939,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":194333,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.379324653768349,"acs":21939,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":57837,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7605814450619923,"acs":3558,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4678,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6830836152730788,"acs":56532,"articleLive":2,"columnArticles":382,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":82760,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6298083594147484,"acs":40850,"articleLive":2,"columnArticles":355,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":64861,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5461188308576904,"acs":4559,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8348,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4182031456515993,"acs":50626,"articleLive":2,"columnArticles":480,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121056,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4765200267257446,"acs":67754,"articleLive":2,"columnArticles":535,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":142185,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4835733573357336,"acs":4298,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8888,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6848341232227488,"acs":20230,"articleLive":2,"columnArticles":179,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29540,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5184411030948689,"acs":23067,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44493,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6769265845873234,"acs":2969,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4386,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4243845811335157,"acs":26687,"articleLive":2,"columnArticles":231,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62884,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44487723909784005,"acs":307690,"articleLive":2,"columnArticles":1822,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":691629,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6324443669746093,"acs":10885,"articleLive":2,"columnArticles":150,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17211,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37842269224463027,"acs":25388,"articleLive":2,"columnArticles":168,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67089,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5378213957759412,"acs":9371,"articleLive":2,"columnArticles":104,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17424,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5045816400378555,"acs":135957,"articleLive":2,"columnArticles":575,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":269445,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42125534706955026,"acs":24718,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58677,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6558912049938691,"acs":129448,"articleLive":2,"columnArticles":1071,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":197362,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48577748323851655,"acs":56442,"articleLive":2,"columnArticles":492,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":116189,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5338066260987153,"acs":18948,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35496,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47995652451889265,"acs":45042,"articleLive":2,"columnArticles":506,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93846,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44969913182880433,"acs":39833,"articleLive":2,"columnArticles":329,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":88577,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46946225949679327,"acs":4758,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10135,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4120823579484997,"acs":46473,"articleLive":2,"columnArticles":306,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":112776,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3697110108523351,"acs":3032,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8201,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4013339840572637,"acs":22203,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55323,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6078907604312479,"acs":131150,"articleLive":2,"columnArticles":926,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":215746,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869502947783522,"acs":160445,"articleLive":2,"columnArticles":1376,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":203882,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8087088388214905,"acs":3733,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4616,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49455346748711126,"acs":11895,"articleLive":2,"columnArticles":177,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24052,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7273917995444191,"acs":51092,"articleLive":2,"columnArticles":488,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70240,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5161328427232403,"acs":87388,"articleLive":2,"columnArticles":768,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":169313,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6060145940749804,"acs":110954,"articleLive":2,"columnArticles":1051,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":183088,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.768845408965177,"acs":370788,"articleLive":2,"columnArticles":1954,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":482266,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5392558702685536,"acs":108673,"articleLive":2,"columnArticles":1031,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":201524,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7059702350169511,"acs":12286,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17403,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223491850109225,"acs":203698,"articleLive":2,"columnArticles":1503,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":327305,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5989947284540885,"acs":4886,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8157,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738935685671953,"acs":215450,"articleLive":2,"columnArticles":1519,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":291568,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5502656286984193,"acs":251073,"articleLive":2,"columnArticles":1409,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":456276,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.59,"acs":5369,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9100,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.4266924564796905,"acs":2206,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5170,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.453851370991183,"acs":70263,"articleLive":2,"columnArticles":543,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":154815,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40713826760089344,"acs":26613,"articleLive":2,"columnArticles":438,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65366,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35356433458397707,"acs":1602,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4531,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5206006688119125,"acs":24753,"articleLive":2,"columnArticles":388,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47547,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.351697933982427,"acs":4443,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12633,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7266576454668471,"acs":4833,"articleLive":2,"columnArticles":56,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6651,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6075841499786963,"acs":2852,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4694,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5652173913043478,"acs":3289,"articleLive":2,"columnArticles":64,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5819,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6910194682855348,"acs":3301,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4777,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4897255694396981,"acs":32960,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67303,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7211045364891518,"acs":1828,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2535,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3655920939064388,"acs":33886,"articleLive":2,"columnArticles":482,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92688,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7642959256611865,"acs":4277,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5596,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4389017285513282,"acs":77672,"articleLive":2,"columnArticles":616,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":176969,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45912474473551307,"acs":41818,"articleLive":2,"columnArticles":451,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91082,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6172958133150309,"acs":4497,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7285,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7228054500781773,"acs":3236,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4477,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6128099236293518,"acs":80723,"articleLive":2,"columnArticles":507,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131726,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5107996406109614,"acs":14213,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27825,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.418022579262193,"acs":20476,"articleLive":2,"columnArticles":208,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":48983,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5154008047044258,"acs":83263,"articleLive":2,"columnArticles":566,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":161550,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46836662598753936,"acs":14584,"articleLive":2,"columnArticles":122,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31138,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4642540791828806,"acs":75997,"articleLive":2,"columnArticles":816,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":163697,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5089335369913446,"acs":64973,"articleLive":2,"columnArticles":552,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":127665,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390556190506638,"acs":79958,"articleLive":2,"columnArticles":565,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125119,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6389840757911711,"acs":3170,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4961,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5033228099006761,"acs":34915,"articleLive":2,"columnArticles":219,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":69369,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44142788471586514,"acs":21121,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47847,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6315664180288844,"acs":15918,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25204,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6014794068626609,"acs":70011,"articleLive":2,"columnArticles":766,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":116398,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5790664906305126,"acs":52193,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":90133,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41742235320788934,"acs":7365,"articleLive":2,"columnArticles":85,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17644,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7495317725752508,"acs":22411,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":29900,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5340001675061917,"acs":223156,"articleLive":2,"columnArticles":1207,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":417895,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5276207046541975,"acs":6065,"articleLive":2,"columnArticles":110,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11495,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6918098424495057,"acs":100906,"articleLive":2,"columnArticles":989,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":145858,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46751440492747864,"acs":7059,"articleLive":2,"columnArticles":95,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15099,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35758323057953145,"acs":4640,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12976,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152616406045252,"acs":147455,"articleLive":2,"columnArticles":1582,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":286175,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39121841027813076,"acs":11084,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28332,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5526860063943931,"acs":122389,"articleLive":2,"columnArticles":1304,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":221444,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5206126624939817,"acs":51903,"articleLive":2,"columnArticles":427,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":99696,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4287454323995128,"acs":9152,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21346,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3777314287100138,"acs":15575,"articleLive":2,"columnArticles":193,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41233,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6576928315249466,"acs":14487,"articleLive":2,"columnArticles":122,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22027,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5919603910402962,"acs":42205,"articleLive":2,"columnArticles":528,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71297,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41639549167079715,"acs":19322,"articleLive":2,"columnArticles":197,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46403,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6138947752181739,"acs":53884,"articleLive":2,"columnArticles":657,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87774,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3272087142736156,"acs":81135,"articleLive":2,"columnArticles":589,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":247961,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45558730725724833,"acs":45915,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":100782,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5839510244704058,"acs":100919,"articleLive":2,"columnArticles":1129,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":172821,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5618240606533615,"acs":45351,"articleLive":2,"columnArticles":460,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":80721,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7374913272793138,"acs":120113,"articleLive":2,"columnArticles":795,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":162867,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48411398624303964,"acs":10346,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21371,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32389185212433325,"acs":3522,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10874,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5559589655758955,"acs":94786,"articleLive":2,"columnArticles":1326,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":170491,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.564673436849136,"acs":39312,"articleLive":2,"columnArticles":319,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69619,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5016759776536313,"acs":898,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1790,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.673888379607359,"acs":74247,"articleLive":2,"columnArticles":378,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":110177,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6880805101786774,"acs":71859,"articleLive":2,"columnArticles":933,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":104434,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39304580468739336,"acs":86384,"articleLive":2,"columnArticles":1126,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":219781,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5383904856720806,"acs":149798,"articleLive":2,"columnArticles":1084,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":278233,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5075385043607348,"acs":175048,"articleLive":2,"columnArticles":989,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":344896,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48056444877505566,"acs":27619,"articleLive":2,"columnArticles":325,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":57472,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.363164069046422,"acs":2167,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":5967,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7564284392921009,"acs":12267,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16217,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20765854396851824,"acs":2744,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13214,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223463059079241,"acs":33214,"articleLive":2,"columnArticles":306,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53369,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4274107333760958,"acs":1999,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4677,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5702735480393478,"acs":8464,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14842,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5312773155908395,"acs":51663,"articleLive":2,"columnArticles":449,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97243,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6155394524959742,"acs":1529,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2484,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6688242681866486,"acs":6923,"articleLive":2,"columnArticles":114,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10351,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6129943502824858,"acs":4123,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6726,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6511111111111111,"acs":2637,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4050,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6995819775312923,"acs":58909,"articleLive":2,"columnArticles":475,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":84206,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5878907816971091,"acs":43966,"articleLive":2,"columnArticles":673,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74786,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.730899830220713,"acs":861,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1178,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37857306197118684,"acs":6622,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17492,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5321399785061794,"acs":15845,"articleLive":2,"columnArticles":213,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29776,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3990622423742787,"acs":61960,"articleLive":2,"columnArticles":864,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":155264,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5077193055758664,"acs":97212,"articleLive":2,"columnArticles":852,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":191468,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4882555938995881,"acs":8772,"articleLive":2,"columnArticles":144,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":17966,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5742764146681051,"acs":124564,"articleLive":2,"columnArticles":1026,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":216906,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5186901435199002,"acs":95592,"articleLive":2,"columnArticles":839,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":184295,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5904081632653061,"acs":2893,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4900,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3802055786786856,"acs":16534,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43487,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4257549085985105,"acs":47163,"articleLive":2,"columnArticles":476,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":110775,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6976740465830561,"acs":43613,"articleLive":2,"columnArticles":439,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62512,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47719470744297615,"acs":56298,"articleLive":2,"columnArticles":692,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":117977,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2520217615056609,"acs":3428,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13602,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885107622776661,"acs":82817,"articleLive":2,"columnArticles":936,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":140723,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5516668576010998,"acs":19262,"articleLive":2,"columnArticles":171,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34916,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6628970947597067,"acs":48829,"articleLive":2,"columnArticles":377,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73660,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6487129437599122,"acs":138255,"articleLive":2,"columnArticles":1088,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":213122,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.557204767063922,"acs":15429,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27690,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48633557688478235,"acs":61057,"articleLive":2,"columnArticles":622,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":125545,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7114441274700807,"acs":81799,"articleLive":2,"columnArticles":953,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":114976,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5089295965763792,"acs":97516,"articleLive":2,"columnArticles":850,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":191610,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5561892050395357,"acs":27503,"articleLive":2,"columnArticles":310,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49449,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6031893505544048,"acs":79206,"articleLive":2,"columnArticles":495,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":131312,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5770247010508516,"acs":152870,"articleLive":2,"columnArticles":1250,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":264928,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36251389374067133,"acs":57076,"articleLive":2,"columnArticles":459,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157445,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43585937381662854,"acs":28775,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66019,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.611352133044107,"acs":6764,"articleLive":2,"columnArticles":63,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11064,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115342952189882,"acs":79806,"articleLive":2,"columnArticles":640,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":156013,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43779341213391815,"acs":34038,"articleLive":2,"columnArticles":404,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":77749,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8122722997073022,"acs":170115,"articleLive":2,"columnArticles":1357,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":209431,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6045576980631922,"acs":14140,"articleLive":2,"columnArticles":131,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23389,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7090814775715989,"acs":77916,"articleLive":2,"columnArticles":935,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":109883,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3563137978185518,"acs":11205,"articleLive":2,"columnArticles":111,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31447,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5288874215912842,"acs":1602,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3029,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3738068455728748,"acs":11631,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31115,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44054502488812913,"acs":8762,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19889,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25125849862618077,"acs":25056,"articleLive":2,"columnArticles":298,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":99722,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4340499709471238,"acs":1494,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3442,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5468508931326499,"acs":63800,"articleLive":2,"columnArticles":335,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":116668,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6190935390549662,"acs":1284,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2074,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39986685226653756,"acs":6607,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16523,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42021542335285067,"acs":21028,"articleLive":2,"columnArticles":179,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50041,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6119330506005374,"acs":75608,"articleLive":2,"columnArticles":598,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":123556,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33419488639881134,"acs":21593,"articleLive":2,"columnArticles":240,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64612,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7016297611780158,"acs":37928,"articleLive":2,"columnArticles":483,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54057,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038845193217605,"acs":38927,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64461,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43825697735650343,"acs":6658,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15192,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41806522035748395,"acs":3064,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7329,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4483490494527152,"acs":29574,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":65962,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5406079202224566,"acs":5638,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10429,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4720991195382572,"acs":40161,"articleLive":2,"columnArticles":425,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":85069,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5906617451196773,"acs":15522,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26279,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.635890767230169,"acs":1467,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2307,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6071484984303117,"acs":123001,"articleLive":2,"columnArticles":991,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":202588,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5864529655451147,"acs":46433,"articleLive":2,"columnArticles":402,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79176,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5780015797788309,"acs":5854,"articleLive":2,"columnArticles":114,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10128,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.38754820936639117,"acs":3517,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9075,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7200532386867791,"acs":1623,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2254,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48322147651006714,"acs":6768,"articleLive":2,"columnArticles":81,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14006,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5468108828837113,"acs":47572,"articleLive":2,"columnArticles":401,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":86999,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5520445046876765,"acs":19549,"articleLive":2,"columnArticles":180,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35412,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3457516765414415,"acs":26552,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76795,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4933489456762423,"acs":150837,"articleLive":2,"columnArticles":1040,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":305741,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5427436521210278,"acs":28557,"articleLive":2,"columnArticles":437,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52616,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6873335335936718,"acs":102966,"articleLive":2,"columnArticles":1058,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":149805,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40490463215258854,"acs":2972,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7340,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.46844259660101584,"acs":43716,"articleLive":2,"columnArticles":455,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":93322,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3715415019762846,"acs":2632,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7084,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7091647251505155,"acs":30743,"articleLive":2,"columnArticles":477,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43351,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5129607128392062,"acs":65858,"articleLive":2,"columnArticles":539,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":128388,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44126471962969105,"acs":29266,"articleLive":2,"columnArticles":356,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66323,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6357630152744542,"acs":103349,"articleLive":2,"columnArticles":976,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":162559,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5044373853811894,"acs":30807,"articleLive":2,"columnArticles":321,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61072,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4833004207091955,"acs":5629,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11647,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5639607679465777,"acs":21620,"articleLive":2,"columnArticles":290,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38336,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41295228474823575,"acs":29434,"articleLive":2,"columnArticles":231,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":71277,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6771323190410328,"acs":14687,"articleLive":2,"columnArticles":211,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21690,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6747878493799523,"acs":244755,"articleLive":2,"columnArticles":1487,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":362714,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6078394947055545,"acs":3272,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5383,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7328047346257446,"acs":19316,"articleLive":2,"columnArticles":107,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26359,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5381175216206611,"acs":18169,"articleLive":2,"columnArticles":148,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":33764,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7308512312733413,"acs":51077,"articleLive":2,"columnArticles":572,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":69887,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5006752452541725,"acs":19649,"articleLive":2,"columnArticles":240,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39245,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6448163877092181,"acs":38718,"articleLive":2,"columnArticles":423,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60045,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6538394685731128,"acs":86518,"articleLive":2,"columnArticles":621,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":132323,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5106292290478981,"acs":19168,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37538,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6573987062040366,"acs":108432,"articleLive":2,"columnArticles":683,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":164941,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39743028179296247,"acs":2722,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6849,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5638490343753945,"acs":40203,"articleLive":2,"columnArticles":644,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71301,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7134530781517079,"acs":25461,"articleLive":2,"columnArticles":253,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35687,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36148022658690243,"acs":6828,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18889,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27469199751366685,"acs":68940,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":250972,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4954228794497884,"acs":72466,"articleLive":2,"columnArticles":757,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":146271,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5359241010091439,"acs":45247,"articleLive":2,"columnArticles":517,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84428,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7352114546219045,"acs":33222,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45187,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5789626195305708,"acs":1998,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3451,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4769017019798541,"acs":31579,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66217,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6450774677623672,"acs":39720,"articleLive":2,"columnArticles":463,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61574,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6208550589940297,"acs":78825,"articleLive":2,"columnArticles":638,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":126962,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6589965397923876,"acs":3809,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5780,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3747885562991836,"acs":25480,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":67985,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5253205128205128,"acs":1639,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3120,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6751984220166252,"acs":14377,"articleLive":2,"columnArticles":139,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21293,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8421164810571748,"acs":15804,"articleLive":2,"columnArticles":102,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18767,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.538353765323993,"acs":3074,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5710,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7123212655917249,"acs":11707,"articleLive":2,"columnArticles":173,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16435,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7006798805252284,"acs":109552,"articleLive":2,"columnArticles":840,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":156351,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5976680093279627,"acs":14096,"articleLive":2,"columnArticles":185,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23585,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5822166072583435,"acs":38711,"articleLive":2,"columnArticles":407,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66489,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6073916666666667,"acs":72887,"articleLive":2,"columnArticles":803,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":120000,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4581560750740863,"acs":69571,"articleLive":2,"columnArticles":644,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":151850,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5523921176617592,"acs":150307,"articleLive":2,"columnArticles":1240,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":272102,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7106567534076828,"acs":2294,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3228,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4183698296836983,"acs":3439,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8220,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6283115691101006,"acs":15060,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23969,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6187266513598096,"acs":163303,"articleLive":2,"columnArticles":1142,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":263934,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3548458149779736,"acs":1611,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4540,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.480606330806955,"acs":2156,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4486,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4381890444098842,"acs":12679,"articleLive":2,"columnArticles":179,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":28935,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5677939149793279,"acs":58916,"articleLive":2,"columnArticles":757,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103763,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5775542615140286,"acs":24002,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41558,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6048815359477124,"acs":5923,"articleLive":2,"columnArticles":86,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9792,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5030210818975897,"acs":45955,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91358,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3433716237193418,"acs":1106,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3221,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32599373430799655,"acs":14672,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45007,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7454916810097533,"acs":162424,"articleLive":2,"columnArticles":1329,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":217875,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5040664474822634,"acs":2913,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5779,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7283024698694939,"acs":61275,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84134,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465539355162094,"acs":151451,"articleLive":2,"columnArticles":930,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":339155,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7748373400259568,"acs":90150,"articleLive":2,"columnArticles":751,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116347,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4664506061697275,"acs":3886,"articleLive":2,"columnArticles":61,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8331,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6060061745719899,"acs":32388,"articleLive":2,"columnArticles":324,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53445,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.1795181693658851,"acs":4456,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24822,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.610699062233589,"acs":14327,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23460,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6897167872777629,"acs":69480,"articleLive":2,"columnArticles":644,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":100737,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4318381706244503,"acs":119313,"articleLive":2,"columnArticles":1090,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":276291,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5074499787143465,"acs":1192,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2349,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5647341888175985,"acs":9858,"articleLive":2,"columnArticles":155,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17456,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.660431654676259,"acs":12852,"articleLive":2,"columnArticles":112,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19460,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48866498740554154,"acs":6790,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":13895,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4732272069464544,"acs":84366,"articleLive":2,"columnArticles":738,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":178278,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6640776699029126,"acs":1026,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1545,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.647936426557293,"acs":12638,"articleLive":2,"columnArticles":113,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19505,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6834237162673189,"acs":42470,"articleLive":2,"columnArticles":437,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62143,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4686626746506986,"acs":25828,"articleLive":2,"columnArticles":280,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55110,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7030980666200792,"acs":15092,"articleLive":2,"columnArticles":85,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21465,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4960200250312891,"acs":9908,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":19975,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41083089992036104,"acs":7738,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18835,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5228707035935951,"acs":10025,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19173,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.405022586950578,"acs":99252,"articleLive":2,"columnArticles":861,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":245053,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40818428691825076,"acs":8718,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21358,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6188172174722556,"acs":50519,"articleLive":2,"columnArticles":491,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":81638,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744403194960063,"acs":13768,"articleLive":2,"columnArticles":61,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17778,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5957809503515875,"acs":8388,"articleLive":2,"columnArticles":100,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14079,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7459180017402877,"acs":14573,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19537,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3847530422333572,"acs":2150,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5588,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42638125542377786,"acs":1474,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3457,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7452246435297283,"acs":88640,"articleLive":2,"columnArticles":565,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":118944,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7609594104885528,"acs":62786,"articleLive":2,"columnArticles":462,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82509,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3423371647509579,"acs":1787,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5220,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5227644174643942,"acs":4478,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8566,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4414333350976552,"acs":8340,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18893,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5182245633882486,"acs":29317,"articleLive":2,"columnArticles":270,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56572,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7967219683601365,"acs":103393,"articleLive":2,"columnArticles":237,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":129773,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42107002856095155,"acs":81528,"articleLive":2,"columnArticles":285,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":193621,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.441473000683527,"acs":10334,"articleLive":2,"columnArticles":81,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23408,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5176681270186435,"acs":16188,"articleLive":2,"columnArticles":210,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31271,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5222124101140808,"acs":28976,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55487,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48153604154702756,"acs":19286,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40051,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5001503616593597,"acs":31600,"articleLive":2,"columnArticles":375,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63181,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6291149068322981,"acs":8103,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12880,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6715494447382337,"acs":12699,"articleLive":2,"columnArticles":112,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":18910,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37381316998468606,"acs":2441,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6530,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33361196871148424,"acs":109354,"articleLive":2,"columnArticles":1258,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":327788,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5694682675814752,"acs":28552,"articleLive":2,"columnArticles":313,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50138,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6613149847094801,"acs":12110,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18312,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6562419006479482,"acs":7596,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11575,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4859365649311789,"acs":6496,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13368,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6662221375500095,"acs":10491,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15747,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319683112334779,"acs":50429,"articleLive":2,"columnArticles":392,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":94797,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6677876749681876,"acs":7347,"articleLive":2,"columnArticles":64,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11002,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8174859550561798,"acs":11641,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14240,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34516294147756355,"acs":8092,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23444,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42554557124518616,"acs":5304,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12464,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46087570621468926,"acs":3263,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7080,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.787824392031753,"acs":189159,"articleLive":2,"columnArticles":1247,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":240103,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6191751472951259,"acs":4624,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7468,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46608009209768936,"acs":11336,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24322,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735769291345109,"acs":93322,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":120637,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5710534208197093,"acs":78067,"articleLive":2,"columnArticles":499,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":136707,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43681916481986116,"acs":65242,"articleLive":2,"columnArticles":422,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":149357,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5459912681087518,"acs":11005,"articleLive":2,"columnArticles":188,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20156,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4192122958693564,"acs":2182,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5205,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34273644044698826,"acs":2515,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7338,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6841080885348301,"acs":45342,"articleLive":2,"columnArticles":354,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66279,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8083149618219493,"acs":85430,"articleLive":2,"columnArticles":339,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":105689,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5248657146600288,"acs":80126,"articleLive":2,"columnArticles":759,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":152660,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40721040189125296,"acs":4134,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10152,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3678453614213785,"acs":6356,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17279,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2886460554371002,"acs":1083,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3752,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5977113513170824,"acs":18856,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31547,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3980457625038615,"acs":94061,"articleLive":2,"columnArticles":766,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":236307,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.440530058177117,"acs":1363,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3094,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.553415300546448,"acs":4051,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7320,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5511939626041902,"acs":9787,"articleLive":2,"columnArticles":112,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17756,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900047885663769,"acs":74929,"articleLive":2,"columnArticles":650,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":108592,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5924317617866005,"acs":11460,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19344,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37671412514050207,"acs":20109,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53380,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4248435054773083,"acs":10859,"articleLive":2,"columnArticles":212,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25560,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5325930342326228,"acs":21439,"articleLive":2,"columnArticles":241,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40254,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4886272944932163,"acs":2449,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5012,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45065245359308953,"acs":63752,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":141466,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4009848751319029,"acs":1140,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2843,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4341231268999602,"acs":68690,"articleLive":2,"columnArticles":696,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":158227,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5775265164285158,"acs":22270,"articleLive":2,"columnArticles":198,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38561,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6566833290225865,"acs":124408,"articleLive":2,"columnArticles":918,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":189449,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5847302359922338,"acs":21383,"articleLive":2,"columnArticles":279,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36569,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4817929025423729,"acs":29108,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60416,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5670856879252681,"acs":49172,"articleLive":2,"columnArticles":651,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86710,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5840433772269559,"acs":3770,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6455,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5714210461624906,"acs":32543,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":56951,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.597849027147359,"acs":41358,"articleLive":2,"columnArticles":391,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69178,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8104949959426562,"acs":59928,"articleLive":2,"columnArticles":607,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":73940,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5979635719706552,"acs":9455,"articleLive":2,"columnArticles":138,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15812,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3079446064139942,"acs":845,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2744,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7833908117351471,"acs":82003,"articleLive":2,"columnArticles":626,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":104677,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4548156451147229,"acs":26780,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":58881,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419856071162693,"acs":28393,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52387,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6550424128180962,"acs":695,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1061,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5609615515020004,"acs":16545,"articleLive":2,"columnArticles":213,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29494,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40896438107140826,"acs":28796,"articleLive":2,"columnArticles":271,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":70412,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46418338108882523,"acs":1782,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3839,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6539477197875561,"acs":22040,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33703,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27074933159910397,"acs":74938,"articleLive":2,"columnArticles":936,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":276780,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6178956572427864,"acs":2120,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3431,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6243856775099462,"acs":8004,"articleLive":2,"columnArticles":119,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12819,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5082395048840505,"acs":6816,"articleLive":2,"columnArticles":67,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13411,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6658786879237676,"acs":36337,"articleLive":2,"columnArticles":305,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54570,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4511287138133638,"acs":18965,"articleLive":2,"columnArticles":282,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42039,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.486216747334328,"acs":53443,"articleLive":2,"columnArticles":668,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":109916,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5486474368554775,"acs":3671,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6691,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43500449764103316,"acs":47392,"articleLive":2,"columnArticles":413,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":108946,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49656641563766185,"acs":92774,"articleLive":2,"columnArticles":763,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":186831,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40118850193477057,"acs":2903,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7236,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5872806656231979,"acs":7129,"articleLive":2,"columnArticles":130,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12139,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6173661360347322,"acs":14931,"articleLive":2,"columnArticles":251,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24185,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3855381096344631,"acs":43486,"articleLive":2,"columnArticles":476,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":112793,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5411926777849674,"acs":25928,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47909,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4016744349824402,"acs":86695,"articleLive":2,"columnArticles":823,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":215834,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5030138051720785,"acs":2587,"articleLive":2,"columnArticles":62,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5143,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6950287095799336,"acs":45997,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66180,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4342621664050236,"acs":2213,"articleLive":2,"columnArticles":50,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5096,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6657052206518604,"acs":60008,"articleLive":2,"columnArticles":606,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90142,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4310841611835032,"acs":20048,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46506,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3558812631232245,"acs":17288,"articleLive":2,"columnArticles":195,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48578,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44109838866060297,"acs":38215,"articleLive":2,"columnArticles":272,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86636,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108764788194886,"acs":8032,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15722,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4858203414996288,"acs":3272,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6735,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6475224834195632,"acs":55944,"articleLive":2,"columnArticles":566,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86397,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4908666391979124,"acs":3574,"articleLive":2,"columnArticles":47,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7281,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5777609990328656,"acs":68103,"articleLive":2,"columnArticles":737,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":117874,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6097110097110097,"acs":26056,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42735,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5347277032359905,"acs":4065,"articleLive":2,"columnArticles":78,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7602,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6650959066539234,"acs":130132,"articleLive":2,"columnArticles":1289,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":195659,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6317273255251186,"acs":52211,"articleLive":2,"columnArticles":475,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82648,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6051098936044557,"acs":66599,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110061,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44674525271540194,"acs":29902,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":66933,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47766856354543885,"acs":2770,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5799,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7602236333006276,"acs":82130,"articleLive":2,"columnArticles":519,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":108034,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7233424470266575,"acs":76194,"articleLive":2,"columnArticles":564,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":105336,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7400616860863605,"acs":4319,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5836,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5127627180634351,"acs":60285,"articleLive":2,"columnArticles":548,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117569,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5562699236734984,"acs":289845,"articleLive":2,"columnArticles":1437,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":521051,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6454253395406102,"acs":67101,"articleLive":2,"columnArticles":433,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":103964,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6442269276867759,"acs":58050,"articleLive":2,"columnArticles":390,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":90108,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3213817029941926,"acs":63918,"articleLive":2,"columnArticles":440,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":198885,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33891655349328503,"acs":2246,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6627,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7588041360707328,"acs":70889,"articleLive":2,"columnArticles":509,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93422,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3522773347749696,"acs":5213,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14798,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5600624024960998,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1282,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6719755112905372,"acs":15147,"articleLive":2,"columnArticles":169,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22541,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41360384372588904,"acs":23587,"articleLive":2,"columnArticles":218,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":57028,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7216660424649247,"acs":100199,"articleLive":2,"columnArticles":671,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":138844,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.41052795514717333,"acs":2636,"articleLive":2,"columnArticles":44,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6421,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4611207394569613,"acs":3991,"articleLive":2,"columnArticles":73,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8655,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115647577946952,"acs":31650,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61869,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5644529555812076,"acs":84594,"articleLive":2,"columnArticles":588,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":149869,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36995711728215164,"acs":8886,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24019,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.485053581500282,"acs":20640,"articleLive":2,"columnArticles":274,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42552,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4694659587250556,"acs":28913,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61587,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3218155009936534,"acs":5020,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15599,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7206858407079646,"acs":1303,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1808,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4624167938163344,"acs":137895,"articleLive":2,"columnArticles":863,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":298205,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6084335845854341,"acs":48755,"articleLive":2,"columnArticles":624,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80132,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5525001900803406,"acs":21800,"articleLive":2,"columnArticles":396,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39457,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4093789607097592,"acs":2907,"articleLive":2,"columnArticles":49,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7101,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7602176785434349,"acs":33946,"articleLive":2,"columnArticles":310,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44653,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5130922693266833,"acs":8230,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16040,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49020341944340445,"acs":3928,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8013,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5066834804539723,"acs":4018,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7930,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6108605448313188,"acs":3386,"articleLive":2,"columnArticles":53,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5543,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804055833552805,"acs":66114,"articleLive":2,"columnArticles":566,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":113910,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.48196180146191936,"acs":2044,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4241,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4060345999262179,"acs":20912,"articleLive":2,"columnArticles":263,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51503,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4632768361581921,"acs":1558,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3363,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4608477011494253,"acs":3849,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8352,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017205111681238,"acs":41263,"articleLive":2,"columnArticles":587,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82243,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6797760712070542,"acs":212619,"articleLive":2,"columnArticles":1516,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":312778,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6295903388555145,"acs":51039,"articleLive":2,"columnArticles":588,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":81067,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3671983036784364,"acs":3983,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10847,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49498868412544456,"acs":1531,"articleLive":2,"columnArticles":44,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3093,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5199905262486677,"acs":57083,"articleLive":2,"columnArticles":519,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":109777,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45887648984059964,"acs":41080,"articleLive":2,"columnArticles":364,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89523,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39251570609123193,"acs":2874,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7322,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5877357257959148,"acs":134950,"articleLive":2,"columnArticles":1297,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":229610,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4164374518648916,"acs":45420,"articleLive":2,"columnArticles":403,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109068,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6019646554629942,"acs":12501,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20767,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5052199850857569,"acs":1355,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2682,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.721940622737147,"acs":1994,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2762,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027046520014424,"acs":1394,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2773,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5302744190296348,"acs":69642,"articleLive":2,"columnArticles":590,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":131332,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5912516081602647,"acs":3217,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5441,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43083705177141013,"acs":8014,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18601,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49884881043745205,"acs":1300,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2606,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5656889327088982,"acs":4590,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8114,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4195768105969379,"acs":2439,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5813,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4617616033755274,"acs":3502,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7584,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.659227771873893,"acs":1861,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2823,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8394720034064297,"acs":3943,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4697,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5907553551296505,"acs":2096,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3548,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7001139354889404,"acs":17820,"articleLive":2,"columnArticles":140,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25453,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631330900674737,"acs":81772,"articleLive":2,"columnArticles":985,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":107153,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4937921248669741,"acs":4176,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8457,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6650141643059491,"acs":29109,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43772,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080638094992655,"acs":54950,"articleLive":2,"columnArticles":635,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77606,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4778922733405772,"acs":40023,"articleLive":2,"columnArticles":497,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83749,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5055719592342128,"acs":5308,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10499,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5870393900889453,"acs":12474,"articleLive":2,"columnArticles":149,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21249,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5548837209302325,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2150,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512891574981496,"acs":152969,"articleLive":2,"columnArticles":1112,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":179691,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4929103580869983,"acs":6153,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12483,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7132541916534084,"acs":23312,"articleLive":2,"columnArticles":333,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32684,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5899893503727369,"acs":1108,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1878,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.45993822674418605,"acs":5063,"articleLive":2,"columnArticles":80,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11008,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5688661114670083,"acs":1776,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3122,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32347654664579345,"acs":5579,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17247,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5942248855849706,"acs":23501,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39549,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4365463513575808,"acs":18940,"articleLive":2,"columnArticles":235,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43386,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.286957285990508,"acs":3265,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11378,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.617242708467172,"acs":43236,"articleLive":2,"columnArticles":661,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70047,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4276747503566334,"acs":1499,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3505,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5959143169997263,"acs":69660,"articleLive":2,"columnArticles":670,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":116896,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6869029035279426,"acs":44003,"articleLive":2,"columnArticles":485,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64060,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5121681977363853,"acs":40365,"articleLive":2,"columnArticles":403,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":78812,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.47215415460013366,"acs":4239,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8978,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3911746172949331,"acs":42214,"articleLive":2,"columnArticles":399,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":107916,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6080787463787201,"acs":18471,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30376,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.692221118834823,"acs":20912,"articleLive":2,"columnArticles":294,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30210,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.45021444302770375,"acs":3884,"articleLive":2,"columnArticles":66,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8627,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6950177066796923,"acs":11383,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16378,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4639987718131109,"acs":9067,"articleLive":2,"columnArticles":98,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19541,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39278463220365456,"acs":5030,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12806,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3408246656760773,"acs":7340,"articleLive":2,"columnArticles":102,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21536,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5331068478550492,"acs":8003,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15012,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5300285772147342,"acs":23555,"articleLive":2,"columnArticles":278,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44441,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.793194582094483,"acs":43218,"articleLive":2,"columnArticles":536,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":54486,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46390374331550804,"acs":1388,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2992,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40882443690219067,"acs":5300,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12964,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7059401080019637,"acs":1438,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2037,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41964234041321835,"acs":7251,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17279,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5765752436611122,"acs":31176,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54071,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48180638055151254,"acs":12248,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25421,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7714141492583676,"acs":39734,"articleLive":2,"columnArticles":399,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51508,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29015942825728425,"acs":2639,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9095,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6568215158924205,"acs":13432,"articleLive":2,"columnArticles":151,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20450,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8451675521046179,"acs":16545,"articleLive":2,"columnArticles":217,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19576,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4808366184844503,"acs":4391,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9132,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41935207404868013,"acs":4893,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11668,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7337840226228349,"acs":16607,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22632,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7048456164074826,"acs":15637,"articleLive":2,"columnArticles":199,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22185,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6307261918638536,"acs":10822,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17158,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5498102466793169,"acs":6954,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12648,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6996239567091627,"acs":22884,"articleLive":2,"columnArticles":355,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32709,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4338598543941758,"acs":26698,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61536,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5103270223752151,"acs":3558,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6972,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5912035010940919,"acs":13509,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22850,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4329615567157095,"acs":3649,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8428,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42132517132517133,"acs":21887,"articleLive":2,"columnArticles":249,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":51948,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5074909131164782,"acs":55011,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108398,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6929173132343162,"acs":25006,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36088,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5029845505617978,"acs":2865,"articleLive":2,"columnArticles":40,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5696,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42815420560747663,"acs":2932,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6848,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6152408866092691,"acs":16793,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27295,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3911778674899074,"acs":6589,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16844,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3738008278548819,"acs":7676,"articleLive":2,"columnArticles":112,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20535,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3907688318423441,"acs":9042,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23139,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4920975909160657,"acs":3207,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6517,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36556185000422764,"acs":8647,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23654,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5433693480739261,"acs":51951,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95609,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4051812909869384,"acs":7476,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18451,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7958230410638337,"acs":85699,"articleLive":2,"columnArticles":917,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107686,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4300787137832859,"acs":5136,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11942,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5284276977707635,"acs":13393,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25345,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5740814963259853,"acs":4297,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7485,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4793154270322466,"acs":37725,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78706,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3959461392288674,"acs":19378,"articleLive":2,"columnArticles":244,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48941,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5007016559079428,"acs":7136,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14252,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5746522039602175,"acs":19125,"articleLive":2,"columnArticles":269,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33281,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35955415285046544,"acs":9000,"articleLive":2,"columnArticles":113,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25031,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6577671916290424,"acs":55507,"articleLive":2,"columnArticles":545,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84387,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48821757466219123,"acs":28363,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58095,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3801145662847791,"acs":2787,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7332,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5128343010783445,"acs":89646,"articleLive":2,"columnArticles":987,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":174805,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4212238782606751,"acs":37673,"articleLive":2,"columnArticles":556,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89437,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5112852849313454,"acs":8676,"articleLive":2,"columnArticles":121,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16969,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6812285943306857,"acs":18697,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27446,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44915506958250495,"acs":9037,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20120,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4265303938356164,"acs":15942,"articleLive":2,"columnArticles":186,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37376,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44914159128669007,"acs":2433,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5417,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4807390817469205,"acs":4293,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8930,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.714366784117089,"acs":84341,"articleLive":2,"columnArticles":726,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":118064,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3839295790542828,"acs":10206,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26583,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.359894197387998,"acs":4354,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12098,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4083904109589041,"acs":4770,"articleLive":2,"columnArticles":57,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11680,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6269700930268317,"acs":16310,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26014,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4666769993800372,"acs":3011,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6452,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5552123552123552,"acs":2876,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5180,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3022120204852803,"acs":27912,"articleLive":2,"columnArticles":363,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92359,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5870575242924636,"acs":89838,"articleLive":2,"columnArticles":773,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":153031,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085576898351718,"acs":31444,"articleLive":2,"columnArticles":439,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38889,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1919386933244895,"acs":16205,"articleLive":2,"columnArticles":128,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84428,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.604397301889707,"acs":35214,"articleLive":2,"columnArticles":562,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58263,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4552306300874284,"acs":3020,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6634,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6575012763474583,"acs":9015,"articleLive":2,"columnArticles":129,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13711,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22459316090748344,"acs":7494,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33367,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702755039169087,"acs":83765,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":124971,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6242118537200504,"acs":16335,"articleLive":2,"columnArticles":236,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26169,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5513930561508787,"acs":6432,"articleLive":2,"columnArticles":95,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11665,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4293086547886755,"acs":14891,"articleLive":2,"columnArticles":190,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34686,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34187879664448945,"acs":9455,"articleLive":2,"columnArticles":125,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27656,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520862316261714,"acs":60466,"articleLive":2,"columnArticles":722,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92727,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5110565110565111,"acs":15184,"articleLive":2,"columnArticles":112,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29711,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41458636290192274,"acs":20527,"articleLive":2,"columnArticles":227,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49512,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47941795080911703,"acs":44676,"articleLive":2,"columnArticles":354,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":93188,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7061730805889929,"acs":151883,"articleLive":2,"columnArticles":1642,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":215079,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7572588979142822,"acs":68148,"articleLive":2,"columnArticles":484,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":89993,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28118609406952966,"acs":4400,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15648,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5543402553850123,"acs":21489,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38765,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2526774753418279,"acs":5969,"articleLive":2,"columnArticles":77,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23623,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.537753138458719,"acs":46948,"articleLive":2,"columnArticles":572,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87304,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48739035087719296,"acs":1778,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3648,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.688883235817858,"acs":10832,"articleLive":2,"columnArticles":110,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15724,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6620565447872774,"acs":19483,"articleLive":2,"columnArticles":253,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29428,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6914592338649576,"acs":4639,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6709,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4249067859806115,"acs":8547,"articleLive":2,"columnArticles":115,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20115,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2915222061815826,"acs":51291,"articleLive":2,"columnArticles":336,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":175942,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6404070109398894,"acs":54441,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85010,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6757336837494525,"acs":15427,"articleLive":2,"columnArticles":147,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22830,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7262767710049424,"acs":8817,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12140,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33066295135260654,"acs":2848,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8613,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385324971712406,"acs":33295,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52143,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7247539436429823,"acs":10751,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14834,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7749232223009686,"acs":13121,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16932,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5450222426752569,"acs":7106,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13038,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867863017206567,"acs":59577,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101531,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7443437829546544,"acs":62114,"articleLive":2,"columnArticles":708,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83448,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33787431728294304,"acs":5382,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15929,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5375433192144783,"acs":4188,"articleLive":2,"columnArticles":46,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7791,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4926900584795322,"acs":3370,"articleLive":2,"columnArticles":49,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6840,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5453602604361729,"acs":18930,"articleLive":2,"columnArticles":231,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34711,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32947919754916494,"acs":3334,"articleLive":2,"columnArticles":77,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10119,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5307232191408374,"acs":2928,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5517,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4535072683154872,"acs":20372,"articleLive":2,"columnArticles":277,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":44921,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7006347137754609,"acs":58063,"articleLive":2,"columnArticles":601,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":82872,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2774756544833692,"acs":2194,"articleLive":2,"columnArticles":39,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7907,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3173111977340924,"acs":11315,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35659,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.698674719006878,"acs":20824,"articleLive":2,"columnArticles":191,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29805,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.459412780656304,"acs":16226,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35319,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31907625691604524,"acs":6632,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20785,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4249431387414708,"acs":4484,"articleLive":2,"columnArticles":68,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10552,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5606588711490893,"acs":229379,"articleLive":2,"columnArticles":1053,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":409124,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4045231491359078,"acs":1896,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4687,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38890475510495504,"acs":49023,"articleLive":2,"columnArticles":616,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126054,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4695304695304695,"acs":9400,"articleLive":2,"columnArticles":114,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20020,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44151257012258466,"acs":6375,"articleLive":2,"columnArticles":75,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14439,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5700602981949319,"acs":29402,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51577,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35725517980265775,"acs":20674,"articleLive":2,"columnArticles":223,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":57869,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6322328718494853,"acs":5343,"articleLive":2,"columnArticles":100,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8451,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48364485981308414,"acs":1863,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3852,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7374806583204389,"acs":20971,"articleLive":2,"columnArticles":310,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28436,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.714086017235217,"acs":89907,"articleLive":2,"columnArticles":826,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":125905,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3389078313579044,"acs":6262,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18477,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3588363303172603,"acs":6266,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17462,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3874228739363912,"acs":50358,"articleLive":2,"columnArticles":677,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":129982,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5226483524963346,"acs":6773,"articleLive":2,"columnArticles":122,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":12959,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3392083497439937,"acs":3445,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10156,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4196547144754316,"acs":2212,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5271,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6440188745544903,"acs":25659,"articleLive":2,"columnArticles":232,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39842,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449655974416125,"acs":33741,"articleLive":2,"columnArticles":342,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":61914,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6641731402448771,"acs":20776,"articleLive":2,"columnArticles":265,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31281,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6322996077270372,"acs":8543,"articleLive":2,"columnArticles":82,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13511,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.724941209575302,"acs":36068,"articleLive":2,"columnArticles":310,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49753,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4742700435554122,"acs":23520,"articleLive":2,"columnArticles":264,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49592,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4748268617228231,"acs":6102,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12851,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37848315968015506,"acs":1562,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4127,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.587602534505624,"acs":11963,"articleLive":2,"columnArticles":127,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20359,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8186733927773044,"acs":97048,"articleLive":2,"columnArticles":801,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118543,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4535350158783219,"acs":5427,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11966,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.421216717222784,"acs":4999,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11868,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3925005532897025,"acs":62072,"articleLive":2,"columnArticles":615,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158145,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7300222961837981,"acs":22592,"articleLive":2,"columnArticles":213,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30947,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47027573994434607,"acs":1859,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3953,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6894200168864064,"acs":21230,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30794,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48607758147701086,"acs":35437,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72904,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.624354531475914,"acs":27205,"articleLive":2,"columnArticles":299,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43573,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125079529655725,"acs":25993,"articleLive":2,"columnArticles":335,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42437,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3919113829112098,"acs":6793,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17333,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37076609327895016,"acs":8363,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22556,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7746545598105014,"acs":9811,"articleLive":2,"columnArticles":146,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12665,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6641728513287048,"acs":11097,"articleLive":2,"columnArticles":168,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16708,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.35205134082053635,"acs":3072,"articleLive":2,"columnArticles":59,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8726,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5530414107390529,"acs":13956,"articleLive":2,"columnArticles":169,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25235,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3007342269273457,"acs":7045,"articleLive":2,"columnArticles":105,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23426,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3284701530874345,"acs":3197,"articleLive":2,"columnArticles":49,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9733,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43766290182450046,"acs":4030,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9208,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3607032899926211,"acs":14176,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39301,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5361942478737908,"acs":24777,"articleLive":2,"columnArticles":230,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46209,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7432370993407592,"acs":19617,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26394,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.554652466367713,"acs":1979,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3568,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6766280271707029,"acs":36657,"articleLive":2,"columnArticles":303,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54176,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4424746624409891,"acs":13403,"articleLive":2,"columnArticles":130,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30291,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5028867210830181,"acs":2526,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5023,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4317845516424978,"acs":1459,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3379,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6834600760456274,"acs":33074,"articleLive":2,"columnArticles":392,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48392,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40341655716162944,"acs":3070,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7610,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.463654461000181,"acs":7686,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16577,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4988922376798866,"acs":24995,"articleLive":2,"columnArticles":327,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50101,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6512877366535903,"acs":15274,"articleLive":2,"columnArticles":196,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23452,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41415849396911286,"acs":11022,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26613,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.440025823111685,"acs":6816,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15490,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4104691988509416,"acs":1286,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3133,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6409161638012828,"acs":67550,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105396,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46624643404382543,"acs":37427,"articleLive":2,"columnArticles":385,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80273,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.447417637749964,"acs":3110,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6951,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5973753982576923,"acs":53624,"articleLive":2,"columnArticles":500,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89766,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7106542443064182,"acs":171623,"articleLive":2,"columnArticles":1346,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":241500,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735492917629789,"acs":43227,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91283,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7120661994427088,"acs":8433,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11843,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7344455852156058,"acs":14307,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19480,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5323471351108223,"acs":21304,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40019,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5450064294899272,"acs":2543,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4666,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6342699487340039,"acs":32415,"articleLive":2,"columnArticles":454,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51106,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41717027263920287,"acs":9043,"articleLive":2,"columnArticles":144,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21677,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6004282180959061,"acs":16265,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27089,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6773090986169255,"acs":25563,"articleLive":2,"columnArticles":247,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":37742,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5329021566506318,"acs":23153,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43447,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.498371335504886,"acs":9333,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18727,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4713096017139835,"acs":52576,"articleLive":2,"columnArticles":594,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111553,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5027417896956915,"acs":33372,"articleLive":2,"columnArticles":502,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66380,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5199405646359584,"acs":8748,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16825,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45277634124384686,"acs":23639,"articleLive":2,"columnArticles":272,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52209,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5569512221808871,"acs":50902,"articleLive":2,"columnArticles":805,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91394,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5090961326376467,"acs":54933,"articleLive":2,"columnArticles":1403,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":107903,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5399345747357825,"acs":21457,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39740,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49580893328740383,"acs":4318,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8709,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5109084806444395,"acs":36532,"articleLive":2,"columnArticles":396,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":71504,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6146059291395517,"acs":7650,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12447,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6905917025617774,"acs":30462,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44110,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.40925883167859617,"acs":3545,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8662,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2920476586311998,"acs":2108,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7218,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7354538301796747,"acs":57019,"articleLive":2,"columnArticles":600,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77529,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5765953417913274,"acs":12180,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21124,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5971212201638445,"acs":67495,"articleLive":2,"columnArticles":714,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113034,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5320871630692967,"acs":25761,"articleLive":2,"columnArticles":420,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":48415,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6274359737517184,"acs":44270,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70557,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46525167661581546,"acs":6313,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13569,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7226054600944856,"acs":17284,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23919,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928477436334082,"acs":15318,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25838,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4521954327158679,"acs":18455,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40812,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6267436667116757,"acs":60341,"articleLive":2,"columnArticles":579,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96277,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3342033713974986,"acs":3073,"articleLive":2,"columnArticles":64,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9195,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3970880435609744,"acs":46964,"articleLive":2,"columnArticles":919,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118271,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5504774799429617,"acs":38218,"articleLive":2,"columnArticles":450,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":69427,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35514496458044253,"acs":4863,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13693,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.584112676056338,"acs":5184,"articleLive":2,"columnArticles":80,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8875,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5610529654297495,"acs":3538,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6306,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5162214188459552,"acs":43980,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85196,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5976364659538548,"acs":20178,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33763,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5368092846007275,"acs":9297,"articleLive":2,"columnArticles":138,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17319,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7833561932180833,"acs":57684,"articleLive":2,"columnArticles":655,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73637,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7046661676113072,"acs":19768,"articleLive":2,"columnArticles":266,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28053,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5644377141946282,"acs":7082,"articleLive":2,"columnArticles":155,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12547,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5572768855797803,"acs":33382,"articleLive":2,"columnArticles":383,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59902,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.709570522114063,"acs":75372,"articleLive":2,"columnArticles":649,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106222,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6705588552915767,"acs":9935,"articleLive":2,"columnArticles":169,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14816,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.434319604181002,"acs":13255,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30519,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7317794775580891,"acs":20282,"articleLive":2,"columnArticles":424,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27716,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6555893595444262,"acs":16808,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25638,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7106002106002106,"acs":40490,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56980,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5672919109026964,"acs":4839,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8530,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3978629792583281,"acs":2532,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6364,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.390813199344309,"acs":10967,"articleLive":2,"columnArticles":167,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28062,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43255273853299786,"acs":4470,"articleLive":2,"columnArticles":98,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10334,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6329707560627674,"acs":35497,"articleLive":2,"columnArticles":385,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56080,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2999538958045182,"acs":3253,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10845,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43844995207448995,"acs":9606,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21909,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.793480309025815,"acs":25266,"articleLive":2,"columnArticles":318,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31842,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5548848096587409,"acs":4504,"articleLive":2,"columnArticles":60,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8117,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5210878990934175,"acs":2644,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5074,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4825430277485072,"acs":6869,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14235,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5300027780350033,"acs":11447,"articleLive":2,"columnArticles":151,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21598,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6915324394852875,"acs":7685,"articleLive":2,"columnArticles":100,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11113,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20889720174569992,"acs":5696,"articleLive":2,"columnArticles":72,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27267,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6406238113351084,"acs":8421,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13145,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6597861553134883,"acs":65718,"articleLive":2,"columnArticles":912,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99605,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7248772324490412,"acs":105690,"articleLive":2,"columnArticles":980,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":145804,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45534126018163096,"acs":9727,"articleLive":2,"columnArticles":133,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21362,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6447925295579486,"acs":42811,"articleLive":2,"columnArticles":402,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":66395,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.757223113964687,"acs":11322,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":14952,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7535003149072235,"acs":31106,"articleLive":2,"columnArticles":369,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41282,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.581239105171412,"acs":48015,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82608,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45886809958249575,"acs":5935,"articleLive":2,"columnArticles":95,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12934,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3764063612627581,"acs":7929,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21065,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5868960283329118,"acs":4640,"articleLive":2,"columnArticles":85,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7906,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.40974663595587346,"acs":3380,"articleLive":2,"columnArticles":65,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8249,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46532233424992364,"acs":3046,"articleLive":2,"columnArticles":38,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6546,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34136958194408823,"acs":1331,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3899,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3627325208466966,"acs":2262,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6236,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5311766884800593,"acs":4302,"articleLive":2,"columnArticles":63,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8099,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6054466230936819,"acs":2779,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4590,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5433009099466583,"acs":3463,"articleLive":2,"columnArticles":47,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6374,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7050938337801609,"acs":1841,"articleLive":2,"columnArticles":39,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2611,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6505105513955072,"acs":4778,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7345,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5422143016261973,"acs":2434,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4489,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4736111111111111,"acs":2046,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4320,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4225855901890649,"acs":827,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1957,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.864409013045197,"acs":13120,"articleLive":2,"columnArticles":63,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15178,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8191764618910328,"acs":11081,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13527,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48174009763331893,"acs":7796,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16183,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5868036134980763,"acs":34622,"articleLive":2,"columnArticles":672,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59001,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5809055809055809,"acs":3310,"articleLive":2,"columnArticles":54,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5698,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33584484442584067,"acs":2407,"articleLive":2,"columnArticles":53,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7167,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6691688424717145,"acs":18453,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27576,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6932474943302362,"acs":9476,"articleLive":2,"columnArticles":71,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13669,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49619771863117873,"acs":10179,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20514,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7208786973696888,"acs":7482,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10379,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6224684550948998,"acs":11741,"articleLive":2,"columnArticles":182,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18862,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7344897031118041,"acs":11306,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15393,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49044956906592124,"acs":4211,"articleLive":2,"columnArticles":90,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8586,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5706300221264703,"acs":14700,"articleLive":2,"columnArticles":145,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25761,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7604382390273231,"acs":11383,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":14969,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5279346510689794,"acs":10470,"articleLive":2,"columnArticles":95,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19832,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5365751194664706,"acs":10218,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19043,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7733105218135158,"acs":3616,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4676,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6893640201552499,"acs":5062,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7343,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5336270190895741,"acs":1817,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3405,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45051635111876076,"acs":1047,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2324,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854886146569237,"acs":19310,"articleLive":2,"columnArticles":286,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":32981,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5450243562978427,"acs":3916,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7185,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3786183410362442,"acs":28017,"articleLive":2,"columnArticles":285,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":73998,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4898415657036347,"acs":2628,"articleLive":2,"columnArticles":51,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5365,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37953421269579557,"acs":3683,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9704,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6087834770767135,"acs":26823,"articleLive":2,"columnArticles":377,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44060,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3727283074705012,"acs":19648,"articleLive":2,"columnArticles":385,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52714,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5482499182204776,"acs":1676,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3057,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5192908400168847,"acs":6151,"articleLive":2,"columnArticles":109,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11845,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47161855335711966,"acs":7270,"articleLive":2,"columnArticles":102,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15415,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5808505526189333,"acs":4835,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8324,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6993839835728953,"acs":5109,"articleLive":2,"columnArticles":100,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7305,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6665739710789766,"acs":2397,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3596,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37039904286015907,"acs":5263,"articleLive":2,"columnArticles":66,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14209,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6368085182662316,"acs":35525,"articleLive":2,"columnArticles":1102,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55786,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7611245578104636,"acs":28616,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37597,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5591549295774648,"acs":5161,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9230,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.576382252559727,"acs":4222,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7325,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41021806853582554,"acs":6584,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16050,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8396501823011289,"acs":67015,"articleLive":2,"columnArticles":681,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79813,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5768858800773694,"acs":58457,"articleLive":2,"columnArticles":583,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101332,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6298668464520478,"acs":11211,"articleLive":2,"columnArticles":202,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17799,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712094583799329,"acs":24135,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31295,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6448805460750853,"acs":7558,"articleLive":2,"columnArticles":86,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11720,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5402824903337805,"acs":6847,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12673,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6534660156447989,"acs":77356,"articleLive":2,"columnArticles":577,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118378,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5618381018294832,"acs":43025,"articleLive":2,"columnArticles":478,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76579,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5193442472389962,"acs":22619,"articleLive":2,"columnArticles":368,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43553,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5215951843491347,"acs":17330,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33225,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.642169006330856,"acs":2333,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3633,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8665902936888148,"acs":8321,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9602,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6088466882816118,"acs":2629,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4318,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5754072517078297,"acs":1095,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1903,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070309527174681,"acs":65032,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":91979,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7049223250130913,"acs":8077,"articleLive":2,"columnArticles":103,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11458,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31814329161888616,"acs":12762,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40114,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4909355778569116,"acs":3033,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6178,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6931010772404309,"acs":6048,"articleLive":2,"columnArticles":92,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8726,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4138113367174281,"acs":3913,"articleLive":2,"columnArticles":72,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9456,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448365974689491,"acs":37111,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68114,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3801018842447677,"acs":6193,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16293,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6282845545823542,"acs":5882,"articleLive":2,"columnArticles":101,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9362,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4548554484803558,"acs":3068,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6745,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.38816666666666666,"acs":4658,"articleLive":2,"columnArticles":53,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12000,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6464982269503546,"acs":2917,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4512,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7762512266928361,"acs":3164,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4076,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5358393848782571,"acs":6272,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11705,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5702462238775088,"acs":2756,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4833,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6080296527506828,"acs":77919,"articleLive":2,"columnArticles":863,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":128150,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43249541025278915,"acs":6125,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14162,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.478032619775739,"acs":9379,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19620,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.651951313755796,"acs":6749,"articleLive":2,"columnArticles":95,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10352,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5102166546873396,"acs":9938,"articleLive":2,"columnArticles":64,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19478,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3706237207799203,"acs":6881,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18566,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6368468279272227,"acs":166787,"articleLive":2,"columnArticles":1128,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":261895,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4416988416988417,"acs":10296,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23310,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4691717573518966,"acs":6605,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14078,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28682381795885,"acs":4210,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14678,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5604350220264317,"acs":4071,"articleLive":2,"columnArticles":81,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7264,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7144969047399058,"acs":7733,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10823,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44233185358907784,"acs":5281,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":11939,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6043884705271358,"acs":4655,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7702,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48607565560454863,"acs":4189,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8618,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3854196100593388,"acs":1364,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3539,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37072533217164017,"acs":1702,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4591,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5693827356394795,"acs":14353,"articleLive":2,"columnArticles":222,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25208,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4796747967479675,"acs":9676,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20172,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4314853556485356,"acs":4950,"articleLive":2,"columnArticles":81,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11472,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3195693079657119,"acs":3057,"articleLive":2,"columnArticles":46,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9566,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5508818163389418,"acs":5435,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9866,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48775430866917197,"acs":3764,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7717,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6869010323341387,"acs":59419,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86503,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6333916400265396,"acs":10501,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16579,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4691409456826731,"acs":38288,"articleLive":2,"columnArticles":493,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81613,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.267356384426899,"acs":5892,"articleLive":2,"columnArticles":100,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22038,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6087143625605164,"acs":5658,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9295,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8369961347321921,"acs":7579,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9055,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48392311837614516,"acs":2694,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5567,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43404334828101643,"acs":2323,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5352,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5710696338837042,"acs":1591,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2786,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32245543415756184,"acs":6729,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20868,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166186012977649,"acs":13684,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22192,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47458995339962573,"acs":12934,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27253,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26757516764006056,"acs":2474,"articleLive":2,"columnArticles":53,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9246,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7575242947447872,"acs":8029,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10599,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6188954231654309,"acs":4841,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7822,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.490702549191967,"acs":7257,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14789,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4499843538124544,"acs":4314,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9587,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2652277142240449,"acs":6144,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23165,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4618350038550501,"acs":18569,"articleLive":2,"columnArticles":183,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40207,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6364528317641901,"acs":30488,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":47903,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7760416666666666,"acs":3129,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4032,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37219171243135296,"acs":1491,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4006,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.39743336623889436,"acs":2013,"articleLive":2,"columnArticles":41,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5065,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5988857938718662,"acs":645,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1077,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5855242944300575,"acs":13340,"articleLive":2,"columnArticles":260,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22783,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6081637072325682,"acs":11234,"articleLive":2,"columnArticles":204,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18472,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3943602471352379,"acs":7468,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18937,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44156769596199524,"acs":1859,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4210,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6944030644818047,"acs":3263,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4699,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6453249203550772,"acs":20864,"articleLive":2,"columnArticles":326,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32331,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6508997280564717,"acs":44998,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69132,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26718408492796286,"acs":5990,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22419,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4980640619500176,"acs":4245,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8523,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6049802544975866,"acs":5515,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9116,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.509310445155659,"acs":3501,"articleLive":2,"columnArticles":62,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6874,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6361587637400543,"acs":13832,"articleLive":2,"columnArticles":263,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21743,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6930494174367215,"acs":3450,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4978,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3700474223649992,"acs":4838,"articleLive":2,"columnArticles":60,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13074,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7471574484486414,"acs":3877,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5189,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43790849673202614,"acs":737,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1683,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6868546771459393,"acs":17828,"articleLive":2,"columnArticles":250,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25956,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24689836496590256,"acs":6010,"articleLive":2,"columnArticles":85,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24342,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5034226664916261,"acs":26843,"articleLive":2,"columnArticles":294,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53321,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6214282036760541,"acs":12070,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19423,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7265057113187954,"acs":5597,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7704,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46759138096484343,"acs":5360,"articleLive":2,"columnArticles":82,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11463,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6131287452333394,"acs":6753,"articleLive":2,"columnArticles":87,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11014,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7303341996412753,"acs":59856,"articleLive":2,"columnArticles":830,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":81957,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4968017057569296,"acs":47299,"articleLive":2,"columnArticles":612,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95207,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5288970556065975,"acs":12089,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22857,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4489864864864865,"acs":2658,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5920,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6557039161215162,"acs":7317,"articleLive":2,"columnArticles":61,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11159,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5102813299232737,"acs":4988,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9775,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7745072273324572,"acs":5894,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7610,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6351809954751131,"acs":3369,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5304,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41203703703703703,"acs":1958,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4752,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5385745775165319,"acs":1466,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2722,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6942904479704327,"acs":21791,"articleLive":2,"columnArticles":353,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31386,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4223567721583393,"acs":8301,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19654,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6307587721591801,"acs":12062,"articleLive":2,"columnArticles":171,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19123,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5267010029818379,"acs":3886,"articleLive":2,"columnArticles":73,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7378,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.843893601979498,"acs":76396,"articleLive":2,"columnArticles":1109,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90528,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6725602755453501,"acs":5858,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8710,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4753798536859876,"acs":3379,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7108,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3266810374800083,"acs":4698,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14381,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5402989925251869,"acs":3325,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6154,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5971513712813779,"acs":11823,"articleLive":2,"columnArticles":136,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19799,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6626991998942009,"acs":10022,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15123,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5398214598284614,"acs":3084,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5713,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4184999133899186,"acs":2416,"articleLive":2,"columnArticles":44,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5773,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4936830321445706,"acs":3087,"articleLive":2,"columnArticles":62,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6253,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5623947614593078,"acs":3006,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5345,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4695348966436986,"acs":33799,"articleLive":2,"columnArticles":420,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":71984,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4815374388106605,"acs":7968,"articleLive":2,"columnArticles":115,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16547,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34354217710885543,"acs":5889,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17142,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4626396903075013,"acs":6334,"articleLive":2,"columnArticles":110,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13691,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5623809523809524,"acs":1181,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2100,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7106239932768401,"acs":10147,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14279,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6591871295512278,"acs":3114,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4724,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4910684002261165,"acs":34748,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70760,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49405342171963346,"acs":2534,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5129,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5953322040278562,"acs":6326,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10626,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47105864432597105,"acs":1237,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2626,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5404219761855024,"acs":2587,"articleLive":2,"columnArticles":55,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4787,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6200762388818297,"acs":2440,"articleLive":2,"columnArticles":41,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3935,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5108100317094263,"acs":3544,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6938,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4812571615649042,"acs":2940,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6109,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6172865897107026,"acs":8663,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14034,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5595864058993267,"acs":34907,"articleLive":2,"columnArticles":479,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62380,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5752766119801602,"acs":22617,"articleLive":2,"columnArticles":320,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39315,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.562331466500726,"acs":2711,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4821,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7718925188478639,"acs":7986,"articleLive":2,"columnArticles":95,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10346,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7485794865414126,"acs":18049,"articleLive":2,"columnArticles":315,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24111,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39325588412794205,"acs":5213,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13256,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5987324059593382,"acs":14548,"articleLive":2,"columnArticles":228,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24298,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6809675947056139,"acs":2984,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4382,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6669565217391304,"acs":1534,"articleLive":2,"columnArticles":36,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2300,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5629241209130167,"acs":1825,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3242,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5606751824817519,"acs":1229,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2192,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4793488824101069,"acs":1973,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4116,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6037156231714453,"acs":12381,"articleLive":2,"columnArticles":251,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20508,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.728302593390132,"acs":7779,"articleLive":2,"columnArticles":98,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10681,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5256979183475875,"acs":13031,"articleLive":2,"columnArticles":198,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24788,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41928947723895715,"acs":3104,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7403,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5700106345267636,"acs":4824,"articleLive":2,"columnArticles":84,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8463,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9220647773279352,"acs":2733,"articleLive":2,"columnArticles":66,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2964,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8240419079128757,"acs":29888,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36270,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071938709258538,"acs":9352,"articleLive":2,"columnArticles":146,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15402,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5845612491752804,"acs":7974,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13641,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4914741295151318,"acs":30206,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61460,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8039268788083954,"acs":5937,"articleLive":2,"columnArticles":83,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7385,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5070422535211268,"acs":2448,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4828,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5190568475452196,"acs":1607,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3096,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5442247658688866,"acs":1569,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2883,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.600739371534196,"acs":975,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1623,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5414592046737038,"acs":8156,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15063,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5014978108917736,"acs":6529,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13019,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7246668438437298,"acs":19087,"articleLive":2,"columnArticles":234,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26339,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5975186104218362,"acs":3612,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6045,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6200548374461418,"acs":1583,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2553,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5061737747140368,"acs":6682,"articleLive":2,"columnArticles":69,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13201,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318457300275482,"acs":45294,"articleLive":2,"columnArticles":616,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54450,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8107278191558865,"acs":12409,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15306,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4182189640668189,"acs":6960,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16642,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6602907421576129,"acs":2589,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3921,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8130337913108058,"acs":4379,"articleLive":2,"columnArticles":60,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5386,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6458927359131025,"acs":4757,"articleLive":2,"columnArticles":93,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7365,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6034805681286093,"acs":15466,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25628,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5633948522717868,"acs":13615,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24166,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6261520737327189,"acs":6522,"articleLive":2,"columnArticles":97,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10416,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8095518334087822,"acs":53649,"articleLive":2,"columnArticles":697,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66270,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5199376253063043,"acs":7002,"articleLive":2,"columnArticles":156,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13467,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.469760900140647,"acs":6012,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12798,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35935765158285266,"acs":13270,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":36927,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6568460812086875,"acs":6956,"articleLive":2,"columnArticles":72,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10590,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8083655950176738,"acs":48025,"articleLive":2,"columnArticles":637,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59410,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45391908603733583,"acs":7708,"articleLive":2,"columnArticles":123,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16981,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45799957467923724,"acs":6461,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14107,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5974382433668801,"acs":2612,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4372,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7865386605941413,"acs":30395,"articleLive":2,"columnArticles":432,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38644,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4668550525480481,"acs":24121,"articleLive":2,"columnArticles":363,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51667,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36121116614137777,"acs":3209,"articleLive":2,"columnArticles":74,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8884,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8182990763085629,"acs":19667,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24034,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8215984332742703,"acs":8810,"articleLive":2,"columnArticles":83,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10723,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7240685823362989,"acs":21242,"articleLive":2,"columnArticles":383,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29337,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7470192067847343,"acs":14974,"articleLive":2,"columnArticles":226,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20045,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5754424194400423,"acs":17429,"articleLive":2,"columnArticles":272,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30288,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33134920634920634,"acs":1837,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5544,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7508871540099361,"acs":5290,"articleLive":2,"columnArticles":60,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7045,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7557133752162433,"acs":16600,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21966,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129766877779276,"acs":37037,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51947,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37828992226919406,"acs":5548,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14666,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.667739695764691,"acs":10579,"articleLive":2,"columnArticles":151,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15843,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8318668252080856,"acs":34980,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42050,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7396799187095136,"acs":11647,"articleLive":2,"columnArticles":192,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15746,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8103896103896104,"acs":12792,"articleLive":2,"columnArticles":262,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15785,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44055722653158147,"acs":2783,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6317,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6143830248960155,"acs":10192,"articleLive":2,"columnArticles":193,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16589,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6549141965678628,"acs":6297,"articleLive":2,"columnArticles":113,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9615,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.617106762348332,"acs":30872,"articleLive":2,"columnArticles":512,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50027,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5887538718131999,"acs":2471,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4197,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6147794324248385,"acs":4376,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7118,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5937149270482603,"acs":5290,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8910,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7549293154761905,"acs":24351,"articleLive":2,"columnArticles":478,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32256,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5889741800418702,"acs":5908,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10031,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7291175419792784,"acs":10204,"articleLive":2,"columnArticles":181,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13995,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47232047380110226,"acs":5742,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12157,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.688908472869193,"acs":5472,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7943,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46213123686463764,"acs":5937,"articleLive":2,"columnArticles":121,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12847,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.77154552494745,"acs":6974,"articleLive":2,"columnArticles":157,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9039,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37816764132553604,"acs":1164,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3078,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5353659089877955,"acs":11800,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22041,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6867084000582326,"acs":9434,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13738,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5435981805864706,"acs":5617,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10333,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.489772826181565,"acs":5627,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11489,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5851938895417156,"acs":3486,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5957,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4219529579472559,"acs":1776,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4209,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7059592073746098,"acs":38904,"articleLive":2,"columnArticles":621,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55108,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6398161244695898,"acs":9047,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14140,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3984476067270375,"acs":8316,"articleLive":2,"columnArticles":130,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20871,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5740594580373586,"acs":4364,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7602,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4792731402612152,"acs":3376,"articleLive":2,"columnArticles":46,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7044,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8203091371551555,"acs":41926,"articleLive":2,"columnArticles":638,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51110,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5445274162577342,"acs":12761,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23435,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5923069316721052,"acs":5990,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10113,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36655928242056723,"acs":5803,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15831,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4349141160473957,"acs":15673,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36037,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7397364179387503,"acs":7802,"articleLive":2,"columnArticles":115,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10547,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3050943396226415,"acs":3234,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10600,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5059658174782329,"acs":3138,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6202,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8476566454094544,"acs":8374,"articleLive":2,"columnArticles":84,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9879,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7548214966332105,"acs":29706,"articleLive":2,"columnArticles":543,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39355,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4445413675098973,"acs":6625,"articleLive":2,"columnArticles":71,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14903,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2838235294117647,"acs":11387,"articleLive":2,"columnArticles":154,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40120,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28146275043765806,"acs":2894,"articleLive":2,"columnArticles":70,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10282,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6607019958706125,"acs":3840,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5812,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7316122435938399,"acs":45796,"articleLive":2,"columnArticles":505,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62596,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.52935767765664,"acs":4030,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7613,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49422958329662586,"acs":5610,"articleLive":2,"columnArticles":111,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11351,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5512319123973406,"acs":2819,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5114,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.505476937651726,"acs":8537,"articleLive":2,"columnArticles":140,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16889,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.402243676177121,"acs":7458,"articleLive":2,"columnArticles":201,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18541,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5252895179649609,"acs":5307,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10103,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36526143304036945,"acs":4904,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13426,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6734529328764361,"acs":3341,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4961,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250286313255818,"acs":85006,"articleLive":2,"columnArticles":1087,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103034,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5381462081530403,"acs":7089,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13173,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4182394269183083,"acs":15180,"articleLive":2,"columnArticles":222,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36295,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5247843251937417,"acs":3589,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6839,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6085393258426967,"acs":2708,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4450,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900897642455529,"acs":48058,"articleLive":2,"columnArticles":575,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60826,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5800169579606684,"acs":21206,"articleLive":2,"columnArticles":264,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36561,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5132943616820668,"acs":8166,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15909,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4033252587535785,"acs":7326,"articleLive":2,"columnArticles":163,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18164,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7395560216745324,"acs":16924,"articleLive":2,"columnArticles":225,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22884,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5743395725474578,"acs":8653,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15066,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5029803763980979,"acs":7510,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14931,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32430124223602486,"acs":4177,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12880,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8610311750599521,"acs":7181,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8340,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8376476298333603,"acs":10355,"articleLive":2,"columnArticles":161,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12362,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7280797656010846,"acs":16649,"articleLive":2,"columnArticles":250,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22867,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7315776458951533,"acs":11834,"articleLive":2,"columnArticles":152,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16176,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6924033320900161,"acs":11138,"articleLive":2,"columnArticles":174,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16086,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3228067691000496,"acs":4559,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14123,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5434965034965035,"acs":1943,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3575,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7012191958495461,"acs":13516,"articleLive":2,"columnArticles":201,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19275,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.311844525075799,"acs":6274,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20119,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6950414981911045,"acs":9798,"articleLive":2,"columnArticles":170,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14097,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5409049656424219,"acs":4172,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7713,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.83121564919331,"acs":28130,"articleLive":2,"columnArticles":479,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33842,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35359177745503295,"acs":6330,"articleLive":2,"columnArticles":115,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17902,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39955638151189976,"acs":6665,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16681,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4035015235242473,"acs":7813,"articleLive":2,"columnArticles":143,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19363,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8562077702702703,"acs":4055,"articleLive":2,"columnArticles":60,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4736,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6649025178036346,"acs":17086,"articleLive":2,"columnArticles":274,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25697,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7486445228193925,"acs":14222,"articleLive":2,"columnArticles":211,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18997,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41240846543815884,"acs":10250,"articleLive":2,"columnArticles":142,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":24854,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3738590726542534,"acs":1024,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2739,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7615546218487395,"acs":4350,"articleLive":2,"columnArticles":65,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5712,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6709294848896192,"acs":9391,"articleLive":2,"columnArticles":150,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13997,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6051731509191962,"acs":5662,"articleLive":2,"columnArticles":97,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9356,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41699499520817807,"acs":3916,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9391,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7533720200752823,"acs":9607,"articleLive":2,"columnArticles":175,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12752,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6910152448913396,"acs":21304,"articleLive":2,"columnArticles":362,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30830,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4928111734903464,"acs":7198,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14606,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5073622977640428,"acs":5582,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11002,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5684136475553992,"acs":4848,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8529,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6665525504964054,"acs":5841,"articleLive":2,"columnArticles":66,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8763,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6151330938564981,"acs":13357,"articleLive":2,"columnArticles":203,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21714,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.806657364959139,"acs":8094,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10034,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4752190317835902,"acs":7431,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15637,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5504860569076847,"acs":7758,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14093,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5557522123893806,"acs":2826,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5085,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6933920142875367,"acs":10871,"articleLive":2,"columnArticles":222,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15678,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6029399755002042,"acs":7383,"articleLive":2,"columnArticles":148,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12245,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6850541215653622,"acs":6582,"articleLive":2,"columnArticles":178,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9608,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40934989043097153,"acs":2802,"articleLive":2,"columnArticles":50,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6845,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5189139104862426,"acs":12881,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24823,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7326788694938751,"acs":25898,"articleLive":2,"columnArticles":415,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35347,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4188679245283019,"acs":7881,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18815,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5969965534219597,"acs":2425,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4062,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7482346550787615,"acs":2755,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3682,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5400978624774658,"acs":10486,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19415,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541246526399365,"acs":34896,"articleLive":2,"columnArticles":510,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":62975,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39769025762511107,"acs":6715,"articleLive":2,"columnArticles":144,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16885,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43821305841924396,"acs":3188,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7275,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7098020280057943,"acs":1470,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2071,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6580373269114991,"acs":1093,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1661,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5946890286512928,"acs":851,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1431,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5053763440860215,"acs":1175,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2325,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5846538782318599,"acs":701,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1199,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462981733485734,"acs":78484,"articleLive":2,"columnArticles":1031,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92738,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3937860010473032,"acs":4512,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11458,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6441586280814576,"acs":6010,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9330,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46530314097881664,"acs":2548,"articleLive":2,"columnArticles":45,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5476,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6198459447213411,"acs":4104,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6621,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.821770911685857,"acs":42608,"articleLive":2,"columnArticles":635,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":51849,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.587471180340775,"acs":10447,"articleLive":2,"columnArticles":175,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17783,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4826802369918461,"acs":32913,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68188,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5617722667473158,"acs":3715,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6613,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6983416688602264,"acs":2653,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3799,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6474136685450079,"acs":17923,"articleLive":2,"columnArticles":375,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27684,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916162193032553,"acs":34653,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43775,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.410583406625623,"acs":5602,"articleLive":2,"columnArticles":139,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13644,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.526579739217653,"acs":2625,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4985,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.857081081081081,"acs":3964,"articleLive":2,"columnArticles":51,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4625,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5730962399891407,"acs":12666,"articleLive":2,"columnArticles":215,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22101,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6175515760812651,"acs":5897,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9549,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7110849922867847,"acs":9680,"articleLive":2,"columnArticles":155,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13613,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6278394991028138,"acs":16445,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26193,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8025942845710093,"acs":24069,"articleLive":2,"columnArticles":342,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29989,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5228055526562989,"acs":10018,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19162,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4987399193548387,"acs":5937,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11904,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36473214285714284,"acs":1634,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4480,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.39640282069566596,"acs":5003,"articleLive":2,"columnArticles":80,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12621,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6328678726330266,"acs":11965,"articleLive":2,"columnArticles":205,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18906,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5228251507321274,"acs":13354,"articleLive":2,"columnArticles":208,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25542,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6325455126157777,"acs":7922,"articleLive":2,"columnArticles":138,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12524,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4423486701917765,"acs":5605,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12671,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5963760504201681,"acs":2271,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3808,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7454049046852909,"acs":15289,"articleLive":2,"columnArticles":310,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20511,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5005114217524719,"acs":5872,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11732,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4275312542931721,"acs":6224,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14558,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5916114790286976,"acs":2680,"articleLive":2,"columnArticles":64,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4530,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7684817573246008,"acs":26518,"articleLive":2,"columnArticles":369,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34507,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3091954583109985,"acs":6345,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20521,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48436069575831553,"acs":6349,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13108,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6172839506172839,"acs":1650,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2673,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.707596751075012,"acs":2962,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4186,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7948164146868251,"acs":2208,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2778,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8429211215189075,"acs":53453,"articleLive":2,"columnArticles":724,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63414,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5437832250443001,"acs":7365,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13544,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6166832936842913,"acs":8036,"articleLive":2,"columnArticles":130,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13031,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6744479221005043,"acs":15515,"articleLive":2,"columnArticles":165,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23004,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7185268695978956,"acs":1912,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2661,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7213629772837119,"acs":14925,"articleLive":2,"columnArticles":232,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20690,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8650575973669775,"acs":12616,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14584,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28997981716728005,"acs":4885,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16846,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5801526717557252,"acs":2660,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4585,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5659661412726211,"acs":1939,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3426,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692592893291116,"acs":128480,"articleLive":2,"columnArticles":1286,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147804,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5140723430197114,"acs":10119,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19684,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5866103898550997,"acs":31132,"articleLive":2,"columnArticles":404,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53071,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.2999730724351494,"acs":3342,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11141,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8077709611451943,"acs":790,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":978,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6604732690622261,"acs":3768,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5705,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585540651784417,"acs":70920,"articleLive":2,"columnArticles":681,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82604,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3104019390022218,"acs":7684,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24755,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23702061048786852,"acs":7268,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30664,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6910004786979416,"acs":11548,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16712,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8557833089311859,"acs":1169,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1366,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.671675051490698,"acs":19893,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29617,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6622200099552016,"acs":6652,"articleLive":2,"columnArticles":79,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10045,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5675198587819947,"acs":7716,"articleLive":2,"columnArticles":147,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13596,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3697159841479524,"acs":2239,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6056,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428256678600937,"acs":3942,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7262,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5377005610788463,"acs":10925,"articleLive":2,"columnArticles":165,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20318,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3907057607367729,"acs":8315,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21282,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3344443020125625,"acs":5218,"articleLive":2,"columnArticles":66,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15602,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37496511303377056,"acs":2687,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7166,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30226209048361935,"acs":775,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2564,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5920462762111353,"acs":4094,"articleLive":2,"columnArticles":60,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6915,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7171819850345899,"acs":25399,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35415,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5129745314752523,"acs":8540,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16648,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5946769280102614,"acs":7418,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12474,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36306574165840766,"acs":3297,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9081,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8421052631578947,"acs":576,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":684,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5897014015843998,"acs":9677,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16410,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5526124158019298,"acs":6071,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10986,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.546680828465215,"acs":5147,"articleLive":2,"columnArticles":77,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9415,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.577704244637152,"acs":5063,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8764,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6793718305251104,"acs":4153,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6113,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488151590162273,"acs":58637,"articleLive":2,"columnArticles":742,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69081,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37976902454114253,"acs":11049,"articleLive":2,"columnArticles":149,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29094,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3224968026733776,"acs":7817,"articleLive":2,"columnArticles":136,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24239,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3423462712603576,"acs":3140,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9172,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5829268292682926,"acs":239,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":410,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7324608453121648,"acs":3414,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4661,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6743983920908252,"acs":24830,"articleLive":2,"columnArticles":397,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36818,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2976145399469898,"acs":5502,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18487,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33280360217189775,"acs":2513,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7551,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39681346760859765,"acs":2640,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6653,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7086538461538462,"acs":737,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1040,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5773381294964028,"acs":9951,"articleLive":2,"columnArticles":170,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17236,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42721217887725976,"acs":4939,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11561,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6615441357265798,"acs":5381,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8134,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.614813367207348,"acs":3146,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5117,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5031703536705651,"acs":3571,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7097,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7850560529286671,"acs":29902,"articleLive":2,"columnArticles":358,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38089,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6905557714729887,"acs":8884,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12865,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5669064748201439,"acs":8668,"articleLive":2,"columnArticles":146,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15290,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3280214861235452,"acs":1832,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5585,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6147484493452792,"acs":2676,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4353,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6194503171247357,"acs":293,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":473,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7893136803316444,"acs":17136,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21710,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4532213845099383,"acs":13225,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29180,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44028329219873374,"acs":4103,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9319,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3661832564271589,"acs":4444,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12136,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5990566037735849,"acs":127,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":212,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5392670157068062,"acs":16377,"articleLive":2,"columnArticles":247,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30369,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31754765179799566,"acs":4848,"articleLive":2,"columnArticles":85,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15267,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4611804855347863,"acs":5946,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12893,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3829589465530596,"acs":2472,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6455,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5519909416871108,"acs":2925,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5299,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5459883125155787,"acs":19714,"articleLive":2,"columnArticles":319,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36107,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5536480686695279,"acs":7482,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13514,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4140311446460106,"acs":5158,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12458,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5364106645443693,"acs":4044,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7539,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7119675456389453,"acs":351,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":493,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6684871654833424,"acs":2448,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3662,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.659501102792706,"acs":21230,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32191,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8166239472720616,"acs":11151,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13655,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5110762155796086,"acs":9113,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17831,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29569377990430623,"acs":7725,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26125,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7097203728362184,"acs":533,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":751,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4385990408370876,"acs":3018,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6881,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5785115135972645,"acs":10828,"articleLive":2,"columnArticles":165,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18717,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7693363395745515,"acs":7848,"articleLive":2,"columnArticles":106,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10201,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6228204770539825,"acs":4465,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7169,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3668357641090679,"acs":3471,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9462,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5747632386287849,"acs":8618,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14994,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7803926842388381,"acs":11606,"articleLive":2,"columnArticles":167,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14872,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30933625091174327,"acs":4241,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13710,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37830864787386526,"acs":3959,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10465,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5412844036697247,"acs":649,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1199,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7246474143720618,"acs":3237,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4467,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.445580344535442,"acs":7889,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17705,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39806935094627205,"acs":12536,"articleLive":2,"columnArticles":202,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":31492,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45553183920313056,"acs":2561,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5622,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4734656206737425,"acs":2052,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4334,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8970831040176115,"acs":1630,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1817,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7584207004238234,"acs":3400,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4483,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8051327583291054,"acs":19043,"articleLive":2,"columnArticles":320,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23652,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2949797731945089,"acs":4448,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15079,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3265081764463378,"acs":4752,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14554,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5958756981240154,"acs":4161,"articleLive":2,"columnArticles":67,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":6983,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47665540450663757,"acs":17917,"articleLive":2,"columnArticles":254,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37589,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32488376536526337,"acs":5101,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15701,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5823898696142082,"acs":10854,"articleLive":2,"columnArticles":202,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18637,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6188057863958141,"acs":16084,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25992,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.632420091324201,"acs":277,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":438,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.808570097810899,"acs":3472,"articleLive":2,"columnArticles":45,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4294,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6709782301385355,"acs":9493,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14148,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853028688976234,"acs":18656,"articleLive":2,"columnArticles":242,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27223,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6644946978408075,"acs":26005,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39135,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4298626174981923,"acs":2378,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5532,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6254071661237784,"acs":384,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":614,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8247546085707446,"acs":3445,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4177,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8392580256130477,"acs":43842,"articleLive":2,"columnArticles":697,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52239,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2933843212237094,"acs":3836,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13075,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2684226102397159,"acs":3628,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13516,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5778474399164054,"acs":1106,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1914,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44476576055523426,"acs":7690,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17290,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5311199207135778,"acs":5359,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10090,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31380345086271566,"acs":4183,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13330,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4649273935515629,"acs":1889,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4063,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7537546933667084,"acs":2409,"articleLive":2,"columnArticles":40,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3196,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6621315192743764,"acs":292,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":441,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6720068484774367,"acs":10990,"articleLive":2,"columnArticles":149,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16354,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41943539630836046,"acs":3863,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9210,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6788488629502918,"acs":16866,"articleLive":2,"columnArticles":206,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24845,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48963497070752593,"acs":2173,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4438,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7863636363636364,"acs":692,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":880,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443176766928434,"acs":56983,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67490,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4153829103402416,"acs":3748,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9023,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7356495468277946,"acs":3409,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4634,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34104775930990955,"acs":1621,"articleLive":2,"columnArticles":33,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4753,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.545350391445484,"acs":2856,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5237,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6391759319816874,"acs":9773,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15290,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5122751926919783,"acs":7178,"articleLive":2,"columnArticles":123,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14012,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2698759191176471,"acs":2349,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8704,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6101546542165159,"acs":2091,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3427,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7355371900826446,"acs":445,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":605,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7217391304347827,"acs":1660,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2300,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8211833455076698,"acs":16863,"articleLive":2,"columnArticles":285,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20535,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49668255303242687,"acs":5315,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10701,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27568728995647623,"acs":5004,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18151,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6199432221433641,"acs":1747,"articleLive":2,"columnArticles":32,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2818,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5954631379962193,"acs":315,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":529,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6745747126436782,"acs":7336,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10875,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37217365088935783,"acs":2469,"articleLive":2,"columnArticles":42,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6634,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4402687904430065,"acs":1769,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4018,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14961202715809893,"acs":2468,"articleLive":2,"columnArticles":54,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16496,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.783498046426109,"acs":3409,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4351,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6258022050353793,"acs":11409,"articleLive":2,"columnArticles":197,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18231,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.542962962962963,"acs":2932,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5400,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3866258999901371,"acs":3920,"articleLive":2,"columnArticles":84,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10139,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3809226932668329,"acs":2444,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6416,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8425531914893617,"acs":396,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":470,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5239179954441914,"acs":8280,"articleLive":2,"columnArticles":98,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15804,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7685367624183346,"acs":7411,"articleLive":2,"columnArticles":115,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9643,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49320993667803215,"acs":25314,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51325,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31850726838793664,"acs":1468,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4609,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6560833737275812,"acs":2707,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4126,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5237515225334958,"acs":430,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":821,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5486473659231135,"acs":1156,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2107,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7068304514513731,"acs":9034,"articleLive":2,"columnArticles":176,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12781,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8067632850241546,"acs":5344,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6624,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7113532691332995,"acs":2807,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3946,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40275111964171467,"acs":1259,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3126,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6605902324366676,"acs":12647,"articleLive":2,"columnArticles":216,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19145,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.770688445096663,"acs":12079,"articleLive":2,"columnArticles":278,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15673,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4509776536312849,"acs":6458,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14320,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45175526579739217,"acs":2252,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4985,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5466143277723258,"acs":1114,"articleLive":2,"columnArticles":23,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2038,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4105754276827372,"acs":792,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1929,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5367014150870764,"acs":34855,"articleLive":2,"columnArticles":354,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":64943,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5143951212593958,"acs":7254,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14102,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2770302739067756,"acs":3459,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12486,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47382150177007637,"acs":2543,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5367,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7950191570881227,"acs":1245,"articleLive":2,"columnArticles":29,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1566,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6817769718948323,"acs":752,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1103,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6563505583948515,"acs":6935,"articleLive":2,"columnArticles":176,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10566,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.506468483347096,"acs":3680,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7266,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2738029063765584,"acs":3448,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12593,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3828734538534729,"acs":2012,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5255,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7810568295114656,"acs":7834,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10030,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46452544821140285,"acs":5467,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11769,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2995239220717831,"acs":8871,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29617,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41246928746928746,"acs":1343,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3256,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7410881801125704,"acs":395,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":533,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7232650739476678,"acs":2543,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3516,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8120995322143166,"acs":20659,"articleLive":2,"columnArticles":284,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25439,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.572561933986977,"acs":7650,"articleLive":2,"columnArticles":131,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13361,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5450500556173526,"acs":5390,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9889,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6639302206259621,"acs":5176,"articleLive":2,"columnArticles":81,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7796,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.603223117532648,"acs":2171,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3599,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44289802289282,"acs":6810,"articleLive":2,"columnArticles":129,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15376,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7582554148419931,"acs":12813,"articleLive":2,"columnArticles":235,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16898,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5262572593599407,"acs":4259,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8093,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4671849988566202,"acs":2043,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4373,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8508108108108108,"acs":38563,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45325,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35391410581712246,"acs":7532,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21282,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36388767641495706,"acs":2501,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6873,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43639102778707733,"acs":2607,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5974,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7640449438202247,"acs":816,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1068,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3899260987942435,"acs":2005,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5142,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8303784195977505,"acs":17423,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20982,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4970571346540339,"acs":6925,"articleLive":2,"columnArticles":110,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13932,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4648178451468435,"acs":5397,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11611,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38461538461538464,"acs":2375,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6175,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5207006369426752,"acs":327,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":628,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8955802532954251,"acs":3465,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3869,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8279749068810037,"acs":16894,"articleLive":2,"columnArticles":356,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20404,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5996747967479675,"acs":3688,"articleLive":2,"columnArticles":85,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6150,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47117615563091203,"acs":2640,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5603,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4026902059688945,"acs":958,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2379,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8055746870315602,"acs":19884,"articleLive":2,"columnArticles":265,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24683,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8670345318618725,"acs":14613,"articleLive":2,"columnArticles":190,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16854,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5187574671445639,"acs":4342,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8370,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4881478505423865,"acs":2430,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4978,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6498194945848376,"acs":180,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":277,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8002129169623847,"acs":2255,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2818,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6354089753056034,"acs":7745,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12189,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4614926262475793,"acs":6196,"articleLive":2,"columnArticles":131,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13426,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3981629138227977,"acs":6242,"articleLive":2,"columnArticles":112,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15677,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5257682071134769,"acs":2173,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4133,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5253093363329584,"acs":467,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":889,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7976566020730058,"acs":1770,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2219,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7108227448860053,"acs":7888,"articleLive":2,"columnArticles":181,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11097,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6098174952800504,"acs":3876,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6356,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47694805194805195,"acs":2938,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6160,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3844531485387165,"acs":1276,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3319,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7817782939734159,"acs":12116,"articleLive":2,"columnArticles":184,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15498,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34700066719233336,"acs":5721,"articleLive":2,"columnArticles":120,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16487,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5852829162132753,"acs":4303,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7352,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5031948881789138,"acs":14175,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28170,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6993268511593119,"acs":935,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1337,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.702516033547114,"acs":1424,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2027,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6939979531635663,"acs":11528,"articleLive":2,"columnArticles":184,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16611,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3590891188370511,"acs":30087,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83787,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2624822872384763,"acs":6298,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":23994,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4963971685236327,"acs":15638,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31503,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6380208333333334,"acs":245,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":384,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7294623655913979,"acs":1696,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2325,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6742529676627098,"acs":8236,"articleLive":2,"columnArticles":192,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12215,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4328446909667195,"acs":2185,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5048,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4892068273092369,"acs":1949,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3984,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.36829699469652327,"acs":625,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1697,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8693349799782942,"acs":46459,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53442,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6459985580389329,"acs":10752,"articleLive":2,"columnArticles":165,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16644,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5150625339858619,"acs":4736,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9195,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5064906730664339,"acs":23215,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45835,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5631229235880398,"acs":339,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":602,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7883217040029379,"acs":10733,"articleLive":2,"columnArticles":146,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13615,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.48004174276024003,"acs":5520,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11499,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5750251762336355,"acs":3426,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5958,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3578099838969404,"acs":1111,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3105,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6218487394957983,"acs":2146,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3451,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.531523642732049,"acs":607,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1142,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4717815344603381,"acs":1814,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3845,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7926796687149346,"acs":11868,"articleLive":2,"columnArticles":204,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":14972,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4584595413241021,"acs":2119,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4622,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232484735589362,"acs":27955,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38652,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48861480075901326,"acs":1030,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2108,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491626794258373,"acs":28538,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63536,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31056756523985873,"acs":3606,"articleLive":2,"columnArticles":103,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11611,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6540265832681783,"acs":28441,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43486,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4713386927647676,"acs":2697,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5722,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7015834348355664,"acs":576,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":821,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8402464065708419,"acs":2046,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2435,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7091077285341855,"acs":8432,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11891,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.69683286101336,"acs":22376,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32111,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36282992987988566,"acs":28304,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78009,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4842468709538196,"acs":3366,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6951,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5940525587828492,"acs":859,"articleLive":2,"columnArticles":36,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1446,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7033261802575107,"acs":1311,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1864,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7494077032424017,"acs":11071,"articleLive":2,"columnArticles":222,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14773,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5322486926205694,"acs":3664,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6884,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4571388420460933,"acs":3253,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7116,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4718858131487889,"acs":2182,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4624,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6808969383354895,"acs":9474,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13914,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.629481652823047,"acs":5987,"articleLive":2,"columnArticles":127,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9511,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42179951690821255,"acs":4191,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9936,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4011363636363636,"acs":2824,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7040,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7957894736842105,"acs":378,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":475,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9203754162882228,"acs":3040,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3303,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.637901861252115,"acs":7163,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11229,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42935848351853584,"acs":4598,"articleLive":2,"columnArticles":96,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10709,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5388493859082094,"acs":4168,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7735,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43023255813953487,"acs":2590,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6020,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6893704850361198,"acs":668,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":969,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6101973684210527,"acs":4081,"articleLive":2,"columnArticles":81,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6688,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4753427460609781,"acs":2323,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4887,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.551940116101436,"acs":3613,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6546,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37606837606837606,"acs":1408,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3744,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7885714285714286,"acs":828,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1050,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7655473472128945,"acs":11399,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14890,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.856219159435086,"acs":10064,"articleLive":2,"columnArticles":170,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11754,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3703271028037383,"acs":4121,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11128,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3655897114178168,"acs":2331,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6376,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5179640718562875,"acs":346,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":668,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8426145028132723,"acs":16024,"articleLive":2,"columnArticles":199,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19017,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5505659335603202,"acs":5983,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10867,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4743746525847693,"acs":4267,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8995,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46421052631578946,"acs":1764,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3800,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7827606290040768,"acs":5376,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6868,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5144508670520231,"acs":178,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":346,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6474207288215806,"acs":5472,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8452,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6647574945162077,"acs":5455,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8206,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5192380952380953,"acs":4089,"articleLive":2,"columnArticles":60,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7875,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.292498782269849,"acs":1201,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4106,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7989276139410187,"acs":1192,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1492,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.421324408319388,"acs":8812,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20915,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34967409760639756,"acs":6384,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18257,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3416055460665126,"acs":3400,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9953,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541879582315041,"acs":11778,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18004,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.717391304347826,"acs":231,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":322,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7106598984771574,"acs":1540,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2167,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6454019864604438,"acs":13061,"articleLive":2,"columnArticles":143,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20237,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8090783372651102,"acs":9946,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12293,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.513515625,"acs":6573,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12800,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4139104541103903,"acs":3892,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9403,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5793103448275863,"acs":168,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":290,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7864493996569468,"acs":1834,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2332,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4879674194742688,"acs":6590,"articleLive":2,"columnArticles":121,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13505,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5735143442622951,"acs":4478,"articleLive":2,"columnArticles":71,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7808,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5213399081788811,"acs":3066,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5881,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5185758513931888,"acs":2345,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4522,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6832560101223113,"acs":9720,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14226,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37892129884424874,"acs":4131,"articleLive":2,"columnArticles":109,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10902,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26250470101541934,"acs":4188,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15954,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40950357349816496,"acs":2120,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5177,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5708908406524467,"acs":455,"articleLive":2,"columnArticles":27,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":797,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4885430177258971,"acs":11300,"articleLive":2,"columnArticles":148,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23130,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.662690778504553,"acs":5167,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7797,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5858170606372045,"acs":5700,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9730,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26774335310920677,"acs":2437,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9102,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6270250368188512,"acs":1703,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2716,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6245733788395904,"acs":183,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":293,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6625097427903351,"acs":850,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1283,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7945164802533901,"acs":8027,"articleLive":2,"columnArticles":188,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10103,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5136538461538461,"acs":5342,"articleLive":2,"columnArticles":73,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10400,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34465359984475064,"acs":3552,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10306,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29899316792520675,"acs":1663,"articleLive":2,"columnArticles":38,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5562,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7528489511504681,"acs":10372,"articleLive":2,"columnArticles":153,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13777,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6983050847457627,"acs":5974,"articleLive":2,"columnArticles":96,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8555,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3737909970183987,"acs":25700,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68755,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.367792290538388,"acs":2309,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6278,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5024630541871922,"acs":102,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":203,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9018812246403541,"acs":2445,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2711,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.809949601690782,"acs":19928,"articleLive":2,"columnArticles":199,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24604,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7141516676618613,"acs":8372,"articleLive":2,"columnArticles":103,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11723,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6569658917359579,"acs":7743,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11786,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2862566438876234,"acs":2639,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9219,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4389438943894389,"acs":266,"articleLive":2,"columnArticles":21,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":606,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7949021932424422,"acs":9387,"articleLive":2,"columnArticles":138,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11809,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8678503202607034,"acs":7723,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8899,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.682687338501292,"acs":3963,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5805,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48722316865417375,"acs":858,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1761,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.739424703891709,"acs":874,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1182,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8243612006946167,"acs":13292,"articleLive":2,"columnArticles":211,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16124,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6845709259957281,"acs":43588,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63672,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3515316059729682,"acs":5956,"articleLive":2,"columnArticles":128,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16943,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5097901112832793,"acs":3619,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7099,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7068965517241379,"acs":410,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":580,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7960152782079075,"acs":7711,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9687,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4294236662798655,"acs":28865,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67218,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5753655294638901,"acs":6493,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11285,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3895175699821322,"acs":1962,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5037,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.514513375071144,"acs":904,"articleLive":2,"columnArticles":28,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1757,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6536312849162011,"acs":117,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":179,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5061124694376528,"acs":621,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1227,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8000937426763534,"acs":6828,"articleLive":2,"columnArticles":111,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8534,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5349107513491075,"acs":6443,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12045,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335749626049937,"acs":27532,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43455,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36135235732009924,"acs":2330,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6448,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6826167564227068,"acs":7732,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11327,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32825411709546976,"acs":5601,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17063,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6092307692307692,"acs":2376,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3900,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4012084592145015,"acs":1992,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4965,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7121212121212122,"acs":188,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":264,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6451211932877564,"acs":1038,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1609,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7891492820373882,"acs":11651,"articleLive":2,"columnArticles":121,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14764,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6814809994794377,"acs":10473,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15368,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35656987004652657,"acs":4445,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12466,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45115600916475734,"acs":2166,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4801,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6346516007532956,"acs":337,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":531,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7669619827296176,"acs":6839,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8917,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7715658021133526,"acs":4016,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5205,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6184087944848146,"acs":3319,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5367,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31262190025076625,"acs":2244,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7178,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9067778336807303,"acs":12616,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13913,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3873258187627585,"acs":4364,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11267,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5132846715328467,"acs":5274,"articleLive":2,"columnArticles":61,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10275,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5973570658036678,"acs":2215,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3708,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7424698795180723,"acs":493,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":664,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5454545454545454,"acs":156,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":286,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7883683360258481,"acs":12688,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16094,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4562097068483153,"acs":7501,"articleLive":2,"columnArticles":71,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16442,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2764423076923077,"acs":5980,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21632,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6209010113392583,"acs":2026,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3263,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8122529644268774,"acs":2055,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2530,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.891566265060241,"acs":296,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":332,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7490774907749077,"acs":406,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":542,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7279893281591074,"acs":6003,"articleLive":2,"columnArticles":93,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8246,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8203372806090082,"acs":31035,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37832,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.429029029029029,"acs":2143,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4995,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41269487750556794,"acs":1853,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4490,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7717686364585509,"acs":7392,"articleLive":2,"columnArticles":98,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9578,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35302068641278794,"acs":6007,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17016,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.278125,"acs":3649,"articleLive":2,"columnArticles":110,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13120,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3754325259515571,"acs":1736,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4624,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.688768115942029,"acs":1901,"articleLive":2,"columnArticles":37,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2760,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5268817204301075,"acs":245,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":465,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5716568993074055,"acs":5365,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9385,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6458622867972205,"acs":5112,"articleLive":2,"columnArticles":65,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7915,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3173529074435142,"acs":2767,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8719,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2702354909278085,"acs":2100,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7771,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7066766691672918,"acs":942,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1333,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4743150684931507,"acs":277,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":584,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.33661278988053406,"acs":479,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1423,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5916661950842246,"acs":31366,"articleLive":2,"columnArticles":409,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53013,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45820253602590405,"acs":37075,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":80914,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5310719834282756,"acs":2051,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3862,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5068903535050928,"acs":846,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1669,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5308788598574822,"acs":6258,"articleLive":2,"columnArticles":78,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11788,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3099321594633737,"acs":4066,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13119,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6288379983036472,"acs":3707,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5895,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43549511854951184,"acs":1249,"articleLive":2,"columnArticles":34,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2868,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6621863799283154,"acs":739,"articleLive":2,"columnArticles":27,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1116,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4482758620689655,"acs":78,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":174,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.64375,"acs":7416,"articleLive":2,"columnArticles":101,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11520,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2787799278451951,"acs":3400,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12196,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5701988360814743,"acs":4703,"articleLive":2,"columnArticles":93,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8248,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.423431105047749,"acs":2483,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5864,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5891089108910891,"acs":476,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":808,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6639676113360324,"acs":164,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":247,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32528679006263633,"acs":4622,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14209,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6752405625462621,"acs":3649,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5404,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5713780918727915,"acs":3234,"articleLive":2,"columnArticles":69,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5660,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.26932751970484653,"acs":1606,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":5963,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8377514182568334,"acs":8122,"articleLive":2,"columnArticles":83,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9695,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4408997955010225,"acs":3234,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7335,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3909691629955947,"acs":2840,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7264,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5517403574788335,"acs":1173,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2126,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28858350951374206,"acs":273,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":946,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4847328244274809,"acs":127,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":262,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.39317953861584753,"acs":392,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":997,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.915312307827462,"acs":10419,"articleLive":2,"columnArticles":91,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11383,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3439355120914828,"acs":5504,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16003,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36094397124326016,"acs":4619,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12797,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23679591511089837,"acs":1484,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6267,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.37579617834394907,"acs":59,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":157,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6961391099322134,"acs":4724,"articleLive":2,"columnArticles":58,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6786,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3442339136289314,"acs":3579,"articleLive":2,"columnArticles":60,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10397,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4128122109158187,"acs":1785,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4324,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3970797720797721,"acs":2230,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5616,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9146313970090929,"acs":12171,"articleLive":2,"columnArticles":106,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13307,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4795092665100496,"acs":5511,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11493,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5610225398570643,"acs":2041,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3638,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32740963855421684,"acs":1087,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3320,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5439698492462312,"acs":433,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":796,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7506775067750677,"acs":277,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":369,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7391832229580574,"acs":6697,"articleLive":2,"columnArticles":94,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9060,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4499598393574297,"acs":5602,"articleLive":2,"columnArticles":64,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12450,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24229583975346689,"acs":3145,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12980,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34400731930466605,"acs":1128,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3279,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6253687315634219,"acs":424,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":678,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7936842105263158,"acs":377,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":475,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7720013037809648,"acs":4737,"articleLive":2,"columnArticles":83,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6136,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39225912709305516,"acs":2858,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7286,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4074956672443674,"acs":1881,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4616,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.577692760447322,"acs":1963,"articleLive":2,"columnArticles":52,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3398,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6641859516770313,"acs":6515,"articleLive":2,"columnArticles":74,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9809,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30410426431919513,"acs":5320,"articleLive":2,"columnArticles":81,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17494,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5412099066179455,"acs":3999,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7389,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5163714439076758,"acs":962,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1863,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.535377358490566,"acs":227,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":424,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5523012552301255,"acs":132,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":239,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6674259681093394,"acs":293,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":439,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5454401394501228,"acs":6884,"articleLive":2,"columnArticles":79,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12621,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3252225974823457,"acs":4237,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13028,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4813306967546819,"acs":4138,"articleLive":2,"columnArticles":68,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8597,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4956954275875263,"acs":2591,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5227,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4437299035369775,"acs":138,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":311,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6045120956781734,"acs":4448,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7358,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42329303592712414,"acs":2486,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5873,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4124822695035461,"acs":1454,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3525,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2767494356659142,"acs":613,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2215,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.534858556191065,"acs":6920,"articleLive":2,"columnArticles":64,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12938,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4298688193743693,"acs":5538,"articleLive":2,"columnArticles":74,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12883,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6142857142857143,"acs":4386,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7140,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38289506021135417,"acs":3116,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8138,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7340425531914894,"acs":345,"articleLive":2,"columnArticles":12,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":470,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7241379310344828,"acs":42,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":58,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7777777777777778,"acs":6020,"articleLive":2,"columnArticles":56,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7740,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35752854057389694,"acs":4635,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12964,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27943153447282504,"acs":2910,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10414,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4795783926218709,"acs":2184,"articleLive":2,"columnArticles":49,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4554,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5563463819691578,"acs":469,"articleLive":2,"columnArticles":19,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":843,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4508816120906801,"acs":179,"articleLive":2,"columnArticles":7,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":397,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7409948542024014,"acs":3888,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5247,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3809144072301967,"acs":2866,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7524,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2887969258054981,"acs":1954,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6766,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2475515028706518,"acs":733,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2961,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.532051282051282,"acs":249,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":468,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8159420289855073,"acs":7319,"articleLive":2,"columnArticles":83,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":8970,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5811191626409018,"acs":5774,"articleLive":2,"columnArticles":92,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9936,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2987480021310602,"acs":4486,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15016,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.45546218487394957,"acs":813,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1785,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6621621621621622,"acs":49,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":74,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.580480847595762,"acs":5698,"articleLive":2,"columnArticles":63,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9816,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4118515238727769,"acs":5581,"articleLive":2,"columnArticles":79,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13551,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2755331523846452,"acs":3553,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12895,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.46055646481178397,"acs":1407,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3055,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6823529411764706,"acs":174,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":255,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.4431818181818182,"acs":39,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":88,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6028368794326241,"acs":170,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":282,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6622375328083989,"acs":4037,"articleLive":2,"columnArticles":56,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6096,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5934560327198364,"acs":2902,"articleLive":2,"columnArticles":56,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4890,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38378611470461405,"acs":1780,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4638,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.36316432498472817,"acs":1189,"articleLive":2,"columnArticles":35,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3274,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5511858300810567,"acs":5508,"articleLive":2,"columnArticles":46,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":9993,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2465653621981682,"acs":4738,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19216,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34083073386964374,"acs":2076,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6091,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.41832460732984295,"acs":1598,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3820,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6547619047619048,"acs":55,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":84,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7790573429894337,"acs":6562,"articleLive":2,"columnArticles":85,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8423,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.35767539667367615,"acs":5613,"articleLive":2,"columnArticles":124,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15693,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5704410796576695,"acs":3466,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6076,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39187473550571306,"acs":1852,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4726,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.4,"acs":78,"articleLive":2,"columnArticles":4,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":195,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.675,"acs":27,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":40,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8841631223417563,"acs":3534,"articleLive":2,"columnArticles":47,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":3997,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.2951942510666966,"acs":2629,"articleLive":2,"columnArticles":49,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":8906,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4193883919284377,"acs":2016,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4807,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41284699806326663,"acs":1279,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3098,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6419753086419753,"acs":52,"articleLive":2,"columnArticles":2,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":81,"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.9050197570613201,"acs":6184,"articleLive":2,"columnArticles":51,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":6833,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3544292717086835,"acs":4049,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11424,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32666181465308103,"acs":2693,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8244,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5198487712665406,"acs":1375,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2645,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8611111111111112,"acs":31,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":36,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5531446194514814,"acs":5022,"articleLive":2,"columnArticles":65,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9079,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34571009020348226,"acs":3296,"articleLive":2,"columnArticles":88,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9534,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.40984712230215825,"acs":1823,"articleLive":2,"columnArticles":48,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4448,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.3428273706147968,"acs":987,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2879,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8505747126436781,"acs":74,"articleLive":2,"columnArticles":3,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":87,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.8108108108108109,"acs":30,"articleLive":2,"columnArticles":4,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":37,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6600985221674877,"acs":2546,"articleLive":2,"columnArticles":30,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":3857,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7559748427672957,"acs":2404,"articleLive":2,"columnArticles":32,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3180,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.47310243183493,"acs":1926,"articleLive":2,"columnArticles":51,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4071,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.24696454589606606,"acs":1017,"articleLive":2,"columnArticles":37,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4118,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9024390243902439,"acs":111,"articleLive":2,"columnArticles":6,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":123,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.54207263064659,"acs":3672,"articleLive":2,"columnArticles":37,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":6774,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4168113067195636,"acs":3362,"articleLive":2,"columnArticles":46,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":8066,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.20916596864903675,"acs":1748,"articleLive":2,"columnArticles":64,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8357,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3359683794466403,"acs":935,"articleLive":2,"columnArticles":35,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":2783,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":1.0,"acs":6,"articleLive":2,"columnArticles":1,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":6,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.8451233867019448,"acs":81131,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":95999,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6906631541618117,"acs":13633,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19739,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21928475672265593,"acs":11123,"articleLive":2,"columnArticles":183,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50724,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37749890558879323,"acs":2587,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6853,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.20009756097560977,"acs":2051,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10250,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8398836918218405,"acs":43616,"articleLive":2,"columnArticles":659,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":51931,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7696344374519126,"acs":39012,"articleLive":2,"columnArticles":469,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50689,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2878787878787879,"acs":5054,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17556,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27508280575237937,"acs":6561,"articleLive":2,"columnArticles":106,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23851,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5885826771653543,"acs":1794,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3048,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6892746062004615,"acs":6870,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9967,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41052563772223655,"acs":6373,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15524,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6121153223194039,"acs":9448,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15435,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21066480922529215,"acs":2722,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12921,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5762483130904184,"acs":854,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1482,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3113496932515337,"acs":609,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1956,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7990929398226494,"acs":23610,"articleLive":2,"columnArticles":249,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29546,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28644908959442583,"acs":17431,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":60852,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163525644390782,"acs":19672,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38098,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3123571805238179,"acs":1777,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5689,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33540630182421227,"acs":809,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2412,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3335072290952452,"acs":8950,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26836,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3421500589236611,"acs":2613,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7637,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2817901234567901,"acs":913,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3240,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3325701202060675,"acs":1162,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3494,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.33454545454545453,"acs":552,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1650,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3281497100685293,"acs":1245,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3794,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2816631485390512,"acs":10141,"articleLive":2,"columnArticles":173,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36004,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1866676504224001,"acs":5060,"articleLive":2,"columnArticles":123,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27107,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34925988382986695,"acs":5592,"articleLive":2,"columnArticles":97,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16011,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2523158359064843,"acs":1716,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6801,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40566770186335405,"acs":1045,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2576,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21695700429474496,"acs":4496,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20723,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4825,"acs":2316,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4800,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3980649619903248,"acs":1152,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2894,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2610319076714189,"acs":769,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2946,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19365399143792494,"acs":769,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3971,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.56590084643289,"acs":468,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":827,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5027012425715829,"acs":3722,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7404,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23055139097118107,"acs":2768,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12006,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4156901041666667,"acs":1277,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3072,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.1987066431510876,"acs":1014,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5103,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.39568345323741005,"acs":385,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":973,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8548780487804878,"acs":2103,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2460,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18408051235132664,"acs":1006,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5465,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3656195462478185,"acs":838,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2292,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3516988062442608,"acs":766,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2178,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15115623237450648,"acs":268,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1773,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22240663900414936,"acs":268,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1205,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5449616503570484,"acs":4121,"articleLive":2,"columnArticles":94,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7562,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6971511147811725,"acs":3377,"articleLive":2,"columnArticles":68,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4844,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41290480863591755,"acs":1683,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4076,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6781286118241923,"acs":400734,"articleLive":2,"columnArticles":2791,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":590941,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4031883910339814,"acs":261231,"articleLive":2,"columnArticles":2085,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":647913,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.760841236323793,"acs":286090,"articleLive":2,"columnArticles":1938,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":376018,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7515371973157166,"acs":302263,"articleLive":2,"columnArticles":2083,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":402193,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6977254375647545,"acs":189235,"articleLive":2,"columnArticles":1448,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":271217,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7157279894660667,"acs":263083,"articleLive":2,"columnArticles":1665,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":367574,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600711208370375,"acs":263266,"articleLive":2,"columnArticles":1857,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":731150,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44367473985550054,"acs":195279,"articleLive":2,"columnArticles":1311,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":440140,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4930848669427823,"acs":261797,"articleLive":2,"columnArticles":1633,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":530937,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45219780074086446,"acs":170536,"articleLive":2,"columnArticles":1135,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":377127,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5265024712628287,"acs":176938,"articleLive":2,"columnArticles":1706,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":336063,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5692717104005827,"acs":157871,"articleLive":2,"columnArticles":1309,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":277321,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31201049278620946,"acs":83260,"articleLive":2,"columnArticles":490,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":266850,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7472147954266772,"acs":199265,"articleLive":2,"columnArticles":1252,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":266677,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3397283466292627,"acs":124009,"articleLive":2,"columnArticles":759,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":365024,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7771942520417657,"acs":150356,"articleLive":2,"columnArticles":1128,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":193460,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.59661010521126,"acs":188774,"articleLive":2,"columnArticles":1458,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":316411,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37663783844892884,"acs":66631,"articleLive":2,"columnArticles":445,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":176910,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24175640783424648,"acs":76777,"articleLive":2,"columnArticles":855,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":317580,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6430878735263946,"acs":193709,"articleLive":2,"columnArticles":1634,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":301217,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7979968090764049,"acs":261087,"articleLive":2,"columnArticles":2447,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":327178,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7428258176443804,"acs":292013,"articleLive":2,"columnArticles":1825,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":393111,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7286057408355318,"acs":185044,"articleLive":2,"columnArticles":1185,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":253970,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46549569697474574,"acs":145284,"articleLive":2,"columnArticles":1185,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":312106,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7918615857416438,"acs":191446,"articleLive":2,"columnArticles":1401,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":241767,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801339017769672,"acs":149819,"articleLive":2,"columnArticles":1084,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":258249,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.440165620182158,"acs":145322,"articleLive":2,"columnArticles":1481,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":330153,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5688486399844962,"acs":140893,"articleLive":2,"columnArticles":939,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":247681,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6155256323519783,"acs":112816,"articleLive":2,"columnArticles":945,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":183284,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6445804097142535,"acs":137061,"articleLive":2,"columnArticles":954,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":212636,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6866340729597593,"acs":136932,"articleLive":2,"columnArticles":1095,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":199425,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5889143110192634,"acs":119688,"articleLive":2,"columnArticles":1134,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":203235,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5512317168928837,"acs":113024,"articleLive":2,"columnArticles":952,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":205039,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5766834292533802,"acs":133369,"articleLive":2,"columnArticles":869,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":231269,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7201258809556824,"acs":119448,"articleLive":2,"columnArticles":828,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":165871,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6546161809455093,"acs":104336,"articleLive":2,"columnArticles":897,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":159385,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5610651574517487,"acs":77326,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":137820,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792363354959859,"acs":157934,"articleLive":2,"columnArticles":1115,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":272659,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6910553746195895,"acs":168263,"articleLive":2,"columnArticles":1025,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":243487,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5701241790742009,"acs":247325,"articleLive":2,"columnArticles":1813,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":433809,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5812826935828483,"acs":63118,"articleLive":2,"columnArticles":460,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":108584,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.605441712328393,"acs":221651,"articleLive":2,"columnArticles":1523,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":366098,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48572218219146984,"acs":49209,"articleLive":2,"columnArticles":510,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":101311,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41497676225772223,"acs":55538,"articleLive":2,"columnArticles":464,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":133834,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5611673436943517,"acs":108720,"articleLive":2,"columnArticles":806,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":193739,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5359885653860974,"acs":119623,"articleLive":2,"columnArticles":1439,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":223182,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889764464896043,"acs":118732,"articleLive":2,"columnArticles":991,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":172331,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46453139956847334,"acs":150923,"articleLive":2,"columnArticles":1038,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":324893,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513072089162912,"acs":87890,"articleLive":2,"columnArticles":518,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":134944,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6146713704730221,"acs":152803,"articleLive":2,"columnArticles":1055,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":248593,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4829097324651057,"acs":101822,"articleLive":2,"columnArticles":847,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":210851,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6496825231601957,"acs":174762,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":268996,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5380102011837008,"acs":189442,"articleLive":2,"columnArticles":1585,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":352116,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4472046871037916,"acs":167543,"articleLive":2,"columnArticles":1468,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":374645,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7565455529429329,"acs":162161,"articleLive":2,"columnArticles":1143,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":214344,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7899206944593291,"acs":176898,"articleLive":2,"columnArticles":1268,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":223944,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.588047311827957,"acs":136721,"articleLive":2,"columnArticles":939,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":232500,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6992071749752052,"acs":114914,"articleLive":2,"columnArticles":1028,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":164349,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8000977951635846,"acs":89995,"articleLive":2,"columnArticles":694,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":112480,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6660394827225756,"acs":133806,"articleLive":2,"columnArticles":840,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":200898,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7072848355447104,"acs":139130,"articleLive":2,"columnArticles":1859,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":196710,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4417323345664211,"acs":129322,"articleLive":2,"columnArticles":975,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":292761,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8577623954042831,"acs":204711,"articleLive":2,"columnArticles":1785,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":238657,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4442965972574911,"acs":131223,"articleLive":2,"columnArticles":1186,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":295350,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47513447629792294,"acs":94337,"articleLive":2,"columnArticles":1066,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":198548,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5613677243895931,"acs":65227,"articleLive":2,"columnArticles":591,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":116193,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4595586921565124,"acs":102886,"articleLive":2,"columnArticles":981,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":223880,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6555258732752144,"acs":109933,"articleLive":2,"columnArticles":765,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":167702,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6337678762525537,"acs":130290,"articleLive":2,"columnArticles":949,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":205580,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568347834758545,"acs":137474,"articleLive":2,"columnArticles":1298,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":160444,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5839395130902061,"acs":71285,"articleLive":2,"columnArticles":494,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":122076,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5976313367085279,"acs":72715,"articleLive":2,"columnArticles":526,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":121672,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28661058931512706,"acs":68385,"articleLive":2,"columnArticles":555,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":238599,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6938492742002051,"acs":117681,"articleLive":2,"columnArticles":688,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":169606,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.700542638444676,"acs":116964,"articleLive":2,"columnArticles":687,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":166962,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20259253633095348,"acs":8002,"articleLive":2,"columnArticles":107,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":39498,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5749727795924716,"acs":7393,"articleLive":2,"columnArticles":122,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":12858,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7830373077249936,"acs":9214,"articleLive":2,"columnArticles":139,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":11767,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6853172426403364,"acs":7496,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":10938,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7122610843843453,"acs":5478,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":7691,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6620481927710843,"acs":6594,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":9960,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4541803871175006,"acs":5655,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":12451,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.50738783916898,"acs":5666,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":11167,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5487386000236882,"acs":4633,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":8443,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4349265642244673,"acs":5123,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":11779,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5670928978585734,"acs":3681,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6491,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6638134592680047,"acs":4498,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":6776,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6570824524312896,"acs":3108,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":4730,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5066989737742303,"acs":3555,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7016,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.640391894900913,"acs":2876,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4491,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.49678075228736024,"acs":4398,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":8853,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5229139645482058,"acs":2419,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4626,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5305217831813577,"acs":4189,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":7896,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.47171839312105335,"acs":3511,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":7443,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.701098901098901,"acs":3509,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5005,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5351427992708122,"acs":5284,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":9874,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5224974721941354,"acs":6201,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":11868,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7049101412066753,"acs":4393,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6232,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7705737322582795,"acs":11564,"articleLive":2,"columnArticles":117,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":15007,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6026597469996756,"acs":3716,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6166,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6481072555205047,"acs":4109,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6340,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6049685781618225,"acs":6161,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":10184,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6246827411167513,"acs":1969,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3152,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29464532155672096,"acs":2135,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":7246,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5472837022132797,"acs":1904,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3479,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5627807992433199,"acs":2380,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4229,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6026634863844166,"acs":3032,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5031,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7967589466576638,"acs":2360,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":2962,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5819407008086254,"acs":2159,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":3710,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6882553455221568,"acs":2221,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3227,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5841584158415841,"acs":2419,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4141,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.44140431844404154,"acs":2678,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6067,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7778587035688274,"acs":3204,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4119,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5173706573356661,"acs":2070,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4001,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5773537951057652,"acs":1392,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2411,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7893429044726671,"acs":2859,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3622,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8460170697012802,"acs":2379,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2812,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6514886164623468,"acs":1488,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2284,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.646893974778141,"acs":2770,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4282,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8109869646182495,"acs":2613,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3222,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7261422787738577,"acs":2511,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3458,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6854607899255867,"acs":2395,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3494,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6710700132100397,"acs":1524,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2271,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7509533587562335,"acs":2560,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3409,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6155709342560554,"acs":1779,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":2890,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41486486486486485,"acs":1535,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3700,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7361829567111353,"acs":2704,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3673,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6302267002518892,"acs":2502,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":3970,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8449328449328449,"acs":2076,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2457,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8900160170848905,"acs":1667,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1873,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7319884726224783,"acs":2794,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":3817,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3574675324675325,"acs":1101,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3080,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5916114790286976,"acs":1072,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1812,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6235129461161651,"acs":1782,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":2858,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.678546224417784,"acs":1923,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":2834,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5356255178127589,"acs":1293,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2414,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7588264545002487,"acs":1526,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2011,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7207207207207207,"acs":1200,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1665,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6325611325611326,"acs":983,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1554,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.630117973629424,"acs":908,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1441,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6507402422611036,"acs":967,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1486,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6534653465346535,"acs":858,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1313,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5091779728651237,"acs":2552,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5012,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7245920412253077,"acs":2531,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3493,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.671071953010279,"acs":2285,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3405,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.49893162393162394,"acs":934,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1872,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42073994058871184,"acs":3116,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":7406,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5419593345656192,"acs":1466,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2705,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.547349459598559,"acs":2127,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":3886,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7116080236764222,"acs":2164,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3041,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6716568544995795,"acs":3993,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":5945,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5858453473132372,"acs":3576,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6104,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6319618095021596,"acs":2780,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4399,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8543848167539267,"acs":2611,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3056,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8047775947281713,"acs":1954,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2428,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7819810851169736,"acs":3142,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4018,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6382803943044907,"acs":2331,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3652,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8542908224076281,"acs":2867,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3356,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6778860348390906,"acs":2296,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3387,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8570994223168136,"acs":2819,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3289,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7626199415936588,"acs":1828,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2397,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6396581196581197,"acs":1871,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":2925,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7389872375463153,"acs":3590,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":4858,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6276041666666666,"acs":2169,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3456,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5245117576723795,"acs":1316,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2509,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7655565293602103,"acs":1747,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2282,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6761951700344998,"acs":1372,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2029,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5698458574181118,"acs":1183,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2076,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5844553243574051,"acs":955,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1634,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6623834719072814,"acs":5258,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":7938,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49503475670307845,"acs":997,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2014,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5406636304489265,"acs":831,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1537,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.776046304541407,"acs":1743,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2246,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6931687715269805,"acs":2415,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3484,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7434607645875252,"acs":1478,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":1988,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.481284774911482,"acs":1903,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":3954,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5931301402999516,"acs":1226,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2067,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4961626218626841,"acs":2392,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":4821,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5836642087351106,"acs":1029,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1763,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6948675884696508,"acs":2965,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4267,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5503527902501604,"acs":858,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1559,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5432098765432098,"acs":880,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1620,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5734966592427617,"acs":515,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":898,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6122194513715711,"acs":982,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1604,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8368794326241135,"acs":1416,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1692,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6923076923076923,"acs":495,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":715,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5609756097560976,"acs":989,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1763,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5884703196347032,"acs":1031,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1752,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.42413162705667273,"acs":464,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1094,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.28727634194831014,"acs":578,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2012,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.636150234741784,"acs":3523,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5538,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6334478808705613,"acs":553,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":873,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.697282099343955,"acs":744,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1067,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4579037800687285,"acs":2665,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":5820,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7200977259305401,"acs":89012,"articleLive":2,"columnArticles":1532,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":123611,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6480028086388294,"acs":57218,"articleLive":2,"columnArticles":1104,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":88299,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5791266237195057,"acs":43870,"articleLive":2,"columnArticles":486,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":75752,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5508338259757758,"acs":40066,"articleLive":2,"columnArticles":770,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":72737,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3324911205227242,"acs":32109,"articleLive":2,"columnArticles":553,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":96571,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47187882477124227,"acs":72868,"articleLive":2,"columnArticles":1168,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":154421,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7538091048024823,"acs":65108,"articleLive":2,"columnArticles":957,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":86372,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.621317929706584,"acs":43240,"articleLive":2,"columnArticles":484,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":69594,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5503274151083508,"acs":32608,"articleLive":2,"columnArticles":414,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":59252,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6827773627396845,"acs":63062,"articleLive":2,"columnArticles":686,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":92361,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7801195760703502,"acs":64849,"articleLive":2,"columnArticles":943,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83127,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8545888104681677,"acs":71318,"articleLive":2,"columnArticles":681,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83453,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6552416201845384,"acs":25139,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38366,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46671248393213954,"acs":36671,"articleLive":2,"columnArticles":520,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78573,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4833693250924616,"acs":38947,"articleLive":2,"columnArticles":503,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":80574,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6849149120276896,"acs":47492,"articleLive":2,"columnArticles":424,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":69340,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5320537954830615,"acs":27139,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51008,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5380108321024126,"acs":10927,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20310,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6135729779981407,"acs":25740,"articleLive":2,"columnArticles":293,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":41951,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38640722204031996,"acs":8261,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21379,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7124731841863315,"acs":23248,"articleLive":2,"columnArticles":339,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32630,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5431096340496242,"acs":14381,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26479,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5877135348226018,"acs":10734,"articleLive":2,"columnArticles":176,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18264,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.531616708214264,"acs":17487,"articleLive":2,"columnArticles":243,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":32894,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7901509243543282,"acs":34449,"articleLive":2,"columnArticles":420,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43598,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8059862478090872,"acs":23912,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29668,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5844575404714569,"acs":32926,"articleLive":2,"columnArticles":383,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56336,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35160869444521553,"acs":25332,"articleLive":2,"columnArticles":321,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72046,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5906401609277009,"acs":19966,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33804,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7170480598693603,"acs":16576,"articleLive":2,"columnArticles":176,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23117,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47610492274523897,"acs":6625,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13915,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7171192758253461,"acs":16161,"articleLive":2,"columnArticles":252,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22536,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48632497637445105,"acs":17497,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":35978,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5055798156234838,"acs":9378,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18549,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6899531868923299,"acs":7664,"articleLive":2,"columnArticles":123,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11108,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38668006315487297,"acs":10776,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":27868,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38671961173615704,"acs":5259,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13599,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5274044375597977,"acs":11576,"articleLive":2,"columnArticles":228,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":21949,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7035497083281619,"acs":11337,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16114,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5527969830295412,"acs":3518,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6364,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3631720750984772,"acs":42595,"articleLive":2,"columnArticles":472,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117286,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36109138257575757,"acs":12202,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33792,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6757644482677719,"acs":51846,"articleLive":2,"columnArticles":433,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76722,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8203143511570966,"acs":20772,"articleLive":2,"columnArticles":324,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25322,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6796398673195387,"acs":21514,"articleLive":2,"columnArticles":478,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31655,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6565422494413639,"acs":23799,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36249,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8131188588337949,"acs":21433,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26359,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7186079048618398,"acs":16436,"articleLive":2,"columnArticles":237,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22872,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8133413102004188,"acs":21752,"articleLive":2,"columnArticles":345,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26744,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5587197373820271,"acs":13616,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24370,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49472719603194226,"acs":34012,"articleLive":2,"columnArticles":325,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68749,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7609430686283469,"acs":16654,"articleLive":2,"columnArticles":296,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21886,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013597941933113,"acs":6821,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13605,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5338732484895231,"acs":4153,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7779,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5547593572389151,"acs":56515,"articleLive":2,"columnArticles":2372,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":101873,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7397146152860256,"acs":34629,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46814,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3955079891468194,"acs":13119,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33170,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.553259187066445,"acs":19301,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":34886,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4552112676056338,"acs":12928,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28400,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6255788613456824,"acs":4593,"articleLive":2,"columnArticles":84,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7342,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6670145230020001,"acs":7670,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11499,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8318113133171277,"acs":25322,"articleLive":2,"columnArticles":401,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30442,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7658445207617858,"acs":14718,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19218,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44240184757505774,"acs":9578,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21650,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4601179789689664,"acs":7176,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15596,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46433035906720116,"acs":10772,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23199,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4235243286360011,"acs":12743,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30088,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7330359151233411,"acs":19553,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26674,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37370753323485967,"acs":2277,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6093,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5508431272355646,"acs":2156,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3914,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6821104261947372,"acs":10291,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15087,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44103194103194104,"acs":50260,"articleLive":2,"columnArticles":581,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":113960,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43120473996050035,"acs":1965,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4557,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5488929889298892,"acs":3570,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6504,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5033254424529365,"acs":8930,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17742,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4534374810041943,"acs":14919,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32902,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6003898635477583,"acs":34496,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57456,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3439668072371106,"acs":15171,"articleLive":2,"columnArticles":313,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44106,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.611521817526145,"acs":20349,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33276,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7214350069620772,"acs":8808,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12209,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46494482960648376,"acs":9523,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20482,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5834403080872914,"acs":2727,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4674,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47150168409080967,"acs":10779,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22861,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5454436450839328,"acs":31843,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58380,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3877431544213524,"acs":14571,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37579,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5967702590623019,"acs":12232,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20497,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6448091231485988,"acs":27819,"articleLive":2,"columnArticles":453,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":43143,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.387362442314519,"acs":5456,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14085,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4503617945007236,"acs":4668,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10365,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4117841774246938,"acs":8708,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21147,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.271533802586348,"acs":8294,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30545,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5495862907336967,"acs":14015,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25501,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5707522985952079,"acs":66794,"articleLive":2,"columnArticles":927,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117028,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6867050921735817,"acs":14416,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20993,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.631514967330193,"acs":20780,"articleLive":2,"columnArticles":289,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":32905,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5526173772261198,"acs":24576,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44472,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5971191178754465,"acs":76897,"articleLive":2,"columnArticles":759,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":128780,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40229885057471265,"acs":5845,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14529,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184284377923293,"acs":60962,"articleLive":2,"columnArticles":1137,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117590,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44519818355104557,"acs":7941,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17837,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.445305237062287,"acs":7185,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16135,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.57915602741567,"acs":8619,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14882,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5704060765410459,"acs":3905,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6846,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6360313091346981,"acs":44367,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69756,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3748351133994298,"acs":8809,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23501,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37868385800401877,"acs":4523,"articleLive":2,"columnArticles":100,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11944,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5232518586908985,"acs":10768,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20579,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5038486209108403,"acs":1571,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3118,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3419694262457812,"acs":3445,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10074,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.3526394025088826,"acs":19453,"articleLive":2,"columnArticles":237,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":55164,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.5207755026639747,"acs":2559722,"articleLive":2,"columnArticles":14383,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4915212,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40918663397525673,"acs":1019689,"articleLive":2,"columnArticles":7245,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2491990,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.381000509717602,"acs":1265473,"articleLive":2,"columnArticles":7556,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3321447,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40880286422438716,"acs":523181,"articleLive":2,"columnArticles":3885,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1279788,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3553228147394037,"acs":751097,"articleLive":2,"columnArticles":4061,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2113844,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5072361936387317,"acs":308252,"articleLive":2,"columnArticles":2501,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":607709,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35251365150774217,"acs":848457,"articleLive":2,"columnArticles":5335,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2406877,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21722044797309575,"acs":352665,"articleLive":2,"columnArticles":2710,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1623535,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5837505431317537,"acs":781907,"articleLive":2,"columnArticles":4976,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1339454,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31615551821137616,"acs":207699,"articleLive":2,"columnArticles":1251,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":656952,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6273790153446202,"acs":544437,"articleLive":2,"columnArticles":3092,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":867796,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.664778818341795,"acs":230062,"articleLive":2,"columnArticles":1798,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":346073,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6319342866353873,"acs":474364,"articleLive":2,"columnArticles":3932,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":750654,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4099967182915439,"acs":633415,"articleLive":2,"columnArticles":3950,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1544927,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3366224200801687,"acs":669645,"articleLive":2,"columnArticles":3161,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1989306,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4590313499235368,"acs":264145,"articleLive":2,"columnArticles":1450,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":575440,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5731341053418005,"acs":345213,"articleLive":2,"columnArticles":3112,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":602325,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39859133206518943,"acs":224837,"articleLive":2,"columnArticles":1545,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":564079,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4296694399804715,"acs":528053,"articleLive":2,"columnArticles":3948,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1228975,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4450186384608542,"acs":795441,"articleLive":2,"columnArticles":5640,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1787433,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.667420984793681,"acs":727011,"articleLive":2,"columnArticles":3524,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1089284,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7727626021083078,"acs":356929,"articleLive":2,"columnArticles":2682,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":461887,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5599845057223953,"acs":331055,"articleLive":2,"columnArticles":2135,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":591186,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7030993321856756,"acs":321431,"articleLive":2,"columnArticles":2551,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":457163,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6577192139946473,"acs":234200,"articleLive":2,"columnArticles":2223,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":356079,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.538965857759265,"acs":825776,"articleLive":2,"columnArticles":4597,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1532149,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.597156039726166,"acs":489616,"articleLive":2,"columnArticles":4141,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":819913,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4057206575229509,"acs":476284,"articleLive":2,"columnArticles":3269,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1173921,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20774871528379238,"acs":111538,"articleLive":2,"columnArticles":905,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":536889,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35893074442855494,"acs":80819,"articleLive":2,"columnArticles":601,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":225166,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3731612656468503,"acs":218546,"articleLive":2,"columnArticles":1761,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":585661,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3567537275725533,"acs":194165,"articleLive":2,"columnArticles":1311,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":544255,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42775952391893757,"acs":372339,"articleLive":2,"columnArticles":2456,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":870440,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4234916679493908,"acs":349409,"articleLive":2,"columnArticles":3353,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":825067,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46308194621140003,"acs":520518,"articleLive":2,"columnArticles":4005,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1124030,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6402022787343945,"acs":206608,"articleLive":2,"columnArticles":1464,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":322723,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706565273160389,"acs":102479,"articleLive":2,"columnArticles":868,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":152804,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5804773447697185,"acs":217917,"articleLive":2,"columnArticles":2289,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":375410,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277143411340156,"acs":341405,"articleLive":2,"columnArticles":1990,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":469147,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6224226016598018,"acs":203699,"articleLive":2,"columnArticles":1417,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":327268,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41977149156874044,"acs":167535,"articleLive":2,"columnArticles":1431,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":399110,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5818786791136203,"acs":331043,"articleLive":2,"columnArticles":2470,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":568921,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.448999565311323,"acs":172498,"articleLive":2,"columnArticles":1166,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":384183,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32830481875807743,"acs":85354,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":259984,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4301275178264717,"acs":206601,"articleLive":2,"columnArticles":1653,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":480325,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7830846243441495,"acs":428944,"articleLive":2,"columnArticles":2744,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":547762,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6380760263026906,"acs":219204,"articleLive":2,"columnArticles":1509,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":343539,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352413979316649,"acs":226011,"articleLive":2,"columnArticles":1904,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":307397,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6652547725110103,"acs":237003,"articleLive":2,"columnArticles":1342,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":356259,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37621086602750203,"acs":219390,"articleLive":2,"columnArticles":1300,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":583157,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7387807204445478,"acs":155684,"articleLive":2,"columnArticles":1557,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":210731,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8228366841090609,"acs":74693,"articleLive":2,"columnArticles":616,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90775,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.552777162737951,"acs":696544,"articleLive":2,"columnArticles":3845,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1260081,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4814406099518459,"acs":191960,"articleLive":2,"columnArticles":2028,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":398720,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4326794672473008,"acs":331458,"articleLive":2,"columnArticles":2544,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":766059,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46966426968631086,"acs":306842,"articleLive":2,"columnArticles":2354,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":653322,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41139291180972565,"acs":87349,"articleLive":2,"columnArticles":937,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":212325,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3765499832110136,"acs":251198,"articleLive":2,"columnArticles":2699,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":667104,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7897819322259786,"acs":129187,"articleLive":2,"columnArticles":1596,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":163573,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5243692726727143,"acs":90869,"articleLive":2,"columnArticles":965,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173292,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4175799545869676,"acs":199351,"articleLive":2,"columnArticles":2026,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":477396,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6623488612255669,"acs":318764,"articleLive":2,"columnArticles":2459,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":481263,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3919843908570167,"acs":184627,"articleLive":2,"columnArticles":1740,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":471006,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883006732281377,"acs":272671,"articleLive":2,"columnArticles":2110,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":396151,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2696107454230952,"acs":46448,"articleLive":2,"columnArticles":644,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":172278,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4573298628434554,"acs":354743,"articleLive":2,"columnArticles":3208,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":775683,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5428610059491618,"acs":196735,"articleLive":2,"columnArticles":1798,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":362404,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5243732301954555,"acs":37962,"articleLive":2,"columnArticles":576,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72395,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3920193726467259,"acs":392411,"articleLive":2,"columnArticles":1972,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1000999,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.530200623030325,"acs":583788,"articleLive":2,"columnArticles":3640,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1101070,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42157145711684907,"acs":94940,"articleLive":2,"columnArticles":836,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":225205,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142637010395253,"acs":178986,"articleLive":2,"columnArticles":1250,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":291383,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6044787506170624,"acs":134696,"articleLive":2,"columnArticles":991,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":222830,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46132317708613113,"acs":171758,"articleLive":2,"columnArticles":1722,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":372316,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5964045943717637,"acs":273436,"articleLive":2,"columnArticles":1892,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":458474,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42714859255562865,"acs":188317,"articleLive":2,"columnArticles":1286,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":440870,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700179477764318,"acs":224384,"articleLive":2,"columnArticles":1322,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":291401,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015657279547679,"acs":316996,"articleLive":2,"columnArticles":2074,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":395471,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45867256583679367,"acs":227658,"articleLive":2,"columnArticles":1434,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":496341,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6167577203030353,"acs":149470,"articleLive":2,"columnArticles":1338,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":242348,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4147987474828969,"acs":125448,"articleLive":2,"columnArticles":1002,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":302431,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5308747584196686,"acs":184316,"articleLive":2,"columnArticles":1706,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":347193,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385532191661414,"acs":321275,"articleLive":2,"columnArticles":1968,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":596552,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4335393059945766,"acs":185296,"articleLive":2,"columnArticles":1170,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":427403,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5159986421912943,"acs":98806,"articleLive":2,"columnArticles":697,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":191485,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6325630318063361,"acs":120879,"articleLive":2,"columnArticles":1113,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":191094,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48708328493437103,"acs":41933,"articleLive":2,"columnArticles":313,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86090,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5173275430683806,"acs":472453,"articleLive":2,"columnArticles":3307,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":913257,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7100757051083036,"acs":59466,"articleLive":2,"columnArticles":483,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":83746,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337231933518608,"acs":140011,"articleLive":2,"columnArticles":1234,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":220934,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30945614986258857,"acs":165525,"articleLive":2,"columnArticles":1535,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":534890,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5488204054537098,"acs":214951,"articleLive":2,"columnArticles":2051,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":391660,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5408149451739542,"acs":155805,"articleLive":2,"columnArticles":1349,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":288093,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556899891845636,"acs":572247,"articleLive":2,"columnArticles":2344,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":757251,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7023495622685906,"acs":101486,"articleLive":2,"columnArticles":635,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":144495,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6995967315366094,"acs":165328,"articleLive":2,"columnArticles":1309,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":236319,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4558499623149591,"acs":62296,"articleLive":2,"columnArticles":549,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":136659,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.350258519540467,"acs":353145,"articleLive":2,"columnArticles":1962,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1008241,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6116485969927101,"acs":72325,"articleLive":2,"columnArticles":595,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":118246,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6020829019736639,"acs":252985,"articleLive":2,"columnArticles":1904,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":420183,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5638954387908843,"acs":417308,"articleLive":2,"columnArticles":2289,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":740045,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420646644211974,"acs":403363,"articleLive":2,"columnArticles":2535,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":628228,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718521786806905,"acs":176266,"articleLive":2,"columnArticles":1603,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":308237,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661771464904179,"acs":521772,"articleLive":2,"columnArticles":2587,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":681007,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7046641530512499,"acs":252305,"articleLive":2,"columnArticles":1449,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":358050,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.721574835152494,"acs":134928,"articleLive":2,"columnArticles":897,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":186991,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6974421953078682,"acs":164694,"articleLive":2,"columnArticles":1321,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":236140,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7602895326429254,"acs":194108,"articleLive":2,"columnArticles":1203,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":255308,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.763030166663988,"acs":94953,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124442,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5635916391180987,"acs":259818,"articleLive":2,"columnArticles":1485,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":461004,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4865408128418322,"acs":274970,"articleLive":2,"columnArticles":1812,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":565153,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5262748360952535,"acs":273244,"articleLive":2,"columnArticles":1712,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":519204,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6276952166697145,"acs":181918,"articleLive":2,"columnArticles":1281,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":289819,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7260527981231634,"acs":180117,"articleLive":2,"columnArticles":1351,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":248077,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5220841180163214,"acs":62376,"articleLive":2,"columnArticles":686,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":119475,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7045595519949678,"acs":161292,"articleLive":2,"columnArticles":1235,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":228926,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6146344748627808,"acs":91264,"articleLive":2,"columnArticles":778,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":148485,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7310082849875491,"acs":218994,"articleLive":2,"columnArticles":1762,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":299578,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6676423253502569,"acs":146440,"articleLive":2,"columnArticles":1218,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":219339,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6815266715622588,"acs":180976,"articleLive":2,"columnArticles":1595,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":265545,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5735334133251668,"acs":571202,"articleLive":2,"columnArticles":3429,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":995935,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6896515683033,"acs":468481,"articleLive":2,"columnArticles":2677,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":679301,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5367568986051394,"acs":132952,"articleLive":2,"columnArticles":826,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":247695,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4449310780383327,"acs":162035,"articleLive":2,"columnArticles":1104,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":364180,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4729983449456798,"acs":280646,"articleLive":2,"columnArticles":1851,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":593334,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39603792932122583,"acs":37464,"articleLive":2,"columnArticles":330,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94597,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46853660189277296,"acs":124463,"articleLive":2,"columnArticles":658,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":265642,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5432885727435246,"acs":173528,"articleLive":2,"columnArticles":1129,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":319403,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6825364905401102,"acs":122187,"articleLive":2,"columnArticles":1127,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":179019,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44527919681892275,"acs":130571,"articleLive":2,"columnArticles":1188,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":293234,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230185092225699,"acs":135391,"articleLive":2,"columnArticles":881,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":187258,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49230754038788166,"acs":49855,"articleLive":2,"columnArticles":440,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101268,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6760060380692905,"acs":73444,"articleLive":2,"columnArticles":528,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":108644,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.576179683604551,"acs":127111,"articleLive":2,"columnArticles":983,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":220610,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4860360556143121,"acs":100643,"articleLive":2,"columnArticles":806,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":207069,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192724199157037,"acs":507182,"articleLive":2,"columnArticles":2297,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":705132,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197354745938865,"acs":101107,"articleLive":2,"columnArticles":760,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":140478,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6614562388171047,"acs":113492,"articleLive":2,"columnArticles":860,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":171579,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5156779006407319,"acs":196941,"articleLive":2,"columnArticles":1221,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":381907,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4902946273830156,"acs":53751,"articleLive":2,"columnArticles":547,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109630,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5125045527441368,"acs":537524,"articleLive":2,"columnArticles":2767,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1048818,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5528869156188762,"acs":301607,"articleLive":2,"columnArticles":1759,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":545513,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6211315524799931,"acs":129073,"articleLive":2,"columnArticles":1090,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":207803,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7038714853505922,"acs":419361,"articleLive":2,"columnArticles":1862,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":595792,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7506431472567651,"acs":305499,"articleLive":2,"columnArticles":1572,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":406983,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5261402222522477,"acs":237536,"articleLive":2,"columnArticles":1398,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":451469,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6817277635691958,"acs":100758,"articleLive":2,"columnArticles":790,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":147798,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671223620244136,"acs":213251,"articleLive":2,"columnArticles":1260,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":319658,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3415906033472682,"acs":47229,"articleLive":2,"columnArticles":516,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138262,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5354891947809656,"acs":134328,"articleLive":2,"columnArticles":1059,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":250851,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48400615516425044,"acs":171737,"articleLive":2,"columnArticles":1438,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":354824,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42142310151102036,"acs":186556,"articleLive":2,"columnArticles":1253,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":442681,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5669850561091803,"acs":213873,"articleLive":2,"columnArticles":1517,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":377211,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5317145665714725,"acs":114132,"articleLive":2,"columnArticles":900,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":214649,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5734428435828165,"acs":290587,"articleLive":2,"columnArticles":1612,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":506741,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7243533537921965,"acs":6609,"articleLive":2,"columnArticles":114,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9124,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5336922041718735,"acs":5552,"articleLive":2,"columnArticles":82,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10403,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5918580375782881,"acs":2835,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4790,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5469422617014007,"acs":16009,"articleLive":2,"columnArticles":193,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29270,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6145319729783932,"acs":340133,"articleLive":2,"columnArticles":1992,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":553483,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33635085252241165,"acs":7654,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22756,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49726702371843917,"acs":162482,"articleLive":2,"columnArticles":1103,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":326750,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3263771781899944,"acs":9290,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28464,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6100437219040581,"acs":59439,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97434,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192420734413801,"acs":86567,"articleLive":2,"columnArticles":925,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":166718,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3310326095639809,"acs":41438,"articleLive":2,"columnArticles":376,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":125178,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5867949900183441,"acs":297170,"articleLive":2,"columnArticles":1946,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":506429,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43242430880682253,"acs":84881,"articleLive":2,"columnArticles":756,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":196291,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6647393545145278,"acs":391582,"articleLive":2,"columnArticles":2213,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":589076,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41866846387137147,"acs":8697,"articleLive":2,"columnArticles":87,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20773,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7181706797357766,"acs":107852,"articleLive":2,"columnArticles":919,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":150176,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4400850238949773,"acs":91719,"articleLive":2,"columnArticles":597,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":208412,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8045828112722716,"acs":75774,"articleLive":2,"columnArticles":633,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94178,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4805467665486925,"acs":38425,"articleLive":2,"columnArticles":408,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":79961,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7395358355201387,"acs":307181,"articleLive":2,"columnArticles":1474,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":415370,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3558945978310745,"acs":254402,"articleLive":2,"columnArticles":1023,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":714824,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46300785104466086,"acs":129507,"articleLive":2,"columnArticles":501,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":279708,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6034788444586906,"acs":120493,"articleLive":2,"columnArticles":674,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":199664,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40962898680864324,"acs":122255,"articleLive":2,"columnArticles":971,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":298453,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4868919650452401,"acs":88144,"articleLive":2,"columnArticles":515,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":181034,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7018265577588332,"acs":165144,"articleLive":2,"columnArticles":679,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":235306,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967105837186982,"acs":182622,"articleLive":2,"columnArticles":589,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":229220,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6768840767287626,"acs":151664,"articleLive":2,"columnArticles":545,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":224062,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4768548197410839,"acs":103395,"articleLive":2,"columnArticles":678,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":216827,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4965602937807613,"acs":71531,"articleLive":2,"columnArticles":632,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":144053,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7565672526170255,"acs":7661,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10126,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5211619021966416,"acs":73525,"articleLive":2,"columnArticles":540,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":141079,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3925621264412556,"acs":90769,"articleLive":2,"columnArticles":700,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":231222,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4504329233768282,"acs":348445,"articleLive":2,"columnArticles":1732,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":773578,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6985528227561933,"acs":133177,"articleLive":2,"columnArticles":836,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":190647,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7492207225460553,"acs":192286,"articleLive":2,"columnArticles":1210,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":256648,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3561431554221584,"acs":21833,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61304,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.325107016564303,"acs":26202,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80595,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34500133475707423,"acs":10339,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29968,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43637229289254587,"acs":35745,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":81914,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653130331553716,"acs":102560,"articleLive":2,"columnArticles":393,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":154153,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5336706191175976,"acs":95146,"articleLive":2,"columnArticles":507,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":178286,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5157931664611526,"acs":394034,"articleLive":2,"columnArticles":2714,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":763938,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6524480678416422,"acs":143412,"articleLive":2,"columnArticles":1603,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":219806,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5573656868854152,"acs":334532,"articleLive":2,"columnArticles":2140,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":600202,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5244113301266937,"acs":50043,"articleLive":2,"columnArticles":327,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95427,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6193732830536949,"acs":171803,"articleLive":2,"columnArticles":1398,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":277382,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5164435904714076,"acs":236526,"articleLive":2,"columnArticles":1682,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":457990,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3778760452030156,"acs":169966,"articleLive":2,"columnArticles":736,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":449793,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5007376627004566,"acs":114720,"articleLive":2,"columnArticles":882,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":229102,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.723311564320213,"acs":721240,"articleLive":2,"columnArticles":7405,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":997136,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5432784113637907,"acs":143959,"articleLive":2,"columnArticles":946,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":264982,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7168131166854843,"acs":146022,"articleLive":2,"columnArticles":987,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":203710,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4729984537770141,"acs":197921,"articleLive":2,"columnArticles":1402,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":418439,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5426229017683493,"acs":90675,"articleLive":2,"columnArticles":680,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":167105,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48260243958272014,"acs":29515,"articleLive":2,"columnArticles":328,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61158,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46278841579448143,"acs":62258,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":134528,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4332019362874128,"acs":168691,"articleLive":2,"columnArticles":1551,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":389405,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37148086087442217,"acs":31259,"articleLive":2,"columnArticles":307,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84147,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6462878305653608,"acs":446740,"articleLive":2,"columnArticles":2328,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":691240,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7368766117400236,"acs":101154,"articleLive":2,"columnArticles":1044,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":137274,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5578976016125824,"acs":373089,"articleLive":2,"columnArticles":1741,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":668741,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5421692940370116,"acs":31641,"articleLive":2,"columnArticles":281,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58360,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4249087449149742,"acs":111867,"articleLive":2,"columnArticles":897,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":263273,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2865643816735215,"acs":64867,"articleLive":2,"columnArticles":422,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":226361,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4769089907798136,"acs":141156,"articleLive":2,"columnArticles":1002,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":295981,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7818629239269582,"acs":117876,"articleLive":2,"columnArticles":884,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":150763,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5231045879924525,"acs":41308,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":78967,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41793321031706765,"acs":71798,"articleLive":2,"columnArticles":660,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":171793,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6753990489907858,"acs":136925,"articleLive":2,"columnArticles":4760,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":202732,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7880043365178576,"acs":309640,"articleLive":2,"columnArticles":1880,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":392942,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4374142652563877,"acs":87052,"articleLive":2,"columnArticles":704,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":199015,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5798924427972929,"acs":57581,"articleLive":2,"columnArticles":650,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99296,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46427322240543645,"acs":37166,"articleLive":2,"columnArticles":319,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80052,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7418951756554845,"acs":139526,"articleLive":2,"columnArticles":881,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":188067,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5045332587705469,"acs":169615,"articleLive":2,"columnArticles":1224,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":336182,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6908735939575955,"acs":161719,"articleLive":2,"columnArticles":1283,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":234079,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4770713015671734,"acs":34612,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72551,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49698876532270675,"acs":314658,"articleLive":2,"columnArticles":2013,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":633129,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660430887207118,"acs":172320,"articleLive":2,"columnArticles":988,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":258722,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6808460817983141,"acs":261690,"articleLive":2,"columnArticles":1407,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":384360,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.848189106883526,"acs":210842,"articleLive":2,"columnArticles":1017,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":248579,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7233579503259345,"acs":140262,"articleLive":2,"columnArticles":883,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":193904,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49683027103847327,"acs":195771,"articleLive":2,"columnArticles":1339,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":394040,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47843932738311745,"acs":170999,"articleLive":2,"columnArticles":774,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":357410,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7381265425691417,"acs":32000,"articleLive":2,"columnArticles":288,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43353,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6456623501618689,"acs":295171,"articleLive":2,"columnArticles":1707,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":457160,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6562913907284769,"acs":8919,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13590,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5512402088772846,"acs":5067,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9192,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.601019143368682,"acs":4364,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7261,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4754621298871258,"acs":5813,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12226,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5250402252614642,"acs":5221,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9944,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4641106442577031,"acs":2651,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5712,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6380139982502188,"acs":5834,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9144,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6349654296599407,"acs":4500,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7087,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5437527856187788,"acs":3660,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6731,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5643513789581205,"acs":12155,"articleLive":2,"columnArticles":158,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21538,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5010675495869047,"acs":32386,"articleLive":2,"columnArticles":349,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":64634,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5697189284145806,"acs":5189,"articleLive":2,"columnArticles":75,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9108,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47488667271078877,"acs":5238,"articleLive":2,"columnArticles":61,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11030,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6407566451051802,"acs":11788,"articleLive":2,"columnArticles":186,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18397,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6827855290542495,"acs":144022,"articleLive":2,"columnArticles":1068,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":210933,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6921573953194957,"acs":78998,"articleLive":2,"columnArticles":656,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114133,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5655724706628608,"acs":7133,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12612,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7231839151690422,"acs":52514,"articleLive":2,"columnArticles":447,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72615,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49431654261150537,"acs":8567,"articleLive":2,"columnArticles":118,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17331,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43452474734970403,"acs":38611,"articleLive":2,"columnArticles":376,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":88858,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152428617445276,"acs":107170,"articleLive":2,"columnArticles":837,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":207999,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5800305929981138,"acs":100865,"articleLive":2,"columnArticles":615,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":173896,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5895305003427005,"acs":6881,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11672,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.673858755369094,"acs":6746,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10011,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44759059618132224,"acs":3446,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7699,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6256717711053623,"acs":153095,"articleLive":2,"columnArticles":1108,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":244689,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33844860206012195,"acs":6440,"articleLive":2,"columnArticles":107,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19028,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5535644064940172,"acs":9854,"articleLive":2,"columnArticles":139,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17801,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5532889258950874,"acs":2658,"articleLive":2,"columnArticles":45,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4804,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6476742013824024,"acs":3467,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5353,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.440052259829339,"acs":53891,"articleLive":2,"columnArticles":563,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122465,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.462037238281533,"acs":51020,"articleLive":2,"columnArticles":416,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110424,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4919393897460735,"acs":7110,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14453,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5701868089973313,"acs":7478,"articleLive":2,"columnArticles":84,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13115,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4533422679813824,"acs":187399,"articleLive":2,"columnArticles":1065,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":413372,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6322188262362023,"acs":204990,"articleLive":2,"columnArticles":1203,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":324239,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6850078778329899,"acs":5652,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8251,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7584583701088555,"acs":2578,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3399,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3915602501445163,"acs":7451,"articleLive":2,"columnArticles":80,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":19029,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6389843444352516,"acs":498149,"articleLive":2,"columnArticles":3404,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":779595,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7714991556695228,"acs":24671,"articleLive":2,"columnArticles":205,"formTitle":"[284]顶端迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":31978,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6347093114857413,"acs":8057,"articleLive":2,"columnArticles":103,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12694,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.509589161608164,"acs":11585,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22734,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6595741570487753,"acs":180474,"articleLive":2,"columnArticles":1231,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":273622,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43191044408906387,"acs":3511,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8129,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533106960950764,"acs":53244,"articleLive":2,"columnArticles":830,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70680,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45664635250105595,"acs":83248,"articleLive":2,"columnArticles":1108,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":182303,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5315635451505016,"acs":2543,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4784,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7083253788881841,"acs":115020,"articleLive":2,"columnArticles":766,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162383,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7116432463435618,"acs":4963,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6974,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5810616929698709,"acs":3645,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6273,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.523285248348938,"acs":64497,"articleLive":2,"columnArticles":505,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123254,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6201647117544298,"acs":2485,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4007,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.560380584491657,"acs":106191,"articleLive":2,"columnArticles":761,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":189498,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5777595884003742,"acs":4941,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8552,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5044921325634111,"acs":30491,"articleLive":2,"columnArticles":362,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60439,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.516730136272562,"acs":365955,"articleLive":2,"columnArticles":2030,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":708213,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5236452042977021,"acs":33385,"articleLive":2,"columnArticles":235,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":63755,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6563719115734721,"acs":2019,"articleLive":2,"columnArticles":38,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3076,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7264101330409193,"acs":129840,"articleLive":2,"columnArticles":797,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":178742,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5468698984413933,"acs":63648,"articleLive":2,"columnArticles":568,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116386,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.38336875664187037,"acs":4329,"articleLive":2,"columnArticles":64,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11292,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3373431690294872,"acs":16966,"articleLive":2,"columnArticles":251,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50293,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5400381208655679,"acs":24083,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44595,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6104525862068966,"acs":2266,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3712,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.608549271992897,"acs":118574,"articleLive":2,"columnArticles":944,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":194847,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37949168908200565,"acs":22009,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":57996,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7611241217798594,"acs":3575,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4697,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6830726937313865,"acs":56652,"articleLive":2,"columnArticles":382,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":82937,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6296478548362294,"acs":40946,"articleLive":2,"columnArticles":355,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65030,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5461465271170314,"acs":4592,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8408,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41823206698840903,"acs":50696,"articleLive":2,"columnArticles":480,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121215,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47647616040416796,"acs":67905,"articleLive":2,"columnArticles":538,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":142515,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48338572070049396,"acs":4306,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8908,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.685113279535402,"acs":20291,"articleLive":2,"columnArticles":180,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29617,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5185235049927073,"acs":23108,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44565,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6770667273969483,"acs":2973,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4391,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4243670785553191,"acs":26719,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62962,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4449241663050733,"acs":308639,"articleLive":2,"columnArticles":1829,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":693689,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6320934806501995,"acs":10927,"articleLive":2,"columnArticles":150,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17287,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784314308657764,"acs":25448,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67246,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5374964193640791,"acs":9382,"articleLive":2,"columnArticles":104,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17455,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044807747165017,"acs":136175,"articleLive":2,"columnArticles":578,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":269931,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42115836426163644,"acs":24738,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58738,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6559479676112542,"acs":129696,"articleLive":2,"columnArticles":1071,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":197723,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4859898982957669,"acs":56577,"articleLive":2,"columnArticles":493,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":116416,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.533866336354935,"acs":18964,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35522,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4799731626534894,"acs":45069,"articleLive":2,"columnArticles":506,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93899,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44966049973538125,"acs":39933,"articleLive":2,"columnArticles":329,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":88807,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46956864289935,"acs":4768,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10154,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41216861081654294,"acs":46641,"articleLive":2,"columnArticles":308,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":113160,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36995980021927155,"acs":3037,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8209,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4013370674857711,"acs":22212,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55345,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6077904789198534,"acs":131490,"articleLive":2,"columnArticles":926,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":216341,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869460538678359,"acs":160814,"articleLive":2,"columnArticles":1379,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":204352,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8092048401037165,"acs":3745,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4628,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.494778717056191,"acs":11940,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24132,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7273864880622272,"acs":51152,"articleLive":2,"columnArticles":489,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70323,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5161981053053809,"acs":87509,"articleLive":2,"columnArticles":771,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":169526,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6061663979783016,"acs":111297,"articleLive":2,"columnArticles":1054,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":183608,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7690202506474957,"acs":372042,"articleLive":2,"columnArticles":1959,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":483787,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5392725669241403,"acs":108843,"articleLive":2,"columnArticles":1032,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":201833,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7060741249142073,"acs":12345,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17484,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223916838548696,"acs":204287,"articleLive":2,"columnArticles":1508,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":328229,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5996827720839434,"acs":4915,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8196,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738952772073922,"acs":215922,"articleLive":2,"columnArticles":1523,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":292200,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5503635223999249,"acs":252001,"articleLive":2,"columnArticles":1410,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":457881,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5900505161432023,"acs":5373,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9106,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6804990326239242,"acs":20400,"articleLive":2,"columnArticles":337,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":29978,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42669753086419754,"acs":2212,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5184,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45381823807344474,"acs":70404,"articleLive":2,"columnArticles":544,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155137,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40741759081049705,"acs":26672,"articleLive":2,"columnArticles":439,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65466,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35285053929121724,"acs":1603,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4543,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5207064555420219,"acs":24795,"articleLive":2,"columnArticles":388,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47618,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.351797708415646,"acs":4452,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12655,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7270680078066356,"acs":4843,"articleLive":2,"columnArticles":57,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6661,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6020130006290627,"acs":2871,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4769,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5658210490229688,"acs":3301,"articleLive":2,"columnArticles":64,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5834,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6911213005418925,"acs":3316,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4798,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48970594783951077,"acs":32991,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67369,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7212406753042796,"acs":1837,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2547,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3657401422107304,"acs":33948,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92820,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7643277986073915,"acs":4281,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5601,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4389239668583595,"acs":77927,"articleLive":2,"columnArticles":620,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":177541,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.458998059274366,"acs":41862,"articleLive":2,"columnArticles":454,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91203,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.617566456563442,"acs":4507,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7298,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7224326130541323,"acs":3243,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4489,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127887400846314,"acs":80806,"articleLive":2,"columnArticles":507,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131866,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.511137415258797,"acs":14250,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27879,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.418057678589626,"acs":20512,"articleLive":2,"columnArticles":208,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49065,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5154016285075309,"acs":83426,"articleLive":2,"columnArticles":568,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":161866,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4692728494193672,"acs":14669,"articleLive":2,"columnArticles":123,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31259,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46446972557522015,"acs":76265,"articleLive":2,"columnArticles":818,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":164198,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5090784140693942,"acs":65188,"articleLive":2,"columnArticles":554,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":128051,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390492387043203,"acs":80039,"articleLive":2,"columnArticles":565,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125247,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6386267817707287,"acs":3181,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4981,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5032486200551978,"acs":35010,"articleLive":2,"columnArticles":220,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":69568,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44143749086429035,"acs":21140,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47889,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6317686670627847,"acs":15949,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25245,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6018660924843637,"acs":70440,"articleLive":2,"columnArticles":770,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":117036,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5792274754091106,"acs":52350,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":90379,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4177036199095023,"acs":7385,"articleLive":2,"columnArticles":85,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17680,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7495161828495162,"acs":22463,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":29970,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5341168383567398,"acs":223780,"articleLive":2,"columnArticles":1212,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":418972,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5277488727020465,"acs":6086,"articleLive":2,"columnArticles":110,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11532,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6916271527392902,"acs":101082,"articleLive":2,"columnArticles":991,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":146151,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46735395189003437,"acs":7072,"articleLive":2,"columnArticles":95,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15132,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3577367205542725,"acs":4647,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12990,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152910318656175,"acs":147736,"articleLive":2,"columnArticles":1584,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":286704,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3911433910376194,"acs":11094,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28363,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5529059759735403,"acs":122702,"articleLive":2,"columnArticles":1310,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":221922,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205059640056485,"acs":51972,"articleLive":2,"columnArticles":429,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":99849,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42904599260749543,"acs":9170,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21373,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37719213488574327,"acs":15615,"articleLive":2,"columnArticles":193,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41398,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6578244533973111,"acs":14532,"articleLive":2,"columnArticles":122,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22091,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5918584318388473,"acs":42309,"articleLive":2,"columnArticles":529,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71485,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41672400447234886,"acs":19381,"articleLive":2,"columnArticles":198,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46508,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6139671989347052,"acs":53945,"articleLive":2,"columnArticles":657,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87863,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3271902192934815,"acs":81330,"articleLive":2,"columnArticles":589,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":248571,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4556108095256964,"acs":45993,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":100948,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5842161139190842,"acs":101254,"articleLive":2,"columnArticles":1130,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":173316,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5619626007046244,"acs":45619,"articleLive":2,"columnArticles":462,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81178,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7375326958535225,"acs":120400,"articleLive":2,"columnArticles":798,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":163247,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48401996920636403,"acs":10374,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21433,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3239966939112866,"acs":3528,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10889,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5561455375698855,"acs":94998,"articleLive":2,"columnArticles":1329,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":170815,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5648456329622403,"acs":39372,"articleLive":2,"columnArticles":319,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69704,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5022321428571429,"acs":900,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1792,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6738965130173444,"acs":74444,"articleLive":2,"columnArticles":379,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":110468,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6883362461679512,"acs":72075,"articleLive":2,"columnArticles":935,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":104709,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3932826757326615,"acs":87107,"articleLive":2,"columnArticles":1134,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":221487,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5383683157524866,"acs":150152,"articleLive":2,"columnArticles":1087,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":278902,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5076495815415916,"acs":175663,"articleLive":2,"columnArticles":992,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":346032,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48085497666510524,"acs":27716,"articleLive":2,"columnArticles":327,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":57639,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36102819237147593,"acs":2177,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6030,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7565420848469921,"acs":12287,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16241,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20780694454951207,"acs":2747,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13219,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223620395857911,"acs":33236,"articleLive":2,"columnArticles":306,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53403,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4272320477306627,"acs":2005,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4693,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.569921376251596,"acs":8481,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14881,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5313158083967662,"acs":51722,"articleLive":2,"columnArticles":450,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97347,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6156941649899397,"acs":1530,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2485,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6685895586962792,"acs":6954,"articleLive":2,"columnArticles":114,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10401,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6132719714964371,"acs":4131,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6736,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6511341222879684,"acs":2641,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4056,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6998542809416057,"acs":59074,"articleLive":2,"columnArticles":475,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":84409,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5876784212142657,"acs":44013,"articleLive":2,"columnArticles":673,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74893,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7322635135135135,"acs":867,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1184,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3790883190883191,"acs":6653,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17550,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.532302946994334,"acs":15877,"articleLive":2,"columnArticles":215,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29827,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3994258373205742,"acs":62610,"articleLive":2,"columnArticles":871,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":156750,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5077082368611373,"acs":97580,"articleLive":2,"columnArticles":859,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":192197,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4885130295851468,"acs":8867,"articleLive":2,"columnArticles":146,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18151,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743299177689067,"acs":124880,"articleLive":2,"columnArticles":1026,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":217436,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5187796727481155,"acs":95940,"articleLive":2,"columnArticles":843,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":184934,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5904276985743381,"acs":2899,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4910,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38015922178631245,"acs":16570,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43587,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4579502935539805,"acs":75271,"articleLive":2,"columnArticles":738,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":164365,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.697359825369258,"acs":43767,"articleLive":2,"columnArticles":444,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62761,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47716809965472884,"acs":56386,"articleLive":2,"columnArticles":693,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118168,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2519100793417573,"acs":3429,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13612,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885697272160154,"acs":83026,"articleLive":2,"columnArticles":939,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141064,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5517270984174226,"acs":19279,"articleLive":2,"columnArticles":172,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34943,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6628900949796472,"acs":48855,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73700,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6488286643731423,"acs":138619,"articleLive":2,"columnArticles":1092,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":213645,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5576867608883761,"acs":15468,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27736,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4866056908956775,"acs":61342,"articleLive":2,"columnArticles":622,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":126061,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7116086321934946,"acs":81909,"articleLive":2,"columnArticles":954,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115104,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5089420989331959,"acs":97752,"articleLive":2,"columnArticles":851,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":192069,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5563157151217937,"acs":27566,"articleLive":2,"columnArticles":311,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49551,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6031671286978316,"acs":79416,"articleLive":2,"columnArticles":497,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":131665,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5769931148651191,"acs":153359,"articleLive":2,"columnArticles":1255,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":265790,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3625073770647849,"acs":57125,"articleLive":2,"columnArticles":460,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157583,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4360971625627685,"acs":28833,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66116,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6117976007937224,"acs":6783,"articleLive":2,"columnArticles":64,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11087,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115553338704933,"acs":79996,"articleLive":2,"columnArticles":643,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":156378,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4378329119123102,"acs":34112,"articleLive":2,"columnArticles":404,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":77911,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8122372121847738,"acs":170383,"articleLive":2,"columnArticles":1359,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":209770,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6050499019022435,"acs":14186,"articleLive":2,"columnArticles":132,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23446,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7090083132694317,"acs":78037,"articleLive":2,"columnArticles":938,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110065,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3560048241716389,"acs":11217,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31508,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5293342122610415,"acs":1606,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3034,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37373088291993317,"acs":11632,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31124,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4408753262397109,"acs":8784,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19924,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25138207155781706,"acs":25146,"articleLive":2,"columnArticles":298,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100031,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4347069065583285,"acs":1498,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3446,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470350185231132,"acs":63938,"articleLive":2,"columnArticles":336,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":116881,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.619161105815062,"acs":1299,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2098,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39963746223564955,"acs":6614,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16550,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42007894422072484,"acs":21072,"articleLive":2,"columnArticles":179,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50162,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6120633946169505,"acs":75771,"articleLive":2,"columnArticles":600,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":123796,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33458397023175385,"acs":21670,"articleLive":2,"columnArticles":240,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64767,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7013435204665411,"acs":38003,"articleLive":2,"columnArticles":486,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54186,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.603825941370704,"acs":38951,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64507,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43815348194910236,"acs":6663,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15207,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41832560676302155,"acs":3068,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7334,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44825915100483105,"acs":29599,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66031,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5410369236655825,"acs":5656,"articleLive":2,"columnArticles":96,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10454,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4722361765015129,"acs":40422,"articleLive":2,"columnArticles":430,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":85597,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.59066884672421,"acs":15534,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26299,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6357730619315721,"acs":1468,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2309,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6072713118711877,"acs":123253,"articleLive":2,"columnArticles":992,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":202962,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5864393088389352,"acs":46463,"articleLive":2,"columnArticles":402,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79229,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5783571077225774,"acs":5879,"articleLive":2,"columnArticles":114,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10165,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.387732628565136,"acs":3521,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9081,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7201773835920178,"acs":1624,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2255,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48325733827301226,"acs":6783,"articleLive":2,"columnArticles":81,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14036,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5466591905159688,"acs":47772,"articleLive":2,"columnArticles":405,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":87389,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5524609573208548,"acs":19598,"articleLive":2,"columnArticles":180,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35474,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3458875585632483,"acs":26578,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76840,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49329890689539385,"acs":151315,"articleLive":2,"columnArticles":1044,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":306741,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5429356581066995,"acs":28648,"articleLive":2,"columnArticles":437,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52765,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6872979767748114,"acs":103338,"articleLive":2,"columnArticles":1064,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":150354,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4048428785199293,"acs":2976,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7351,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4687229379376704,"acs":43842,"articleLive":2,"columnArticles":455,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":93535,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3716302046577276,"acs":2633,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7085,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7091315159329526,"acs":30799,"articleLive":2,"columnArticles":480,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43432,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5129428216283406,"acs":66026,"articleLive":2,"columnArticles":543,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":128720,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44128548182968724,"acs":29289,"articleLive":2,"columnArticles":356,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66372,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.635817927377182,"acs":103590,"articleLive":2,"columnArticles":981,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":162924,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5042884448873568,"acs":30868,"articleLive":2,"columnArticles":323,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61211,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4832490789135464,"acs":5640,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11671,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5638438938145134,"acs":21686,"articleLive":2,"columnArticles":291,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38461,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4130666218412058,"acs":29488,"articleLive":2,"columnArticles":232,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":71388,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6771048880305329,"acs":14725,"articleLive":2,"columnArticles":211,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21747,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6747041830018738,"acs":245929,"articleLive":2,"columnArticles":1490,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":364499,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6074870274277242,"acs":3278,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5396,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7325475974614687,"acs":19392,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26472,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.537844611528822,"acs":18241,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":33915,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7310731728154234,"acs":51344,"articleLive":2,"columnArticles":572,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":70231,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5007128309572302,"acs":19668,"articleLive":2,"columnArticles":240,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39280,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.644570120737694,"acs":38865,"articleLive":2,"columnArticles":426,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60296,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6539122180536093,"acs":86799,"articleLive":2,"columnArticles":622,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":132738,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5101823789014729,"acs":19190,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37614,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6572916603730266,"acs":108789,"articleLive":2,"columnArticles":685,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":165511,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39757805660927925,"acs":2725,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6854,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5639427386822052,"acs":40261,"articleLive":2,"columnArticles":645,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71392,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7132908206074845,"acs":25503,"articleLive":2,"columnArticles":253,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35754,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3617189977798922,"acs":6843,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18918,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27473389534212317,"acs":68992,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":251123,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49536148978435535,"acs":72566,"articleLive":2,"columnArticles":758,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":146491,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5359496456501934,"acs":45299,"articleLive":2,"columnArticles":517,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84521,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7351640576633943,"acs":33250,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45228,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5789626195305708,"acs":1998,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3451,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4769950218735858,"acs":31620,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66290,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6450178513469653,"acs":39746,"articleLive":2,"columnArticles":463,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61620,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6208202686029972,"acs":79000,"articleLive":2,"columnArticles":638,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":127251,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6591144932549291,"acs":3811,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5782,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37480708458881457,"acs":25500,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68035,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5253205128205128,"acs":1639,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3120,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6750526069675006,"acs":14436,"articleLive":2,"columnArticles":139,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21385,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8422004681847202,"acs":15830,"articleLive":2,"columnArticles":102,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18796,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5382599580712788,"acs":3081,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5724,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7125326529372457,"acs":11729,"articleLive":2,"columnArticles":173,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16461,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7009502051651851,"acs":109841,"articleLive":2,"columnArticles":840,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":156703,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5983162704120484,"acs":14143,"articleLive":2,"columnArticles":188,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23638,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5823516170180836,"acs":38805,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66635,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.607343717549325,"acs":73109,"articleLive":2,"columnArticles":803,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":120375,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4580315435889361,"acs":69815,"articleLive":2,"columnArticles":649,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":152424,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5524761255615899,"acs":150763,"articleLive":2,"columnArticles":1241,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":272886,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7108359133126935,"acs":2296,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3230,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.418488824101069,"acs":3445,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8232,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6282687575593277,"acs":15064,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23977,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.618723964042973,"acs":163676,"articleLive":2,"columnArticles":1144,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":264538,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3553846153846154,"acs":1617,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4550,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48124306326304106,"acs":2168,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4505,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43861883778573396,"acs":12741,"articleLive":2,"columnArticles":179,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29048,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5678171767561009,"acs":58961,"articleLive":2,"columnArticles":758,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103838,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.577702459075503,"acs":24033,"articleLive":2,"columnArticles":286,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41601,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.605335505549333,"acs":5945,"articleLive":2,"columnArticles":86,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9821,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5030136626666812,"acs":45984,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91417,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3429368029739777,"acs":1107,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3228,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32598903902904436,"acs":14692,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45069,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7455500064028685,"acs":163016,"articleLive":2,"columnArticles":1337,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":218652,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5043207742827515,"acs":2918,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5786,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7283152676644292,"acs":61413,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84322,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44661952574864383,"acs":151902,"articleLive":2,"columnArticles":933,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":340115,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7749096496725069,"acs":90270,"articleLive":2,"columnArticles":752,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116491,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4665309543767214,"acs":3896,"articleLive":2,"columnArticles":61,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8351,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6061472346786249,"acs":32441,"articleLive":2,"columnArticles":325,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53520,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17944075638704485,"acs":4460,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24855,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6108982545764154,"acs":14350,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23490,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6893210602809883,"acs":69720,"articleLive":2,"columnArticles":649,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":101143,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4318674461969047,"acs":119740,"articleLive":2,"columnArticles":1094,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":277261,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5076595744680851,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2350,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.564793152639087,"acs":9898,"articleLive":2,"columnArticles":156,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17525,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6610186844125928,"acs":12913,"articleLive":2,"columnArticles":113,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19535,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4878327267537287,"acs":6836,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14013,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47316593361761106,"acs":84665,"articleLive":2,"columnArticles":741,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":178933,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6640776699029126,"acs":1026,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1545,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6473348635552155,"acs":12691,"articleLive":2,"columnArticles":113,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19605,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6832683075638617,"acs":42556,"articleLive":2,"columnArticles":438,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62283,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.468670134672201,"acs":25857,"articleLive":2,"columnArticles":280,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55171,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7025648161031492,"acs":15148,"articleLive":2,"columnArticles":85,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21561,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49610972568578554,"acs":9947,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20050,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41058867086264345,"acs":7763,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18907,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5232431309406327,"acs":10074,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19253,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40513391037866564,"acs":99415,"articleLive":2,"columnArticles":861,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":245388,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40805833411236797,"acs":8730,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21394,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6189237383360203,"acs":50675,"articleLive":2,"columnArticles":492,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":81876,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744213417026284,"acs":13818,"articleLive":2,"columnArticles":61,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17843,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5958560214977724,"acs":8426,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14141,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7461864190602521,"acs":14626,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19601,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3845878777042732,"acs":2151,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5593,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42704420687662525,"acs":1478,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3461,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7451940027870586,"acs":88769,"articleLive":2,"columnArticles":567,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119122,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7611786773159073,"acs":62900,"articleLive":2,"columnArticles":464,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82635,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34219586840091815,"acs":1789,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5228,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5230948225712624,"acs":4496,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8595,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44178678916521463,"acs":8367,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18939,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5183368907548201,"acs":29384,"articleLive":2,"columnArticles":270,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56689,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7967997538272175,"acs":103576,"articleLive":2,"columnArticles":238,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":129990,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42115432175095835,"acs":81741,"articleLive":2,"columnArticles":286,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":194088,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4416347381864623,"acs":10374,"articleLive":2,"columnArticles":82,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23490,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5179642629227824,"acs":16233,"articleLive":2,"columnArticles":210,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31340,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5223209467966473,"acs":29040,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55598,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4814703900576477,"acs":19293,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40071,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5003080812070464,"acs":31667,"articleLive":2,"columnArticles":375,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63295,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6291682785299807,"acs":8132,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12925,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6711073666473593,"acs":12745,"articleLive":2,"columnArticles":112,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":18991,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37393031784841074,"acs":2447,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6544,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33374829550988605,"acs":109651,"articleLive":2,"columnArticles":1260,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":328544,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5693358014370733,"acs":28604,"articleLive":2,"columnArticles":314,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50241,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6600945087176144,"acs":12153,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18411,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.656045470203238,"acs":7618,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11612,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4858465904847263,"acs":6505,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13389,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6664136142215474,"acs":10534,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15807,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319560939160817,"acs":50547,"articleLive":2,"columnArticles":393,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95021,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6679655641141822,"acs":7371,"articleLive":2,"columnArticles":64,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11035,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8176342881154143,"acs":11675,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14279,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3453880190605854,"acs":8118,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23504,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4248402555910543,"acs":5319,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12520,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46064098959797584,"acs":3277,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7114,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7877448172225128,"acs":189763,"articleLive":2,"columnArticles":1251,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":240894,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6192189790750366,"acs":4646,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7503,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46573941501329513,"acs":11385,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24445,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7736308114996938,"acs":93484,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":120838,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5711008671639283,"acs":78174,"articleLive":2,"columnArticles":499,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":136883,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43704138930247777,"acs":65457,"articleLive":2,"columnArticles":424,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":149773,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5461656517649388,"acs":11032,"articleLive":2,"columnArticles":189,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20199,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41965828373968134,"acs":2186,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5209,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3428649237472767,"acs":2518,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7344,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6840258429842924,"acs":45420,"articleLive":2,"columnArticles":355,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66401,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8082739079102715,"acs":85576,"articleLive":2,"columnArticles":339,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":105875,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5248824694812965,"acs":80275,"articleLive":2,"columnArticles":761,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":152939,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4066117323916029,"acs":4145,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10194,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.368451452665627,"acs":6379,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17313,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28810853950518756,"acs":1083,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3759,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5978722056867836,"acs":18882,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31582,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39791876071660853,"acs":94220,"articleLive":2,"columnArticles":769,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":236782,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.440530058177117,"acs":1363,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3094,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5537201365187713,"acs":4056,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7325,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5517996518614184,"acs":9827,"articleLive":2,"columnArticles":112,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17809,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900624029262286,"acs":75085,"articleLive":2,"columnArticles":652,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":108809,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5923478081272268,"acs":11472,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19367,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37691630945472926,"acs":20136,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53423,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4248953893082007,"acs":10865,"articleLive":2,"columnArticles":212,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25571,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5328011107254426,"acs":21490,"articleLive":2,"columnArticles":241,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40334,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4891412631998406,"acs":2455,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5019,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45053859076983893,"acs":63826,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":141666,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4011220196353436,"acs":1144,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2852,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4339122866765051,"acs":68802,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":158562,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5776823368088795,"acs":22328,"articleLive":2,"columnArticles":200,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38651,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6567219947583913,"acs":124789,"articleLive":2,"columnArticles":918,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":190018,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5847628933566433,"acs":21407,"articleLive":2,"columnArticles":280,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36608,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48190658904472083,"acs":29138,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60464,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5670974727578502,"acs":49232,"articleLive":2,"columnArticles":653,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86814,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5842488008664707,"acs":3776,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6463,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5716335637413597,"acs":32666,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57145,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.598119926757883,"acs":41485,"articleLive":2,"columnArticles":393,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69359,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8108443150887973,"acs":60176,"articleLive":2,"columnArticles":608,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":74214,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5979290314433641,"acs":9470,"articleLive":2,"columnArticles":138,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15838,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3079446064139942,"acs":845,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2744,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7833063209076175,"acs":82161,"articleLive":2,"columnArticles":626,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":104890,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4550321017770324,"acs":26861,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59031,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419917218227249,"acs":28415,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52427,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6556914393226717,"acs":697,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1063,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5607505070993914,"acs":16587,"articleLive":2,"columnArticles":213,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29580,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4089718355729882,"acs":28882,"articleLive":2,"columnArticles":274,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":70621,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4641185647425897,"acs":1785,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3846,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6538564105603129,"acs":22067,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33749,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2707895743559761,"acs":75032,"articleLive":2,"columnArticles":940,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":277086,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.618006993006993,"acs":2121,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3432,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6243963234148622,"acs":8016,"articleLive":2,"columnArticles":120,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12838,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.508261387317654,"acs":6829,"articleLive":2,"columnArticles":67,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13436,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6657111557421946,"acs":36461,"articleLive":2,"columnArticles":308,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54770,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4515165876777251,"acs":19054,"articleLive":2,"columnArticles":285,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42200,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4861691686961579,"acs":53500,"articleLive":2,"columnArticles":669,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110044,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5485603461136804,"acs":3677,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6703,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4350838970716123,"acs":47529,"articleLive":2,"columnArticles":417,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":109241,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4966610750804013,"acs":92968,"articleLive":2,"columnArticles":767,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":187186,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4012413793103448,"acs":2909,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7250,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5876660652780056,"acs":7166,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12194,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6174867899603699,"acs":14958,"articleLive":2,"columnArticles":252,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24224,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3856623275488261,"acs":43581,"articleLive":2,"columnArticles":479,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113003,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5414295541241949,"acs":25974,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47973,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4016335095958289,"acs":86891,"articleLive":2,"columnArticles":824,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":216344,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5032958511050795,"acs":2596,"articleLive":2,"columnArticles":63,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5158,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6951127479095601,"acs":46054,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66254,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4341539663931223,"acs":2222,"articleLive":2,"columnArticles":51,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5118,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658984643339907,"acs":60100,"articleLive":2,"columnArticles":606,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90254,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43114673083947486,"acs":20066,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46541,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35598032962284726,"acs":17301,"articleLive":2,"columnArticles":195,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48601,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44134966638625445,"acs":38299,"articleLive":2,"columnArticles":273,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86777,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108274591985775,"acs":8044,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15747,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.486986098787341,"acs":3293,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6762,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6476731276310311,"acs":56003,"articleLive":2,"columnArticles":566,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86468,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.491430138488962,"acs":3584,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7293,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5778237323185667,"acs":68178,"articleLive":2,"columnArticles":737,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":117991,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6097692020183143,"acs":26103,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42808,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5349540078843626,"acs":4071,"articleLive":2,"columnArticles":78,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7610,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6649204530991473,"acs":130607,"articleLive":2,"columnArticles":1295,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":196425,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6318410967515746,"acs":52264,"articleLive":2,"columnArticles":475,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82717,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6049439833083866,"acs":66686,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110235,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44679391589621237,"acs":29962,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67060,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47776628748707345,"acs":2772,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5802,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7604287743768565,"acs":82432,"articleLive":2,"columnArticles":520,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":108402,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7232697857041487,"acs":76446,"articleLive":2,"columnArticles":565,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":105695,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7402464065708418,"acs":4326,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5844,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5128597152855638,"acs":60380,"articleLive":2,"columnArticles":551,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117732,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.555992014327013,"acs":292141,"articleLive":2,"columnArticles":1447,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":525441,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6452510215435379,"acs":67270,"articleLive":2,"columnArticles":434,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":104254,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6443146753376024,"acs":58257,"articleLive":2,"columnArticles":391,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":90417,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3215794849200945,"acs":64231,"articleLive":2,"columnArticles":441,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":199736,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3390925480769231,"acs":2257,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6656,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7587494117143713,"acs":70937,"articleLive":2,"columnArticles":510,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93492,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.35237838566230967,"acs":5230,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14842,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5600624024960998,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1282,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6719150818222026,"acs":15192,"articleLive":2,"columnArticles":170,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22610,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41411021533521797,"acs":23731,"articleLive":2,"columnArticles":220,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":57306,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7218012712320896,"acs":100500,"articleLive":2,"columnArticles":672,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":139235,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40981330041660236,"acs":2656,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6481,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4606651376146789,"acs":4017,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8720,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115726907111592,"acs":31673,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61913,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.564502821249867,"acs":84838,"articleLive":2,"columnArticles":589,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":150288,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3699455595727881,"acs":8902,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24063,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4850986001360002,"acs":20688,"articleLive":2,"columnArticles":274,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42647,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4692256569029518,"acs":28947,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61691,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3220230473751601,"acs":5030,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15620,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7203947368421053,"acs":1314,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1824,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46259114003329105,"acs":138120,"articleLive":2,"columnArticles":864,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":298579,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6086013462976814,"acs":48822,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80220,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524943023550266,"acs":21818,"articleLive":2,"columnArticles":397,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39490,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4094035087719298,"acs":2917,"articleLive":2,"columnArticles":49,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7125,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7601047401638243,"acs":33963,"articleLive":2,"columnArticles":310,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44682,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5134345067794501,"acs":8255,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16078,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4903990024937656,"acs":3933,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8020,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.505524861878453,"acs":4026,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7964,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6103429700125695,"acs":3399,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5569,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804143882881152,"acs":66447,"articleLive":2,"columnArticles":570,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":114482,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4808730344989439,"acs":2049,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4261,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40650500831496306,"acs":21022,"articleLive":2,"columnArticles":263,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51714,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4632768361581921,"acs":1558,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3363,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4611801242236025,"acs":3861,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8372,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017781931615425,"acs":41340,"articleLive":2,"columnArticles":589,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82387,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6799952788960273,"acs":213169,"articleLive":2,"columnArticles":1521,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":313486,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6296986946707234,"acs":51328,"articleLive":2,"columnArticles":595,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":81512,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3670594733934819,"acs":3987,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10862,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49498868412544456,"acs":1531,"articleLive":2,"columnArticles":44,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3093,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5202892363035164,"acs":57275,"articleLive":2,"columnArticles":525,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":110083,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4589319175515303,"acs":41146,"articleLive":2,"columnArticles":365,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89656,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3926572949365361,"acs":2877,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7327,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5880027940838312,"acs":135527,"articleLive":2,"columnArticles":1300,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":230487,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41661474748955507,"acs":45471,"articleLive":2,"columnArticles":404,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109144,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6021825873756069,"acs":12526,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20801,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5055637982195845,"acs":1363,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2696,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.721820809248555,"acs":1998,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2768,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027046520014424,"acs":1394,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2773,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5303694474621854,"acs":69812,"articleLive":2,"columnArticles":591,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":131629,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5913426265590609,"acs":3224,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5452,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4308196369105167,"acs":8021,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18618,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49884881043745205,"acs":1300,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2606,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5654739948358539,"acs":4599,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8133,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41997593261131166,"acs":2443,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5817,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.46184262554369315,"acs":3504,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7587,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6606765327695561,"acs":1875,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2838,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8395744680851064,"acs":3946,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4700,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5904869124683366,"acs":2098,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3553,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7001216783765749,"acs":17837,"articleLive":2,"columnArticles":142,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25477,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631441714934908,"acs":81951,"articleLive":2,"columnArticles":987,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":107386,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4934451399551199,"acs":4178,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8467,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6651378240233662,"acs":29149,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43824,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080526973252115,"acs":54981,"articleLive":2,"columnArticles":635,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77651,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47792933089893674,"acs":40050,"articleLive":2,"columnArticles":497,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83799,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5057940729483282,"acs":5325,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10528,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5873626889493945,"acs":12512,"articleLive":2,"columnArticles":149,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21302,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5548837209302325,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2150,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513182113920601,"acs":153090,"articleLive":2,"columnArticles":1115,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":179827,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49308718932310397,"acs":6170,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12513,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.713163845260649,"acs":23339,"articleLive":2,"columnArticles":333,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32726,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5896351136964569,"acs":1115,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1891,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4600798403193613,"acs":5071,"articleLive":2,"columnArticles":80,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11022,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5690095846645368,"acs":1781,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3130,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3235600880750956,"acs":5584,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17258,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5941469080625205,"acs":23530,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39603,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4364377504490811,"acs":18951,"articleLive":2,"columnArticles":235,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43422,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2872573987880917,"acs":3271,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11387,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6172070003280512,"acs":43273,"articleLive":2,"columnArticles":661,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70111,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42783945345858243,"acs":1503,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3513,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5959112508974053,"acs":69724,"articleLive":2,"columnArticles":670,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117004,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6869336405816959,"acs":44119,"articleLive":2,"columnArticles":486,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64226,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5122028405782425,"acs":40463,"articleLive":2,"columnArticles":405,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":78998,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4721388054721388,"acs":4245,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8991,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3910823784023751,"acs":42285,"articleLive":2,"columnArticles":399,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108123,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.608110332115467,"acs":18475,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30381,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6922287681207387,"acs":20915,"articleLive":2,"columnArticles":295,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30214,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4501503585473051,"acs":3892,"articleLive":2,"columnArticles":66,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8646,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948305291392344,"acs":11398,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16404,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46417429550452616,"acs":9076,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19553,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39310774988305003,"acs":5042,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12826,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3409903011740684,"acs":7348,"articleLive":2,"columnArticles":104,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21549,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5331031276977223,"acs":8028,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15059,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5303414677951642,"acs":23623,"articleLive":2,"columnArticles":281,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44543,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7930725644306342,"acs":43389,"articleLive":2,"columnArticles":537,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":54710,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46408286000668225,"acs":1389,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2993,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4087585623027784,"acs":5311,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12993,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7059401080019637,"acs":1438,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2037,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.419748093367229,"acs":7265,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17308,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5766948290843209,"acs":31194,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54091,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4820663916715773,"acs":12271,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25455,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7714280173751163,"acs":39781,"articleLive":2,"columnArticles":400,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51568,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29071170084439085,"acs":2651,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9119,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6569254037176172,"acs":13465,"articleLive":2,"columnArticles":151,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20497,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8453771227497577,"acs":16577,"articleLive":2,"columnArticles":218,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19609,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4810403234619167,"acs":4402,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9151,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4190044474854601,"acs":4899,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11692,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7337220602526725,"acs":16610,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22638,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.705,"acs":15651,"articleLive":2,"columnArticles":199,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22200,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6304992154355785,"acs":10849,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17207,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5501263024944743,"acs":6969,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12668,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6996306809510728,"acs":22922,"articleLive":2,"columnArticles":355,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32763,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4335870923758664,"acs":26712,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61607,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5103151862464184,"acs":3562,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6980,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914039613484325,"acs":13526,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22871,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43326220957799905,"acs":3655,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8436,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4214066102997694,"acs":21930,"articleLive":2,"columnArticles":249,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52040,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5075104426965671,"acs":55039,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108449,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6927734159018025,"acs":25059,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36172,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5023646873357857,"acs":2868,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5709,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42842550707719246,"acs":2936,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6853,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6153733635632268,"acs":16828,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27346,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39147676827463745,"acs":6614,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16895,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3741199320223355,"acs":7705,"articleLive":2,"columnArticles":112,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20595,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39071250107693634,"acs":9070,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23214,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49264705882352944,"acs":3216,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6528,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36602900988017656,"acs":8706,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23785,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.54331869510665,"acs":51963,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95640,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40545808966861596,"acs":7488,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18468,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7957647801193359,"acs":85754,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107763,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4301596589484243,"acs":5146,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11963,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5283725698962893,"acs":13399,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25359,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5742124933262146,"acs":4302,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7492,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47934314634425124,"acs":37743,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78739,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39595464296659516,"acs":19380,"articleLive":2,"columnArticles":244,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48945,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.49982526036206054,"acs":7151,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14307,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5746443363947416,"acs":19146,"articleLive":2,"columnArticles":269,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33318,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35962812225680313,"acs":9013,"articleLive":2,"columnArticles":113,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25062,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6578012925218379,"acs":55575,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84486,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4881800350985857,"acs":28374,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58122,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3798502382573179,"acs":2790,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7345,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5127512340823329,"acs":89954,"articleLive":2,"columnArticles":987,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":175434,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42119610756700593,"acs":37700,"articleLive":2,"columnArticles":556,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89507,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5115895987763266,"acs":8696,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16998,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6812390797903319,"acs":18715,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27472,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4495217326659067,"acs":9070,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20177,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42686575137560767,"acs":15981,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37438,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4491603616903488,"acs":2434,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5419,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.48141118678128836,"acs":4312,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8957,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7144428648795018,"acs":84430,"articleLive":2,"columnArticles":730,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":118176,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38405797101449274,"acs":10229,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26634,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.359881031064111,"acs":4356,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12104,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.408734220402593,"acs":4792,"articleLive":2,"columnArticles":57,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11724,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6269149548857746,"acs":16328,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26045,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46661514683153016,"acs":3019,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6470,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5553633217993079,"acs":2889,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5202,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30210957689521317,"acs":27940,"articleLive":2,"columnArticles":364,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92483,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5869943836715524,"acs":89988,"articleLive":2,"columnArticles":775,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":153303,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085128257852259,"acs":31456,"articleLive":2,"columnArticles":439,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38906,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19229540965380204,"acs":16258,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84547,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6045730348633918,"acs":35272,"articleLive":2,"columnArticles":563,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58342,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45617200420989323,"acs":3034,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6651,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6578334304018637,"acs":9036,"articleLive":2,"columnArticles":130,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13736,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2246120663830807,"acs":7498,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33382,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702354775516731,"acs":83823,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125065,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6242984231224467,"acs":16351,"articleLive":2,"columnArticles":236,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26191,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5511285909712722,"acs":6446,"articleLive":2,"columnArticles":96,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11696,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4294048337500359,"acs":14942,"articleLive":2,"columnArticles":191,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34797,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34207681775599913,"acs":9494,"articleLive":2,"columnArticles":126,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27754,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521856245488142,"acs":60530,"articleLive":2,"columnArticles":722,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92811,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5111327534674414,"acs":15220,"articleLive":2,"columnArticles":112,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29777,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41493265585934347,"acs":20579,"articleLive":2,"columnArticles":228,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49596,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47957019197805967,"acs":44765,"articleLive":2,"columnArticles":354,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":93344,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7060949982874017,"acs":152549,"articleLive":2,"columnArticles":1650,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":216046,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7572645207137385,"acs":68200,"articleLive":2,"columnArticles":484,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90061,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2813617782319877,"acs":4405,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15656,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5543122341111254,"acs":21499,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38785,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528104133209365,"acs":5982,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23662,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5377067179029712,"acs":47016,"articleLive":2,"columnArticles":573,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87438,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48541041723479683,"acs":1780,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3667,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6889803673210892,"acs":10879,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15790,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6620411209879894,"acs":19513,"articleLive":2,"columnArticles":253,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29474,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6916778323656394,"acs":4646,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6717,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4266771824320994,"acs":8656,"articleLive":2,"columnArticles":115,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20287,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29146450115482614,"acs":51361,"articleLive":2,"columnArticles":337,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":176217,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6404969849423436,"acs":54489,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85073,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6759036671183181,"acs":15464,"articleLive":2,"columnArticles":148,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22879,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7265097910153036,"acs":8830,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12154,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33047409296395036,"acs":2851,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8627,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385629936354574,"acs":33310,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52164,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7248905355338497,"acs":10761,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14845,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7745276911305986,"acs":13160,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16991,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5454684512428298,"acs":7132,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13075,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867301749758892,"acs":59620,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101614,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7441874379255465,"acs":62191,"articleLive":2,"columnArticles":710,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83569,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33817726276229254,"acs":5399,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15965,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.536913611894386,"acs":4189,"articleLive":2,"columnArticles":46,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7802,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.492988606485539,"acs":3375,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6846,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5457108336689489,"acs":18970,"articleLive":2,"columnArticles":233,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34762,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32958024691358023,"acs":3337,"articleLive":2,"columnArticles":77,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10125,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5309222423146474,"acs":2936,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5530,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45355058365758755,"acs":20515,"articleLive":2,"columnArticles":280,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":45232,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7005760701889703,"acs":58131,"articleLive":2,"columnArticles":605,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":82976,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27765151515151515,"acs":2199,"articleLive":2,"columnArticles":39,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7920,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3174527907171348,"acs":11381,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35851,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6987168749371838,"acs":20856,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29849,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45948776001132025,"acs":16236,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35335,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3189261873889449,"acs":6641,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20823,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4258698940998487,"acs":4504,"articleLive":2,"columnArticles":68,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10576,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.560507880910683,"acs":230436,"articleLive":2,"columnArticles":1059,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":411120,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40331139885374656,"acs":1900,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4711,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888395547239225,"acs":49042,"articleLive":2,"columnArticles":618,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126124,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46969621389734123,"acs":9416,"articleLive":2,"columnArticles":115,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20047,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44185564159292035,"acs":6391,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14464,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5701669442615331,"acs":29440,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51634,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3575697381714814,"acs":20881,"articleLive":2,"columnArticles":224,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":58397,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6326386435888378,"acs":5373,"articleLive":2,"columnArticles":101,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8493,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48391281785158274,"acs":1865,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3854,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7376606052095767,"acs":21013,"articleLive":2,"columnArticles":310,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28486,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140023170557521,"acs":89980,"articleLive":2,"columnArticles":826,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126022,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33890330953926023,"acs":6267,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18492,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35891712454212454,"acs":6271,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17472,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3874400295239267,"acs":50392,"articleLive":2,"columnArticles":677,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130064,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5233292269787496,"acs":6797,"articleLive":2,"columnArticles":123,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":12988,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3390996658148221,"acs":3450,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10174,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4196360879454132,"acs":2214,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5276,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6440474102287819,"acs":25702,"articleLive":2,"columnArticles":232,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39907,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5448753105139207,"acs":33779,"articleLive":2,"columnArticles":342,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":61994,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6647389660322202,"acs":20920,"articleLive":2,"columnArticles":270,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31471,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6323485967503693,"acs":8562,"articleLive":2,"columnArticles":82,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13540,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.725117818108894,"acs":36158,"articleLive":2,"columnArticles":310,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49865,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47412891285105013,"acs":23568,"articleLive":2,"columnArticles":264,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49708,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4750737692188228,"acs":6118,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12878,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37848315968015506,"acs":1562,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4127,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5877369116998874,"acs":12001,"articleLive":2,"columnArticles":127,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20419,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8187504214714411,"acs":97130,"articleLive":2,"columnArticles":801,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118632,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45361943725473824,"acs":5433,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11977,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42126978780734253,"acs":5003,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11876,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39250233827953185,"acs":62108,"articleLive":2,"columnArticles":615,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158236,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7302007358161751,"acs":22626,"articleLive":2,"columnArticles":213,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30986,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4700530705079606,"acs":1860,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3957,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.689533261976582,"acs":21259,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30831,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4861318672278816,"acs":35457,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72937,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.624461552561635,"acs":27254,"articleLive":2,"columnArticles":300,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43644,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6126830186902689,"acs":26028,"articleLive":2,"columnArticles":336,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42482,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39189578650066287,"acs":6799,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17349,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.370521100592763,"acs":8376,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22606,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7744734558649523,"acs":9818,"articleLive":2,"columnArticles":146,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12677,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6641394543609337,"acs":11125,"articleLive":2,"columnArticles":168,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16751,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.35219981668194317,"acs":3074,"articleLive":2,"columnArticles":59,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8728,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5529188419553868,"acs":13980,"articleLive":2,"columnArticles":169,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25284,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3005580880160184,"acs":7055,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23473,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3299284984678243,"acs":3230,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9790,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43775753632617653,"acs":4037,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9222,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3608307700129649,"acs":14194,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39337,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5362121800681946,"acs":24847,"articleLive":2,"columnArticles":230,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46338,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.743373220236292,"acs":19631,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26408,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5563616071428571,"acs":1994,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3584,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768294930875576,"acs":36718,"articleLive":2,"columnArticles":303,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54250,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4426315962951976,"acs":13429,"articleLive":2,"columnArticles":131,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30339,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5029844807003582,"acs":2528,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5026,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43169722057953874,"acs":1460,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3382,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6835362079636889,"acs":33131,"articleLive":2,"columnArticles":393,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48470,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.403596272476703,"acs":3075,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7619,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46377772420443586,"acs":7695,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16592,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4989644734745898,"acs":25056,"articleLive":2,"columnArticles":328,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50216,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6512457026442001,"acs":15344,"articleLive":2,"columnArticles":196,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23561,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4140841899902454,"acs":11037,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26654,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4402527890630038,"acs":6827,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15507,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4105263157894737,"acs":1287,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3135,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.641143701682583,"acs":67674,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105552,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4662608760595989,"acs":37458,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80337,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44752333094041635,"acs":3117,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6965,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5974414927965441,"acs":53661,"articleLive":2,"columnArticles":501,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89818,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7103830525048586,"acs":172898,"articleLive":2,"columnArticles":1350,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":243387,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735021023125438,"acs":43244,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91328,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.712334541775567,"acs":8449,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11861,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7345881628885014,"acs":14323,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19498,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5322898724381537,"acs":21323,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40059,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5448320136956987,"acs":2546,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4673,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6342927535098354,"acs":32439,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51142,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41714680802028115,"acs":9050,"articleLive":2,"columnArticles":144,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21695,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6005018635373999,"acs":16273,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27099,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.67805096582075,"acs":25730,"articleLive":2,"columnArticles":249,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":37947,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5329608424731553,"acs":23179,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43491,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4981893705399936,"acs":9355,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18778,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47122711196669204,"acs":52629,"articleLive":2,"columnArticles":595,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111685,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5028291097333414,"acs":33414,"articleLive":2,"columnArticles":502,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66452,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5200142534742843,"acs":8756,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16838,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.452885443583118,"acs":23661,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52245,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570577627192743,"acs":50968,"articleLive":2,"columnArticles":805,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91495,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5093110901734744,"acs":55137,"articleLive":2,"columnArticles":1407,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":108258,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5399376288919069,"acs":21469,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39762,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49546862452678675,"acs":4319,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8717,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5104912642461058,"acs":36640,"articleLive":2,"columnArticles":396,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":71774,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6147916164779571,"acs":7656,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12453,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906261326567597,"acs":30487,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44144,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4094315692378646,"acs":3551,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8673,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29212238681988095,"acs":2110,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7223,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7354866139297586,"acs":57087,"articleLive":2,"columnArticles":600,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77618,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5768284605922982,"acs":12193,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21138,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5970116302687237,"acs":67605,"articleLive":2,"columnArticles":715,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113239,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5313911472448057,"acs":25883,"articleLive":2,"columnArticles":420,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":48708,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6274195833923764,"acs":44277,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70570,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4652926021347074,"acs":6321,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13585,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7225792988313856,"acs":17313,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23960,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928516228748067,"acs":15343,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25880,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45227484205886676,"acs":18470,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40838,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6267604173148321,"acs":60436,"articleLive":2,"columnArticles":579,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96426,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3343474953819407,"acs":3077,"articleLive":2,"columnArticles":65,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9203,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3969881502377554,"acs":47003,"articleLive":2,"columnArticles":920,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118399,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5506919719765706,"acs":38359,"articleLive":2,"columnArticles":452,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":69656,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35526027597284077,"acs":4866,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13697,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.584045904590459,"acs":5191,"articleLive":2,"columnArticles":80,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8888,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5611921369689283,"acs":3540,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6308,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.516171795262843,"acs":43999,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85241,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5978875114648362,"acs":20208,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33799,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5370743792129976,"acs":9322,"articleLive":2,"columnArticles":138,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17357,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7831660336408031,"acs":57735,"articleLive":2,"columnArticles":655,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73720,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7049279487635652,"acs":19812,"articleLive":2,"columnArticles":266,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28105,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5647124333784106,"acs":7099,"articleLive":2,"columnArticles":156,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12571,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5572936644263963,"acs":33417,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59963,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096164159304524,"acs":75423,"articleLive":2,"columnArticles":649,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106287,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6708681585332974,"acs":9953,"articleLive":2,"columnArticles":169,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14836,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4345294560204115,"acs":13284,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30571,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319130528820158,"acs":20304,"articleLive":2,"columnArticles":424,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27741,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6557971014492754,"acs":16833,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25668,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105595509559727,"acs":40509,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57010,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5673335673335673,"acs":4849,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8547,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3980521520578071,"acs":2534,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6366,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3908414343196952,"acs":10976,"articleLive":2,"columnArticles":167,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28083,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43231483272094373,"acs":4471,"articleLive":2,"columnArticles":98,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10342,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6332478723783072,"acs":35567,"articleLive":2,"columnArticles":387,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56166,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.30001843997787203,"acs":3254,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10846,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43837362837499433,"acs":9628,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21963,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7934881388862774,"acs":25321,"articleLive":2,"columnArticles":318,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31911,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5552689756816507,"acs":4521,"articleLive":2,"columnArticles":60,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8142,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5211739216072484,"acs":2646,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5077,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48269096005606166,"acs":6888,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14270,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5299307159353349,"acs":11473,"articleLive":2,"columnArticles":152,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21650,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6913746630727763,"acs":7695,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11130,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.2088422438382213,"acs":5711,"articleLive":2,"columnArticles":72,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27346,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6398333964407421,"acs":8449,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13205,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599438371276702,"acs":65803,"articleLive":2,"columnArticles":913,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99710,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.724849197773188,"acs":105986,"articleLive":2,"columnArticles":983,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":146218,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4554312354312354,"acs":9769,"articleLive":2,"columnArticles":134,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21450,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.64496996996997,"acs":42955,"articleLive":2,"columnArticles":403,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":66600,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7576323156912411,"acs":11366,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15002,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.753599690245142,"acs":31141,"articleLive":2,"columnArticles":371,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41323,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5812850783820399,"acs":48056,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82672,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.459102494786437,"acs":5944,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12947,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37633388664927675,"acs":7935,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21085,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5875613747954174,"acs":4667,"articleLive":2,"columnArticles":86,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7943,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.40976851290752636,"acs":3381,"articleLive":2,"columnArticles":65,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8251,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46549618320610686,"acs":3049,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6550,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3418759610456176,"acs":1334,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3902,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36304104775594953,"acs":2273,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6261,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5312730854469343,"acs":4315,"articleLive":2,"columnArticles":63,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8122,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6055724858511101,"acs":2782,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4594,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5427811669012983,"acs":3470,"articleLive":2,"columnArticles":47,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6393,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7053195560658247,"acs":1843,"articleLive":2,"columnArticles":39,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2613,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6506532389765922,"acs":4781,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7348,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5421392039137203,"acs":2438,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4497,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47398843930635837,"acs":2050,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4325,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4225855901890649,"acs":827,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1957,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.864388961892247,"acs":13156,"articleLive":2,"columnArticles":63,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15220,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8191528545119705,"acs":11120,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13575,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4807964112333313,"acs":7824,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16273,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865817726148949,"acs":34640,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59054,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5805040252012601,"acs":3317,"articleLive":2,"columnArticles":54,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5714,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33542014468558706,"acs":2411,"articleLive":2,"columnArticles":53,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7188,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6692263112141408,"acs":18476,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27608,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6936201239518776,"acs":9513,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13715,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4964325583652866,"acs":10228,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20603,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7206446661550269,"acs":7512,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10424,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6224327757781072,"acs":11759,"articleLive":2,"columnArticles":182,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18892,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7345362497566041,"acs":11317,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15407,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4904103219807044,"acs":4219,"articleLive":2,"columnArticles":90,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8603,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5707534379236878,"acs":14734,"articleLive":2,"columnArticles":145,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25815,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7603833865814696,"acs":11424,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15024,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.527701039730775,"acs":10506,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19909,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5365317131933169,"acs":10244,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19093,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7731936725096195,"acs":3617,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4678,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6893547508848353,"acs":5064,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7346,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.533801580333626,"acs":1824,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3417,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45055889939810834,"acs":1048,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2326,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.585351840091929,"acs":19357,"articleLive":2,"columnArticles":288,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33069,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5449243160672129,"acs":3924,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7201,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3786987030128352,"acs":28118,"articleLive":2,"columnArticles":285,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":74249,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48994787788533134,"acs":2632,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5372,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37939905330314877,"acs":3687,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9718,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6088168631006347,"acs":26861,"articleLive":2,"columnArticles":377,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44120,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3728023643528342,"acs":19678,"articleLive":2,"columnArticles":385,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52784,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5480078380143697,"acs":1678,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3062,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.519334229993275,"acs":6178,"articleLive":2,"columnArticles":110,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11896,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4716309762567122,"acs":7290,"articleLive":2,"columnArticles":102,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15457,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5808383233532934,"acs":4850,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8350,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6995760973608642,"acs":5116,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7313,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6666666666666666,"acs":2398,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3597,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37082045518404044,"acs":5279,"articleLive":2,"columnArticles":66,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14236,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6368065631325345,"acs":35551,"articleLive":2,"columnArticles":1103,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55827,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.761172998697259,"acs":28630,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37613,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5590909090909091,"acs":5166,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9240,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5765556768558951,"acs":4225,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7328,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41000496524329694,"acs":6606,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16112,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.839620397380842,"acs":67063,"articleLive":2,"columnArticles":682,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79873,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5770501178256968,"acs":58525,"articleLive":2,"columnArticles":584,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101421,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.629984856133266,"acs":11232,"articleLive":2,"columnArticles":202,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17829,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712132341200141,"acs":24149,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31313,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6450378433540267,"acs":7585,"articleLive":2,"columnArticles":86,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11759,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5405596604307499,"acs":6877,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12722,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653595046899251,"acs":77485,"articleLive":2,"columnArticles":580,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118552,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619447122274042,"acs":43136,"articleLive":2,"columnArticles":479,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76762,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5198827194429173,"acs":22696,"articleLive":2,"columnArticles":369,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43656,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5212797887028033,"acs":17368,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33318,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6428767499313752,"acs":2342,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3643,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8666458463460337,"acs":8325,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9606,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6095194085027726,"acs":2638,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4328,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5756940806705081,"acs":1099,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1909,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070786077434493,"acs":65088,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92052,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7023271969433831,"acs":8088,"articleLive":2,"columnArticles":103,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11516,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.318152390438247,"acs":12777,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40160,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49093851132686084,"acs":3034,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6180,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6934581573238954,"acs":6074,"articleLive":2,"columnArticles":92,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8759,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.413510101010101,"acs":3930,"articleLive":2,"columnArticles":73,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9504,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448408447190385,"acs":37126,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68141,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37997919598604907,"acs":6210,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16343,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.628812113457027,"acs":5897,"articleLive":2,"columnArticles":102,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9378,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4550170446124203,"acs":3070,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6747,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3898277004638834,"acs":4706,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12072,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6469026548672566,"acs":2924,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4520,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7763061074319353,"acs":3165,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4077,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.535756853396901,"acs":6293,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11746,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5708418891170431,"acs":2780,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4870,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.608164594755985,"acs":78421,"articleLive":2,"columnArticles":867,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":128947,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4329315570592796,"acs":6142,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14187,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47794005394127526,"acs":9392,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19651,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6521403779406093,"acs":6764,"articleLive":2,"columnArticles":95,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10372,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5100715746421268,"acs":9977,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19560,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3703187037235755,"acs":6902,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18638,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6368961472250575,"acs":167226,"articleLive":2,"columnArticles":1134,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":262564,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4418006430868167,"acs":10305,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23325,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46902717661250265,"acs":6610,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14093,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28704395679054284,"acs":4225,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14719,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5609621993127147,"acs":4081,"articleLive":2,"columnArticles":82,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7275,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7149304596113106,"acs":7762,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10857,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4424247477695322,"acs":5306,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":11993,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6050213536948363,"acs":4675,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7727,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48621728051887886,"acs":4198,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8634,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38572234762979685,"acs":1367,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3544,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.371111594518164,"acs":1706,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4597,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5694928684627575,"acs":14374,"articleLive":2,"columnArticles":223,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25240,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.478096081905887,"acs":9713,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20316,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43193876663477426,"acs":4966,"articleLive":2,"columnArticles":82,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11497,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32010443864229765,"acs":3065,"articleLive":2,"columnArticles":46,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9575,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5509235893812456,"acs":5458,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9907,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48857622305408543,"acs":3785,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7747,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6869642568332525,"acs":59465,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86562,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6335280303486481,"acs":10521,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16607,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4692618435549027,"acs":38334,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81690,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2673997646845868,"acs":5909,"articleLive":2,"columnArticles":101,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22098,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6091065292096219,"acs":5672,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9312,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8370476610767873,"acs":7587,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9064,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4838593974175036,"acs":2698,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5576,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.434198245286541,"acs":2326,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5357,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.570404872805446,"acs":1592,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2791,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224308016473518,"acs":6733,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20882,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166524068987256,"acs":13694,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22207,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47465826217612783,"acs":12952,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27287,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2678050362044742,"acs":2478,"articleLive":2,"columnArticles":54,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9253,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7579294117647059,"acs":8053,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10625,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6184897491404558,"acs":4857,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7853,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49101836844948676,"acs":7271,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14808,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45027105921601335,"acs":4319,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9592,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2653950718508609,"acs":6150,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23173,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46189043344192177,"acs":18574,"articleLive":2,"columnArticles":183,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40213,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6365662625505145,"acs":30559,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48006,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7761527020327219,"acs":3131,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4034,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3724756918474196,"acs":1494,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4011,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.398073520739139,"acs":2025,"articleLive":2,"columnArticles":41,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5087,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5990740740740741,"acs":647,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1080,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5854908660796425,"acs":13365,"articleLive":2,"columnArticles":260,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22827,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6081782778018174,"acs":11244,"articleLive":2,"columnArticles":204,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18488,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39405439595192915,"acs":7476,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18972,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4415954415954416,"acs":1860,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4212,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6938428874734607,"acs":3268,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4710,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.645514898872935,"acs":20905,"articleLive":2,"columnArticles":326,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32385,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6510220296135789,"acs":45067,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69225,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26725521669341895,"acs":5994,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22428,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4976043005726306,"acs":4258,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8557,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6047707626654996,"acs":5527,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9139,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5074454243169004,"acs":3510,"articleLive":2,"columnArticles":63,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6917,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6365971107544142,"acs":13881,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21805,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6932958651144119,"acs":3454,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4982,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.37004506224700223,"acs":4845,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13093,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7464924082260235,"acs":3884,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5203,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43857566765578637,"acs":739,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1685,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.686033562459199,"acs":17865,"articleLive":2,"columnArticles":251,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26041,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24697386237741578,"acs":6019,"articleLive":2,"columnArticles":85,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24371,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5034290211362614,"acs":26867,"articleLive":2,"columnArticles":294,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53368,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6217823812942262,"acs":12126,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19502,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7266252266252267,"acs":5611,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7722,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46776298616549206,"acs":5376,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11493,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6132356929753187,"acs":6783,"articleLive":2,"columnArticles":88,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11061,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304334040633156,"acs":59897,"articleLive":2,"columnArticles":830,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82002,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49685692997093056,"acs":47345,"articleLive":2,"columnArticles":613,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95289,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5289725339504825,"acs":12114,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22901,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44900371496116176,"acs":2659,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5922,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6551477810518797,"acs":7337,"articleLive":2,"columnArticles":61,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11199,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5105123494590733,"acs":5002,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9798,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7746423415146345,"acs":5902,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7619,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6351478621209268,"acs":3372,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5309,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4121110176619008,"acs":1960,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4756,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.54006586169045,"acs":1476,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2733,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6941520653798454,"acs":21829,"articleLive":2,"columnArticles":354,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31447,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42256670902160104,"acs":8314,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19675,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6305699211199917,"acs":12071,"articleLive":2,"columnArticles":171,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19143,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5266793066088841,"acs":3889,"articleLive":2,"columnArticles":73,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7384,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439002867857931,"acs":76508,"articleLive":2,"columnArticles":1109,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90660,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6722043996333639,"acs":5867,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8728,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47502805836139167,"acs":3386,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7128,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32719694338311917,"acs":4710,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14395,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5389086212463674,"acs":3338,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6194,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5974084904709085,"acs":11849,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19834,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6627476882430647,"acs":10034,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15140,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5397935980409305,"acs":3086,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5717,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41807519834425666,"acs":2424,"articleLive":2,"columnArticles":44,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5798,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4940181847184559,"acs":3097,"articleLive":2,"columnArticles":62,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6269,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5629781675685762,"acs":3017,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5359,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4695997555759242,"acs":33814,"articleLive":2,"columnArticles":421,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72006,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.481899360444069,"acs":7987,"articleLive":2,"columnArticles":115,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16574,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34355506325424123,"acs":5893,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17153,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.463157128294743,"acs":6361,"articleLive":2,"columnArticles":110,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13734,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5627376425855514,"acs":1184,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2104,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7106957860842783,"acs":10153,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14286,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6596194503171248,"acs":3120,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4730,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4910999350153985,"acs":34763,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70786,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49425063340479436,"acs":2536,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5131,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5952336273221993,"acs":6344,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10658,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47105864432597105,"acs":1237,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2626,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5406139068699102,"acs":2589,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4789,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6205583756345178,"acs":2445,"articleLive":2,"columnArticles":41,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3940,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5109510086455331,"acs":3546,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6940,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4813603662524526,"acs":2944,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6116,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.617320819112628,"acs":8682,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14064,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5596630041323638,"acs":34942,"articleLive":2,"columnArticles":479,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62434,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5750006327031609,"acs":22720,"articleLive":2,"columnArticles":320,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39513,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5622672734795201,"acs":2718,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4834,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7721262426406718,"acs":8000,"articleLive":2,"columnArticles":95,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10361,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7485389812243545,"acs":18060,"articleLive":2,"columnArticles":315,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24127,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39337099811676085,"acs":5222,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13275,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5988009198423128,"acs":14582,"articleLive":2,"columnArticles":228,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24352,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6813312058354228,"acs":2989,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4387,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6671012603215993,"acs":1535,"articleLive":2,"columnArticles":36,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2301,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5633281972265023,"acs":1828,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3245,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5565099457504521,"acs":1231,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2212,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4798543689320388,"acs":1977,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4120,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6042718446601941,"acs":12448,"articleLive":2,"columnArticles":252,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20600,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7277995887081697,"acs":7786,"articleLive":2,"columnArticles":98,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10698,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5257943699407998,"acs":13056,"articleLive":2,"columnArticles":199,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24831,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4194680707438909,"acs":3107,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7407,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5679287305122495,"acs":4845,"articleLive":2,"columnArticles":85,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8531,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.921832884097035,"acs":2736,"articleLive":2,"columnArticles":67,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2968,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8240577474101829,"acs":29910,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36296,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071289695398574,"acs":9368,"articleLive":2,"columnArticles":146,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15430,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5849374222352338,"acs":7992,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13663,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49143749288490624,"acs":30218,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61489,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8037206794284174,"acs":5962,"articleLive":2,"columnArticles":84,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7418,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5072463768115942,"acs":2450,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4830,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5192121407814013,"acs":1608,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3097,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5440360610263523,"acs":1569,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2884,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6009852216748769,"acs":976,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1624,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5414566197930486,"acs":8163,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15076,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5016501650165016,"acs":6536,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13029,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7248370471426406,"acs":19127,"articleLive":2,"columnArticles":235,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26388,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5976859504132231,"acs":3616,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6050,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6201095461658842,"acs":1585,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2556,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5064170315566964,"acs":6708,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13246,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318408690546095,"acs":45332,"articleLive":2,"columnArticles":616,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54496,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8108477666362808,"acs":12453,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15358,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41823748349141554,"acs":6967,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16658,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6602090237063472,"acs":2590,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3923,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8129163582531458,"acs":4393,"articleLive":2,"columnArticles":60,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5404,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6458700664587007,"acs":4762,"articleLive":2,"columnArticles":93,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7373,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6035295492617554,"acs":15492,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25669,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.563080735081561,"acs":13635,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24215,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6261834178062542,"acs":6548,"articleLive":2,"columnArticles":98,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10457,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8096443259366385,"acs":53745,"articleLive":2,"columnArticles":699,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66381,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5200652770565982,"acs":7011,"articleLive":2,"columnArticles":156,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13481,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4698625858838226,"acs":6018,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12808,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35958090300280837,"acs":13316,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37032,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6563822782428747,"acs":6978,"articleLive":2,"columnArticles":72,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10631,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8084043787519548,"acs":48075,"articleLive":2,"columnArticles":637,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59469,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45432084240249426,"acs":7723,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16999,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45813261547180506,"acs":6467,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14116,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5974382433668801,"acs":2612,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4372,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7866008170864146,"acs":30421,"articleLive":2,"columnArticles":433,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38674,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46683559974466604,"acs":24134,"articleLive":2,"columnArticles":363,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51697,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3609925892656636,"acs":3215,"articleLive":2,"columnArticles":75,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8906,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8186113989637306,"acs":19749,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24125,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8217738936407587,"acs":8839,"articleLive":2,"columnArticles":83,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10756,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7240134826870042,"acs":21265,"articleLive":2,"columnArticles":383,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29371,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7471092503987241,"acs":14990,"articleLive":2,"columnArticles":226,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20064,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5754359363153905,"acs":17457,"articleLive":2,"columnArticles":272,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30337,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33134920634920634,"acs":1837,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5544,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7512029436739315,"acs":5308,"articleLive":2,"columnArticles":60,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7066,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7556262786997044,"acs":16620,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21995,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129495987529588,"acs":37047,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51963,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3781318082788671,"acs":5554,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14688,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6668552747390921,"acs":10607,"articleLive":2,"columnArticles":151,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15906,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8319866920152091,"acs":35010,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42080,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7399760055566079,"acs":11719,"articleLive":2,"columnArticles":193,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15837,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8099210110584518,"acs":12817,"articleLive":2,"columnArticles":263,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15825,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4406833280607403,"acs":2786,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6322,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6145412926932112,"acs":10202,"articleLive":2,"columnArticles":193,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16601,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6549932453496831,"acs":6303,"articleLive":2,"columnArticles":113,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9623,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6169048949932124,"acs":30902,"articleLive":2,"columnArticles":512,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50092,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5892007611798288,"acs":2477,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4204,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6139222812412636,"acs":4392,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7154,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5941071028456195,"acs":5303,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8926,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7550009289651328,"acs":24382,"articleLive":2,"columnArticles":478,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32294,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5891202550562917,"acs":5913,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10037,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.729135432283858,"acs":10213,"articleLive":2,"columnArticles":181,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14007,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47245971719829005,"acs":5747,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12164,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6890703517587939,"acs":5485,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7960,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46253691901134775,"acs":5951,"articleLive":2,"columnArticles":121,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12866,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7717439293598234,"acs":6992,"articleLive":2,"columnArticles":157,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9060,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3788517677586766,"acs":1168,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3083,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5354519902076345,"acs":11811,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22058,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6868047982551799,"acs":9447,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13755,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5436254594699168,"acs":5620,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10338,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4900069516857838,"acs":5639,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11508,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5852025443588885,"acs":3496,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5974,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4222116978451338,"acs":1783,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4223,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7059623298225259,"acs":38943,"articleLive":2,"columnArticles":623,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55163,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6397427743622359,"acs":9053,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14151,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3985344125676517,"acs":8321,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20879,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5740133735413662,"acs":4378,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7627,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.479920814479638,"acs":3394,"articleLive":2,"columnArticles":47,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7072,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8203167774736019,"acs":41951,"articleLive":2,"columnArticles":638,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51140,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5446287688174336,"acs":12771,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23449,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5922167487684729,"acs":6011,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10150,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36657409745013886,"acs":5808,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15844,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4348427812223206,"acs":15710,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36128,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7399621212121212,"acs":7814,"articleLive":2,"columnArticles":116,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10560,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3051917459719212,"acs":3239,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10613,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5062026743998711,"acs":3142,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6207,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.847979797979798,"acs":8395,"articleLive":2,"columnArticles":84,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9900,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7545876798903526,"acs":29730,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39399,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44473455178416016,"acs":6643,"articleLive":2,"columnArticles":71,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14937,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.283981670568312,"acs":11403,"articleLive":2,"columnArticles":154,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40154,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2816600252697055,"acs":2898,"articleLive":2,"columnArticles":71,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10289,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6611712175854371,"acs":3850,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5823,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7316216388835665,"acs":45820,"articleLive":2,"columnArticles":506,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62628,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5298898793917147,"acs":4042,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7628,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49459150470495117,"acs":5624,"articleLive":2,"columnArticles":111,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11371,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5511319281811085,"acs":2824,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5124,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5051381998582566,"acs":8553,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16932,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40225300490486715,"acs":7463,"articleLive":2,"columnArticles":201,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18553,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5255561047948591,"acs":5316,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10115,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36522901046692896,"acs":4920,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13471,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6736905478627333,"acs":3357,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4983,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250591475002909,"acs":85090,"articleLive":2,"columnArticles":1089,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103132,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5383448380490025,"acs":7097,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13183,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4181778156902672,"acs":15197,"articleLive":2,"columnArticles":222,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36341,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5251021599532983,"acs":3598,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6852,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6083352005377549,"acs":2715,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4463,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900498003057048,"acs":48069,"articleLive":2,"columnArticles":577,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60843,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799290005461496,"acs":21237,"articleLive":2,"columnArticles":265,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36620,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5133182560623194,"acs":8171,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15918,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4038598607379791,"acs":7366,"articleLive":2,"columnArticles":167,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18239,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7395310248460766,"acs":16936,"articleLive":2,"columnArticles":226,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22901,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5745075933417335,"acs":8663,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15079,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5030108390204737,"acs":7518,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14946,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32435579012728966,"acs":4179,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12884,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.861157617794786,"acs":7201,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8362,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8373425896028415,"acs":10373,"articleLive":2,"columnArticles":161,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12388,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7276894865525673,"acs":16667,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22904,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7317374136229022,"acs":11860,"articleLive":2,"columnArticles":155,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16208,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6921788748992123,"acs":11160,"articleLive":2,"columnArticles":174,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16123,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32284299858557286,"acs":4565,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14140,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.543957577449065,"acs":1949,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3583,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7009882547731153,"acs":13548,"articleLive":2,"columnArticles":203,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19327,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3120035742652899,"acs":6285,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20144,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6951651779384659,"acs":9806,"articleLive":2,"columnArticles":170,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14106,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5411322710195621,"acs":4177,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7719,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8311918475852902,"acs":28140,"articleLive":2,"columnArticles":479,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33855,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3537191004966241,"acs":6339,"articleLive":2,"columnArticles":115,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17921,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39950862895493766,"acs":6667,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16688,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4036815509951531,"acs":7829,"articleLive":2,"columnArticles":143,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19394,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8560908899642331,"acs":4069,"articleLive":2,"columnArticles":60,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4753,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6649947509623235,"acs":17103,"articleLive":2,"columnArticles":274,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25719,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7484356102434664,"acs":14233,"articleLive":2,"columnArticles":211,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19017,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4127086007702182,"acs":10288,"articleLive":2,"columnArticles":143,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":24928,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3738590726542534,"acs":1024,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2739,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7618381967499563,"acs":4360,"articleLive":2,"columnArticles":66,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5723,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6709746519100321,"acs":9397,"articleLive":2,"columnArticles":150,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14005,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6052294557097119,"acs":5671,"articleLive":2,"columnArticles":97,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9370,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4167375584857507,"acs":3919,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9404,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7530535546507986,"acs":9618,"articleLive":2,"columnArticles":175,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12772,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.691149812249126,"acs":21351,"articleLive":2,"columnArticles":362,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30892,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4929192036669631,"acs":7205,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14617,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5077160493827161,"acs":5593,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11016,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.568514828273356,"acs":4850,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8531,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6665906759375356,"acs":5848,"articleLive":2,"columnArticles":66,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8773,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6152219873150105,"acs":13386,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21758,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8067729083665338,"acs":8100,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10040,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4752987793187192,"acs":7437,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15647,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5506557958170861,"acs":7767,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14105,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5560573335951305,"acs":2832,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5093,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.693330787832506,"acs":10895,"articleLive":2,"columnArticles":222,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15714,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6032471240923554,"acs":7394,"articleLive":2,"columnArticles":148,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12257,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6849656893325016,"acs":6588,"articleLive":2,"columnArticles":178,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9618,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4086678301337987,"acs":2810,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6876,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.519096872861915,"acs":12898,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24847,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7326413440054304,"acs":25904,"articleLive":2,"columnArticles":415,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35357,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4188542884472314,"acs":7882,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18818,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5969965534219597,"acs":2425,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4062,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7485760781122864,"acs":2760,"articleLive":2,"columnArticles":34,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3687,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5404226941623064,"acs":10535,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19494,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5540489104577029,"acs":34935,"articleLive":2,"columnArticles":510,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63054,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3977864583333333,"acs":6721,"articleLive":2,"columnArticles":144,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16896,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4390076754385965,"acs":3203,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7296,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7087144920558498,"acs":1472,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2077,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6562874251497006,"acs":1096,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1670,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5932553337921541,"acs":862,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1453,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5049250535331906,"acs":1179,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2335,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5846538782318599,"acs":701,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1199,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8463237988489642,"acs":78527,"articleLive":2,"columnArticles":1031,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92786,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3937860010473032,"acs":4512,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11458,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6409245845760545,"acs":6017,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9388,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4654260171501551,"acs":2551,"articleLive":2,"columnArticles":45,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5481,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6197437829691033,"acs":4112,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6635,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8217245197999007,"acs":43037,"articleLive":2,"columnArticles":636,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":52374,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5866726447346299,"acs":10468,"articleLive":2,"columnArticles":175,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17843,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48275508410009965,"acs":32949,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68252,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5618860510805501,"acs":3718,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6617,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.69824193125164,"acs":2661,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3811,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6474812355658198,"acs":17943,"articleLive":2,"columnArticles":375,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27712,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916190911166933,"acs":34665,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43790,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4109298412466164,"acs":5617,"articleLive":2,"columnArticles":140,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13669,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5267267267267267,"acs":2631,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4995,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8570196247573862,"acs":3974,"articleLive":2,"columnArticles":52,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4637,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5730286333664529,"acs":12688,"articleLive":2,"columnArticles":215,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22142,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6170968753265754,"acs":5905,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9569,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7111273792093704,"acs":9714,"articleLive":2,"columnArticles":155,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13660,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6278440489347917,"acs":16474,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26239,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8026592022393282,"acs":24087,"articleLive":2,"columnArticles":342,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30009,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5228659331490848,"acs":10027,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19177,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49895213345628303,"acs":5952,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11929,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36473214285714284,"acs":1634,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4480,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.396128012643224,"acs":5013,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12655,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6329795659749723,"acs":11988,"articleLive":2,"columnArticles":205,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18939,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5229056824838899,"acs":13389,"articleLive":2,"columnArticles":209,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25605,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6322673259430577,"acs":7928,"articleLive":2,"columnArticles":138,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12539,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44232437120555074,"acs":5610,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12683,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5964360587002097,"acs":2276,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3816,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7457173447537473,"acs":15323,"articleLive":2,"columnArticles":310,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20548,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5008088548318433,"acs":5882,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11745,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42768977576630324,"acs":6237,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14583,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5911492734478203,"acs":2685,"articleLive":2,"columnArticles":64,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4542,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7684405475012298,"acs":26555,"articleLive":2,"columnArticles":370,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34557,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3094288216405566,"acs":6360,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20554,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4845345116562548,"acs":6360,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13126,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6172839506172839,"acs":1650,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2673,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7076372315035799,"acs":2965,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4190,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7950377562028047,"acs":2211,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2781,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8428389169777442,"acs":53511,"articleLive":2,"columnArticles":724,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63489,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.543912690804513,"acs":7376,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13561,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6164896462138,"acs":8068,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13087,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6744448789814452,"acs":15521,"articleLive":2,"columnArticles":165,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23013,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7176514584891548,"acs":1919,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2674,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7214457831325302,"acs":14970,"articleLive":2,"columnArticles":232,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20750,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8652331712661782,"acs":12635,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14603,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2901984009475866,"acs":4900,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16885,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5801177240026161,"acs":2661,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4587,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5648766328011611,"acs":1946,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3445,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692817970963532,"acs":128552,"articleLive":2,"columnArticles":1288,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147883,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5140248541719503,"acs":10134,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19715,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5866056462700341,"acs":31147,"articleLive":2,"columnArticles":404,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53097,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.300286584273688,"acs":3353,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11166,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8079673135852911,"acs":791,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":979,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6600838867528837,"acs":3777,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5722,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585324541770007,"acs":70962,"articleLive":2,"columnArticles":681,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82655,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3105800670084366,"acs":7694,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24773,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23729254799869834,"acs":7292,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30730,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6910189672709867,"acs":11549,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16713,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8552727272727273,"acs":1176,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1375,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6716810577441986,"acs":19914,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29648,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6620805701276848,"acs":6689,"articleLive":2,"columnArticles":79,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10103,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5678568810030061,"acs":7745,"articleLive":2,"columnArticles":147,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13639,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3697976640894884,"acs":2248,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6079,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428218501235246,"acs":3955,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7286,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5372724149776709,"acs":10948,"articleLive":2,"columnArticles":166,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20377,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39062719894919545,"acs":8327,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21317,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3346141530579571,"acs":5225,"articleLive":2,"columnArticles":66,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15615,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3752603082049146,"acs":2703,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7203,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.302099533437014,"acs":777,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2572,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5903597122302159,"acs":4103,"articleLive":2,"columnArticles":60,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6950,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7171643054693233,"acs":25412,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35434,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5130267739224397,"acs":8546,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16658,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5947330505082846,"acs":7430,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12493,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36320598921061326,"acs":3299,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9083,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8408104196816208,"acs":581,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":691,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5898168988381288,"acs":9696,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16439,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5527153643227508,"acs":6076,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10993,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5469361837231453,"acs":5168,"articleLive":2,"columnArticles":77,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9449,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.577896897810219,"acs":5067,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8768,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.678658635845678,"acs":4169,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6143,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488705058860961,"acs":58696,"articleLive":2,"columnArticles":745,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69146,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37982206038954347,"acs":11057,"articleLive":2,"columnArticles":149,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29111,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.32330332552308133,"acs":7865,"articleLive":2,"columnArticles":137,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24327,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34277620396600567,"acs":3146,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9178,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7332049636285837,"acs":3427,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4674,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6746285652315367,"acs":24883,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36884,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2975939443092728,"acs":5504,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18495,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33280360217189775,"acs":2513,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7551,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3967848557692308,"acs":2641,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6656,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7086538461538462,"acs":737,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1040,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5774174869716271,"acs":9972,"articleLive":2,"columnArticles":171,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17270,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4276129032258065,"acs":4971,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11625,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.661963190184049,"acs":5395,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8150,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6155646576945583,"acs":3156,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5127,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5027383794410898,"acs":3580,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7121,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851259181532004,"acs":29929,"articleLive":2,"columnArticles":359,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38120,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6908441407160053,"acs":8896,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12877,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5672587175133864,"acs":8687,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15314,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3281417830290011,"acs":1833,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5586,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6148555708390646,"acs":2682,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4362,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6189473684210526,"acs":294,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":475,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7893090440702917,"acs":17158,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21738,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4532310011649421,"acs":13228,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29186,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4402360515021459,"acs":4103,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9320,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36628529097045026,"acs":4450,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12149,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5990566037735849,"acs":127,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":212,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5392243785505533,"acs":16421,"articleLive":2,"columnArticles":247,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30453,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3175931981687377,"acs":4856,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15290,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4611038006037619,"acs":5957,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12919,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3839616810877627,"acs":2485,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6472,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.55175652827353,"acs":2937,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5323,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5461759663772604,"acs":19753,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36166,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.553921206297583,"acs":7494,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13529,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41412520064205455,"acs":5160,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12460,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5368950013224015,"acs":4060,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7562,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7119675456389453,"acs":351,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":493,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6686632180778656,"acs":2456,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3673,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6592636248022581,"acs":21254,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32239,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8168664133294359,"acs":11178,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13684,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.511070007286587,"acs":9118,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17841,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29578488372093026,"acs":7733,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26144,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7101063829787234,"acs":534,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":752,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43853290808930123,"acs":3025,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6898,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5788042028908208,"acs":10852,"articleLive":2,"columnArticles":165,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18749,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7682772083943387,"acs":7871,"articleLive":2,"columnArticles":107,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10245,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6227886892324836,"acs":4471,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7179,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36603853037161804,"acs":3477,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9499,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5750066613375966,"acs":8632,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15012,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7800013430931435,"acs":11615,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14891,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3095429029671211,"acs":4246,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13717,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3783757992174826,"acs":3965,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10479,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5412844036697247,"acs":649,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1199,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7252232142857142,"acs":3249,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4480,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44556019406521497,"acs":7898,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17726,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3986469477658905,"acs":12669,"articleLive":2,"columnArticles":202,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":31780,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45617459190915544,"acs":2571,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5636,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47370848708487084,"acs":2054,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4336,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8975903614457831,"acs":1639,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1826,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7586206896551724,"acs":3410,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4495,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048986486486487,"acs":19060,"articleLive":2,"columnArticles":321,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23680,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29503414440098125,"acs":4450,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15083,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3265670004114662,"acs":4762,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14582,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5955631399317406,"acs":4188,"articleLive":2,"columnArticles":67,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7032,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47618921285119253,"acs":17949,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37693,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32497773253594603,"acs":5108,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15718,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5825081625006691,"acs":10883,"articleLive":2,"columnArticles":203,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18683,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.618835115795953,"acs":16086,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25994,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.632420091324201,"acs":277,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":438,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8075052119527449,"acs":3486,"articleLive":2,"columnArticles":46,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4317,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6711167620258529,"acs":9501,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14157,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6852599882491187,"acs":18661,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27232,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.664302298879902,"acs":26036,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39193,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299656605819628,"acs":2379,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5533,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6254071661237784,"acs":384,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":614,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8253400143163923,"acs":3459,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4191,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8391976134929438,"acs":43885,"articleLive":2,"columnArticles":697,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52294,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2935870977604525,"acs":3841,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13083,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26849456802897054,"acs":3633,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13531,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5786458333333333,"acs":1111,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1920,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44503372341038794,"acs":7720,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17347,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5312345312345312,"acs":5366,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10101,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3138313831383138,"acs":4184,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13332,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46505905511811024,"acs":1890,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4064,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7491525423728813,"acs":2431,"articleLive":2,"columnArticles":41,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3245,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628959276018099,"acs":293,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":442,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6724232623421005,"acs":11019,"articleLive":2,"columnArticles":149,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16387,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4194984257952448,"acs":3864,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9211,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6787825177918058,"acs":16882,"articleLive":2,"columnArticles":206,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24871,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4898739873987399,"acs":2177,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4444,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7835400225479143,"acs":695,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":887,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443773316752532,"acs":57036,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67548,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41531990259021473,"acs":3752,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9034,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7358003442340791,"acs":3420,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4648,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3412531539108494,"acs":1623,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4756,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5459047619047619,"acs":2866,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5250,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6393581631987476,"acs":9802,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15331,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.512002279364627,"acs":7188,"articleLive":2,"columnArticles":124,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14039,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2701215317587709,"acs":2356,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8722,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6100262314194113,"acs":2093,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3431,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7355371900826446,"acs":445,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":605,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7223906453009961,"acs":1668,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2309,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.821190765492102,"acs":16896,"articleLive":2,"columnArticles":286,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20575,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49682717431877566,"acs":5324,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10716,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27575957727873185,"acs":5010,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18168,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6210675150229763,"acs":1757,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2829,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5910780669144982,"acs":318,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":538,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6740027510316369,"acs":7350,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10905,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37154447115384615,"acs":2473,"articleLive":2,"columnArticles":43,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6656,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44086288122985373,"acs":1778,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4033,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.1497335916686849,"acs":2473,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16516,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7835240274599542,"acs":3424,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4370,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6256903811450757,"acs":11442,"articleLive":2,"columnArticles":197,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18287,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5429680280909259,"acs":2938,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5411,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38650004919807146,"acs":3928,"articleLive":2,"columnArticles":84,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10163,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3811673151750973,"acs":2449,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6425,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8417721518987342,"acs":399,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":474,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5241210139002453,"acs":8333,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15899,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7682283586720446,"acs":7428,"articleLive":2,"columnArticles":115,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9669,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49341261513349655,"acs":25392,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51462,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3188028627195836,"acs":1470,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4611,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6563557274045433,"acs":2716,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4138,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5242718446601942,"acs":432,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":824,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5482807348092322,"acs":1164,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2123,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7071022062836205,"acs":9070,"articleLive":2,"columnArticles":177,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12827,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8066023515224601,"acs":5351,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6634,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7116455696202532,"acs":2811,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3950,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40114249444620753,"acs":1264,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3151,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6602644180720383,"acs":12685,"articleLive":2,"columnArticles":217,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19212,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.770814739257937,"acs":12091,"articleLive":2,"columnArticles":278,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15686,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45111312722450975,"acs":6464,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14329,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45197513535191497,"acs":2254,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4987,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5471882640586797,"acs":1119,"articleLive":2,"columnArticles":23,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2045,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.41030927835051545,"acs":796,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1940,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5365759950822192,"acs":34915,"articleLive":2,"columnArticles":356,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65070,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5149396058486968,"acs":7290,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14157,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2776045414567842,"acs":3472,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12507,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4740271830199218,"acs":2546,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5371,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.795369211514393,"acs":1271,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1598,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6823529411764706,"acs":754,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1105,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.656497175141243,"acs":6972,"articleLive":2,"columnArticles":177,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10620,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.506805994775196,"acs":3686,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7273,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27381518465683946,"acs":3455,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12618,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3832699619771863,"acs":2016,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5260,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7812966835972512,"acs":7845,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10041,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46472184531886024,"acs":5480,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11792,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29960277385040057,"acs":8900,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29706,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4125230202578269,"acs":1344,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3258,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7420560747663552,"acs":397,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":535,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7241086587436333,"acs":2559,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3534,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8122277596829258,"acs":20698,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25483,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725498990805113,"acs":7659,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13377,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5449682042999899,"acs":5399,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9907,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6635514018691588,"acs":5183,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7811,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6029858999170583,"acs":2181,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3617,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4438107582631238,"acs":6848,"articleLive":2,"columnArticles":129,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15430,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7584253083869444,"acs":12850,"articleLive":2,"columnArticles":236,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16943,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5268088253420437,"acs":4274,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8113,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46745832381822333,"acs":2047,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4379,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.850949883193018,"acs":38611,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45374,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35421844956150633,"acs":7553,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21323,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3640980989696706,"acs":2509,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6891,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4365702824669898,"acs":2612,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5983,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7632311977715878,"acs":822,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1077,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.38958776853106253,"acs":2013,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5167,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8300756170637752,"acs":17454,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21027,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49713302752293576,"acs":6936,"articleLive":2,"columnArticles":112,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13952,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4645527197731374,"acs":5406,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11637,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38450339695891295,"acs":2377,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6182,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5206349206349207,"acs":328,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":630,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8957688338493293,"acs":3472,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3876,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8280547409579667,"acs":16942,"articleLive":2,"columnArticles":356,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20460,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5995456758072367,"acs":3695,"articleLive":2,"columnArticles":85,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6163,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4711126961483595,"acs":2642,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5608,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.40277194456110876,"acs":959,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2381,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8057219164778245,"acs":19911,"articleLive":2,"columnArticles":267,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24712,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8671208530805687,"acs":14637,"articleLive":2,"columnArticles":191,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16880,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5173602853745541,"acs":4351,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8410,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4889911929543635,"acs":2443,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4996,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6510791366906474,"acs":181,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":278,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8002827854365501,"acs":2264,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2829,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6355293346443789,"acs":7756,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12204,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4618181818181818,"acs":6223,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13475,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.398128103909334,"acs":6253,"articleLive":2,"columnArticles":112,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15706,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5258829221093372,"acs":2174,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4134,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5246636771300448,"acs":468,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":892,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7982062780269058,"acs":1780,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2230,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7098997493734336,"acs":7931,"articleLive":2,"columnArticles":181,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11172,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6101694915254238,"acs":3888,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6372,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47766990291262135,"acs":2952,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6180,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3834834834834835,"acs":1277,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3330,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.781785392245266,"acs":12138,"articleLive":2,"columnArticles":185,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15526,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3469227041434456,"acs":5727,"articleLive":2,"columnArticles":120,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16508,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5852797392721347,"acs":4310,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7364,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.503141305505271,"acs":14175,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28173,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6997759522031367,"acs":937,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1339,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.703232125367287,"acs":1436,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2042,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6943076738321124,"acs":11563,"articleLive":2,"columnArticles":184,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16654,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3591242617669868,"acs":30100,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83815,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2623782974119997,"acs":6306,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24034,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4960525064206221,"acs":15645,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31539,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.638961038961039,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":385,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7294067434912506,"acs":1709,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2343,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.674642711310739,"acs":8261,"articleLive":2,"columnArticles":193,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12245,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4329244163039177,"acs":2188,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5054,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4908863920099875,"acs":1966,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4005,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.36965436438195665,"acs":631,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1707,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8691961029975503,"acs":46482,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53477,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6459355920028732,"acs":10791,"articleLive":2,"columnArticles":167,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16706,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5151054118669854,"acs":4740,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9202,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5064932235150564,"acs":23245,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45894,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5621890547263682,"acs":339,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":603,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.788234431159686,"acs":10746,"articleLive":2,"columnArticles":146,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13633,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4801459727170041,"acs":5526,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11509,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5750461177259768,"acs":3429,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5963,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3578099838969404,"acs":1111,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3105,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6220040427375109,"acs":2154,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3463,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.531523642732049,"acs":607,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1142,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4720785935884178,"acs":1826,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3868,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7921688752746887,"acs":11896,"articleLive":2,"columnArticles":204,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15017,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45857668180834954,"acs":2120,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4623,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.723256776329402,"acs":27964,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38664,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48861480075901326,"acs":1030,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2108,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4492188114605787,"acs":28551,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63557,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31060018944286577,"acs":3607,"articleLive":2,"columnArticles":103,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11613,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539274716183298,"acs":28455,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43514,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4708653175157013,"acs":2699,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5732,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7019464720194647,"acs":577,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":822,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8410947712418301,"acs":2059,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2448,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7093902234167646,"acs":8446,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11906,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.696917808219178,"acs":22385,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32120,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36279171098665913,"acs":28309,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78031,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4847919655667145,"acs":3379,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6970,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5940730530668504,"acs":862,"articleLive":2,"columnArticles":36,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1451,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7030916844349681,"acs":1319,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1876,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7491097225021837,"acs":11149,"articleLive":2,"columnArticles":222,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14883,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5321671244759288,"acs":3681,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6917,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4572511582198512,"acs":3257,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7123,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4705503009458297,"acs":2189,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4652,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6806053650839191,"acs":9489,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13942,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6294858342077649,"acs":5999,"articleLive":2,"columnArticles":128,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9530,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4221442885771543,"acs":4213,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9980,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.40758228023885573,"acs":2935,"articleLive":2,"columnArticles":50,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7201,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7966457023060797,"acs":380,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":477,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9205917874396136,"acs":3049,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3312,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6378113879003559,"acs":7169,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11240,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42922459643556965,"acs":4600,"articleLive":2,"columnArticles":96,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10717,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5389778007227671,"acs":4176,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7748,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43015925680159256,"acs":2593,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6028,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6877551020408164,"acs":674,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":980,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6098434004474272,"acs":4089,"articleLive":2,"columnArticles":81,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6705,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4755573736960524,"acs":2325,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4889,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5520976353928299,"acs":3619,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6555,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37606837606837606,"acs":1408,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3744,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7884250474383302,"acs":831,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1054,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7657548940734782,"acs":11422,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14916,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8562823449563078,"acs":10093,"articleLive":2,"columnArticles":171,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11787,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37018756169792694,"acs":4125,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11143,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3656891955464952,"acs":2332,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6377,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5186846038863976,"acs":347,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":669,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8426689065042784,"acs":16052,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19049,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5507726269315674,"acs":5988,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10872,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.474390243902439,"acs":4279,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9020,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46149830331506136,"acs":1768,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3831,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7813360382553253,"acs":5392,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6901,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.515850144092219,"acs":179,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":347,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.647787610619469,"acs":5490,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8475,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6650840029218408,"acs":5463,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8214,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5194624064916952,"acs":4097,"articleLive":2,"columnArticles":60,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7887,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29228522754928205,"acs":1201,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4109,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7980066445182724,"acs":1201,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1505,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4213467048710602,"acs":8823,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20940,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34980572429267226,"acs":6392,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18273,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34170097399337285,"acs":3403,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9959,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541345032487366,"acs":11779,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18007,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7169230769230769,"acs":233,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":325,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7119889756545705,"acs":1550,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2177,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6451771896101336,"acs":13090,"articleLive":2,"columnArticles":143,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20289,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8091115067162972,"acs":9999,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12358,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5137750721923047,"acs":6583,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12813,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4143646408839779,"acs":3900,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9412,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5807560137457045,"acs":169,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":291,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7861075815332487,"acs":1856,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2361,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48833604015945664,"acs":6615,"articleLive":2,"columnArticles":121,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13546,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5739252455670366,"acs":4499,"articleLive":2,"columnArticles":71,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7839,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5213921901528014,"acs":3071,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5890,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5184286029574046,"acs":2349,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4531,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6833543682512971,"acs":9746,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14262,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3789184234647113,"acs":4134,"articleLive":2,"columnArticles":109,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10910,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2625187781672509,"acs":4194,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15976,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40925747348119573,"acs":2122,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5185,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.57125,"acs":457,"articleLive":2,"columnArticles":27,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":800,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48841623883687824,"acs":11321,"articleLive":2,"columnArticles":148,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23179,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6627787746731607,"acs":5171,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7802,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5862280971411005,"acs":5721,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9759,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2679100383982447,"acs":2442,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9115,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6255924170616114,"acs":1716,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2743,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6216216216216216,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":296,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6617760617760617,"acs":857,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1295,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7945529899348727,"acs":8052,"articleLive":2,"columnArticles":190,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10134,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5135342676137454,"acs":5350,"articleLive":2,"columnArticles":73,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10418,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3449078564500485,"acs":3556,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10310,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2985341437254201,"acs":1670,"articleLive":2,"columnArticles":39,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5594,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7530631479736098,"acs":10387,"articleLive":2,"columnArticles":153,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13793,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6985517402476057,"acs":5981,"articleLive":2,"columnArticles":96,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8562,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3736738075167863,"acs":25711,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68806,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3681782020684169,"acs":2314,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6285,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5049019607843137,"acs":103,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":204,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.901946382666177,"acs":2456,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2723,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8097885637758208,"acs":19954,"articleLive":2,"columnArticles":199,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24641,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7149275239467662,"acs":8434,"articleLive":2,"columnArticles":104,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11797,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.657055630936228,"acs":7748,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11792,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2860394537177542,"acs":2639,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9226,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4386252045826514,"acs":268,"articleLive":2,"columnArticles":21,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":611,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7952549814251942,"acs":9419,"articleLive":2,"columnArticles":138,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11844,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8673766816143498,"acs":7737,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8920,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6826295914864401,"acs":3977,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5826,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4875141884222474,"acs":859,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1762,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7385129490392648,"acs":884,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1197,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8247511899610558,"acs":13342,"articleLive":2,"columnArticles":212,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16177,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6845203522597052,"acs":43606,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63703,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35113964308852114,"acs":5962,"articleLive":2,"columnArticles":129,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16979,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5097155730780062,"acs":3620,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7102,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7094017094017094,"acs":415,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":585,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.795784061696658,"acs":7739,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9725,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4294014503090823,"acs":28897,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67296,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5748010610079576,"acs":6501,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11310,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3895175699821322,"acs":1962,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5037,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5137872819358469,"acs":913,"articleLive":2,"columnArticles":28,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1777,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6555555555555556,"acs":118,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":180,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5076551168412571,"acs":630,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1241,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8006299580027998,"acs":6863,"articleLive":2,"columnArticles":112,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8572,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5345937912813739,"acs":6475,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12112,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336553945249598,"acs":27545,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43470,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36048848353686813,"acs":2332,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6469,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6829031973927596,"acs":7753,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11353,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3283337239278181,"acs":5604,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17068,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6095750128008193,"acs":2381,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3906,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40104690960338235,"acs":1992,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4967,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7142857142857143,"acs":190,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":266,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6460396039603961,"acs":1044,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1616,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7889858602259657,"acs":11662,"articleLive":2,"columnArticles":121,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14781,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6813779655508613,"acs":10483,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15385,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3566960705693665,"acs":4448,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12470,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45115600916475734,"acs":2166,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4801,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6338289962825279,"acs":341,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":538,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7667970933482392,"acs":6859,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8945,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7716369218959892,"acs":4021,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5211,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6185778108711839,"acs":3323,"articleLive":2,"columnArticles":68,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5372,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31274292059966685,"acs":2253,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7204,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9058874086807047,"acs":12648,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13962,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38695113314447593,"acs":4371,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11296,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5129000969932105,"acs":5288,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10310,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5975215517241379,"acs":2218,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3712,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7433234421364985,"acs":501,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":674,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5467128027681661,"acs":158,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":289,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.788373247301154,"acs":12707,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16118,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4556762332382744,"acs":7510,"articleLive":2,"columnArticles":71,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16481,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2763559087129262,"acs":5982,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21646,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6210171568627451,"acs":2027,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3264,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8119858989424207,"acs":2073,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2553,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.893491124260355,"acs":302,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":338,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7463768115942029,"acs":412,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":552,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7277771077071523,"acs":6034,"articleLive":2,"columnArticles":94,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8291,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8202704130136262,"acs":31062,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37868,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4291433146517214,"acs":2144,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4996,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41298066236941544,"acs":1858,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4499,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7717617659308621,"acs":7412,"articleLive":2,"columnArticles":99,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9604,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3530480656506448,"acs":6023,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17060,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2782052258703436,"acs":3652,"articleLive":2,"columnArticles":110,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13127,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3757562662057044,"acs":1739,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4628,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6892959770114943,"acs":1919,"articleLive":2,"columnArticles":37,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2784,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5211864406779662,"acs":246,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":472,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5712462781794981,"acs":5372,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9404,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6457755359394703,"acs":5121,"articleLive":2,"columnArticles":65,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7930,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31714580231359524,"acs":2769,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8731,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2705791704122255,"acs":2107,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7787,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7070631970260223,"acs":951,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1345,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4693200663349917,"acs":283,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":603,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.33725761772853186,"acs":487,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1444,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5912753699589562,"acs":31405,"articleLive":2,"columnArticles":409,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53114,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45819179029807416,"acs":37092,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":80953,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5310647073988142,"acs":2060,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3879,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5056784219964137,"acs":846,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1673,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5311203319502075,"acs":6272,"articleLive":2,"columnArticles":78,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11809,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30994597062628415,"acs":4073,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13141,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6292153872225047,"acs":3713,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5901,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43608498780912575,"acs":1252,"articleLive":2,"columnArticles":35,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2871,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6619469026548672,"acs":748,"articleLive":2,"columnArticles":27,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1130,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.44886363636363635,"acs":79,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":176,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6436542953542694,"acs":7440,"articleLive":2,"columnArticles":102,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11559,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2788753176489876,"acs":3402,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12199,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.570357833655706,"acs":4718,"articleLive":2,"columnArticles":94,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8272,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4233390119250426,"acs":2485,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5870,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5899632802937577,"acs":482,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":817,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6666666666666666,"acs":166,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":249,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3256611165523996,"acs":4655,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14294,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.675411047478293,"acs":3656,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5413,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.571604938271605,"acs":3241,"articleLive":2,"columnArticles":69,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5670,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.26941707031902457,"acs":1613,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":5987,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8370971053171833,"acs":8155,"articleLive":2,"columnArticles":83,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9742,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44060416383181383,"acs":3238,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7349,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3912804291019117,"acs":2845,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7271,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5517403574788335,"acs":1173,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2126,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.288117770767613,"acs":274,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":951,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.48880597014925375,"acs":131,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":268,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3922924901185771,"acs":397,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1012,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9150894252474387,"acs":10540,"articleLive":2,"columnArticles":92,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11518,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34405445915563326,"acs":5509,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16012,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3609093039606281,"acs":4620,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12801,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23691767708998085,"acs":1485,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6268,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.37579617834394907,"acs":59,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":157,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6945496939667736,"acs":4766,"articleLive":2,"columnArticles":59,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6862,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3442088091353997,"acs":3587,"articleLive":2,"columnArticles":60,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10421,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4126874279123414,"acs":1789,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4335,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3965272856130404,"acs":2238,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5644,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9141496801071269,"acs":12288,"articleLive":2,"columnArticles":107,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13442,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.47942708333333334,"acs":5523,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11520,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5605479452054795,"acs":2046,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3650,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3272235576923077,"acs":1089,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3328,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5440993788819876,"acs":438,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":805,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7382198952879581,"acs":282,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":382,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7395466549295775,"acs":6721,"articleLive":2,"columnArticles":94,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9088,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44991579116208197,"acs":5610,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12469,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2423636223743941,"acs":3150,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12997,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34537177541729897,"acs":1138,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3295,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6259097525473072,"acs":430,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":687,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7954070981210856,"acs":381,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":479,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7723091818621913,"acs":4786,"articleLive":2,"columnArticles":84,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6197,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3921030984370716,"acs":2860,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7294,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4077922077922078,"acs":1884,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4620,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5780193946517779,"acs":1967,"articleLive":2,"columnArticles":52,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3403,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6641920065086953,"acs":6531,"articleLive":2,"columnArticles":75,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9833,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3041640486662478,"acs":5325,"articleLive":2,"columnArticles":81,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17507,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5414245168265982,"acs":4006,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7399,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5149572649572649,"acs":964,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1872,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5379464285714286,"acs":241,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":448,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5523012552301255,"acs":132,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":239,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6681514476614699,"acs":300,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":449,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5458849522607118,"acs":6918,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12673,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3253797759705386,"acs":4241,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13034,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4809452102397776,"acs":4152,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8633,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49617737003058104,"acs":2596,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5232,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4440894568690096,"acs":139,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":313,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6056872037914692,"acs":4473,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7385,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42333163525216505,"acs":2493,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5889,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41386138613861384,"acs":1463,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3535,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27742805755395683,"acs":617,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2224,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5347725520431765,"acs":6936,"articleLive":2,"columnArticles":64,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12970,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4306382978723404,"acs":5566,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12925,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6146853146853147,"acs":4395,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7150,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38328424153166424,"acs":3123,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8148,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7369519832985386,"acs":353,"articleLive":2,"columnArticles":13,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":479,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7241379310344828,"acs":42,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":58,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7779207411219763,"acs":6046,"articleLive":2,"columnArticles":57,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7772,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35799044536908614,"acs":4646,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12978,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27943153447282504,"acs":2910,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10414,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47966768692610406,"acs":2194,"articleLive":2,"columnArticles":49,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4574,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5551763367463026,"acs":488,"articleLive":2,"columnArticles":19,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":879,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4552238805970149,"acs":183,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":402,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7405159332321699,"acs":3904,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5272,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3814883474576271,"acs":2881,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7552,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28911764705882353,"acs":1966,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6800,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24689284514612025,"acs":735,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2977,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5354166666666667,"acs":257,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":480,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8126509993410937,"acs":7400,"articleLive":2,"columnArticles":83,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9106,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5808359226220307,"acs":5795,"articleLive":2,"columnArticles":92,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9977,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2984213319182807,"acs":4499,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15076,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4573816155988858,"acs":821,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1795,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6621621621621622,"acs":49,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":74,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5804784107034259,"acs":5727,"articleLive":2,"columnArticles":63,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9866,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4126541397533764,"acs":5622,"articleLive":2,"columnArticles":79,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13624,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2755204705518149,"acs":3560,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12921,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4609604704344985,"acs":1411,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3061,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6764705882352942,"acs":184,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":272,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.449438202247191,"acs":40,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":89,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6066666666666667,"acs":182,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":300,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6604987932421561,"acs":4105,"articleLive":2,"columnArticles":57,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6215,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5942205942205943,"acs":2920,"articleLive":2,"columnArticles":56,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4914,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38466494845360827,"acs":1791,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4656,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.36292032717358375,"acs":1198,"articleLive":2,"columnArticles":35,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3301,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5513766959297686,"acs":5527,"articleLive":2,"columnArticles":46,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10024,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2466663207596119,"acs":4754,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19273,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34123998036970393,"acs":2086,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6113,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.41906005221932113,"acs":1605,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3830,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6588235294117647,"acs":56,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":85,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7783783783783784,"acs":6624,"articleLive":2,"columnArticles":85,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8510,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3580866471858722,"acs":5637,"articleLive":2,"columnArticles":124,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15742,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5711245703061057,"acs":3489,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6109,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3920908708456037,"acs":1864,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4754,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.40669856459330145,"acs":85,"articleLive":2,"columnArticles":4,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":209,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6829268292682927,"acs":28,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":41,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8845022069641981,"acs":3607,"articleLive":2,"columnArticles":48,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4078,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.29654017857142856,"acs":2657,"articleLive":2,"columnArticles":49,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":8960,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.41879111842105265,"acs":2037,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4864,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4138817480719794,"acs":1288,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3112,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6444444444444445,"acs":58,"articleLive":2,"columnArticles":3,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":90,"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.9048580077843448,"acs":6277,"articleLive":2,"columnArticles":51,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":6937,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.35502133960456406,"acs":4076,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11481,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32697416083071723,"acs":2708,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8282,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5202115602568946,"acs":1377,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2647,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8648648648648649,"acs":32,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":37,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5542777300085985,"acs":5157,"articleLive":2,"columnArticles":65,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9304,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34598765432098766,"acs":3363,"articleLive":2,"columnArticles":89,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9720,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.4094922737306843,"acs":1855,"articleLive":2,"columnArticles":48,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4530,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34310051107325384,"acs":1007,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2935,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8403361344537815,"acs":100,"articleLive":2,"columnArticles":4,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":119,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.76,"acs":38,"articleLive":2,"columnArticles":4,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":50,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6583374567046016,"acs":2661,"articleLive":2,"columnArticles":32,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4042,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7576584774037003,"acs":2498,"articleLive":2,"columnArticles":36,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3297,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4755145493257629,"acs":2010,"articleLive":2,"columnArticles":52,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4227,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2543366150961088,"acs":1085,"articleLive":2,"columnArticles":37,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4266,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9103448275862069,"acs":132,"articleLive":2,"columnArticles":8,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":145,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.547309573724668,"acs":3916,"articleLive":2,"columnArticles":40,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7155,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.42075801749271136,"acs":3608,"articleLive":2,"columnArticles":52,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":8575,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.21514729761076318,"acs":1855,"articleLive":2,"columnArticles":65,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8622,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.33840052875082616,"acs":1024,"articleLive":2,"columnArticles":36,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3026,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.7222222222222222,"acs":13,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":18,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6709462672372801,"acs":4233,"articleLive":2,"columnArticles":64,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":6309,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.37398785425101216,"acs":2956,"articleLive":2,"columnArticles":56,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":7904,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.2816247582205029,"acs":2184,"articleLive":2,"columnArticles":54,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"notac","submitted":7755,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.2530746105493304,"acs":926,"articleLive":2,"columnArticles":28,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":3659,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.8451224717112729,"acs":81185,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96063,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.690824434434941,"acs":13650,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19759,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21927577918751723,"acs":11130,"articleLive":2,"columnArticles":183,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50758,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3774245296777016,"acs":2588,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6857,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.2001169704649576,"acs":2053,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10259,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8397524600246002,"acs":43694,"articleLive":2,"columnArticles":659,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52032,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7695095528855623,"acs":39068,"articleLive":2,"columnArticles":470,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50770,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28815969062784347,"acs":5067,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17584,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27539994974453474,"acs":6576,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23878,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5888707037643208,"acs":1799,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3055,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6894167167769092,"acs":6879,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9978,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4105500160823416,"acs":6382,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15545,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6119886069394096,"acs":9454,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15448,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21078279702970298,"acs":2725,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12928,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5768194070080862,"acs":856,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1484,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3113496932515337,"acs":609,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1956,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7989929370416681,"acs":23643,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29591,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2865508587175828,"acs":17469,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":60963,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163635409285358,"acs":19675,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38103,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3123571805238179,"acs":1777,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5689,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3355426677713339,"acs":810,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2414,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3333953765402226,"acs":8956,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26863,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33806085611139763,"acs":2622,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7756,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2817985833076686,"acs":915,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3247,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33200114187838997,"acs":1163,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3503,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3351482153660012,"acs":554,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1653,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32886435331230285,"acs":1251,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3804,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28212576424046254,"acs":10198,"articleLive":2,"columnArticles":173,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36147,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1866146657345745,"acs":5072,"articleLive":2,"columnArticles":123,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27179,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34921426789723126,"acs":5600,"articleLive":2,"columnArticles":97,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16036,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2521611721611722,"acs":1721,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6825,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40488182874854706,"acs":1045,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2581,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21702332291416207,"acs":4513,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20795,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4828944640265395,"acs":2329,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4823,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3979310344827586,"acs":1154,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2900,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2614290551981036,"acs":772,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2953,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19264448336252188,"acs":770,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3997,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5645355850422196,"acs":468,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":829,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5035002692514808,"acs":3740,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7428,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.231496062992126,"acs":2793,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12065,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.41644993498049415,"acs":1281,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3076,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19902248289345065,"acs":1018,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5115,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.39570552147239263,"acs":387,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":978,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8564650059311981,"acs":2166,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2529,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18517165814463113,"acs":1014,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5476,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.36589620584387267,"acs":839,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2293,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3526989935956084,"acs":771,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2186,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15146396396396397,"acs":269,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1776,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22396694214876034,"acs":271,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1210,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5444867919568932,"acs":4143,"articleLive":2,"columnArticles":96,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7609,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6974928072338676,"acs":3394,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4866,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4136664217487142,"acs":1689,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4083,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678146196076843,"acs":401824,"articleLive":2,"columnArticles":2796,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":592533,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40319150900429596,"acs":262039,"articleLive":2,"columnArticles":2093,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":649912,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7608464263586827,"acs":287358,"articleLive":2,"columnArticles":1945,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":377682,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7514694012963412,"acs":303523,"articleLive":2,"columnArticles":2087,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":403906,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6977951429128543,"acs":189667,"articleLive":2,"columnArticles":1449,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":271809,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7155177546016919,"acs":264411,"articleLive":2,"columnArticles":1668,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":369538,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600633927390219,"acs":264001,"articleLive":2,"columnArticles":1859,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":733207,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44381962648372236,"acs":195890,"articleLive":2,"columnArticles":1314,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":441373,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4930718841320042,"acs":262545,"articleLive":2,"columnArticles":1635,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":532468,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.452266580658124,"acs":171073,"articleLive":2,"columnArticles":1143,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":378257,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5265463091550048,"acs":177444,"articleLive":2,"columnArticles":1711,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":336996,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5693203771725014,"acs":158250,"articleLive":2,"columnArticles":1310,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":277963,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3119614970382337,"acs":83421,"articleLive":2,"columnArticles":491,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":267408,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7472061916631112,"acs":199652,"articleLive":2,"columnArticles":1254,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":267198,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3397785223527354,"acs":124327,"articleLive":2,"columnArticles":760,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":365906,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7772417707150965,"acs":150645,"articleLive":2,"columnArticles":1130,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":193820,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.596693162549404,"acs":189320,"articleLive":2,"columnArticles":1461,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":317282,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37677539398381776,"acs":66823,"articleLive":2,"columnArticles":446,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":177355,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2419340139966501,"acs":76988,"articleLive":2,"columnArticles":858,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":318219,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6431694007154747,"acs":194351,"articleLive":2,"columnArticles":1636,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":302177,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7980241057874619,"acs":261795,"articleLive":2,"columnArticles":2449,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":328054,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7427670900379792,"acs":293162,"articleLive":2,"columnArticles":1830,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":394689,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7285993935138146,"acs":185728,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":254911,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4655626093732037,"acs":145790,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":313148,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.791907395265018,"acs":192032,"articleLive":2,"columnArticles":1406,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":242493,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801252493604411,"acs":150347,"articleLive":2,"columnArticles":1087,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":259163,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4400906207521522,"acs":145692,"articleLive":2,"columnArticles":1484,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":331050,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5686328743511114,"acs":141854,"articleLive":2,"columnArticles":941,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":249465,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6156990160222919,"acs":113131,"articleLive":2,"columnArticles":949,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":183744,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.644509212227991,"acs":137546,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":213412,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6866109539470396,"acs":137373,"articleLive":2,"columnArticles":1097,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":200074,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5888829518659954,"acs":120128,"articleLive":2,"columnArticles":1139,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":203993,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5513916389765944,"acs":113338,"articleLive":2,"columnArticles":952,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":205549,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5768481484035584,"acs":133838,"articleLive":2,"columnArticles":872,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":232016,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7202355608062321,"acs":120100,"articleLive":2,"columnArticles":829,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":166751,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6545940097440163,"acs":104665,"articleLive":2,"columnArticles":901,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":159893,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5612295883268764,"acs":77503,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138095,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792682703674019,"acs":158281,"articleLive":2,"columnArticles":1116,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":273243,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6912013571045159,"acs":168687,"articleLive":2,"columnArticles":1026,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":244049,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5703419955026005,"acs":248052,"articleLive":2,"columnArticles":1814,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":434918,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5814164815596717,"acs":63343,"articleLive":2,"columnArticles":461,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":108946,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054899718148768,"acs":222345,"articleLive":2,"columnArticles":1526,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":367215,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4859768892041257,"acs":49332,"articleLive":2,"columnArticles":512,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":101511,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41512626337914793,"acs":55695,"articleLive":2,"columnArticles":464,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":134164,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5611532625189681,"acs":109091,"articleLive":2,"columnArticles":806,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":194405,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5359831739142084,"acs":120027,"articleLive":2,"columnArticles":1442,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":223938,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6890453028576716,"acs":119138,"articleLive":2,"columnArticles":994,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":172903,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4645352653567025,"acs":151445,"articleLive":2,"columnArticles":1039,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":326014,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514460565118737,"acs":88140,"articleLive":2,"columnArticles":518,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":135299,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6145989028382748,"acs":153375,"articleLive":2,"columnArticles":1058,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":249553,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48291437084683236,"acs":102105,"articleLive":2,"columnArticles":848,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":211435,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6498569119674975,"acs":175308,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":269764,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5379974987125726,"acs":190138,"articleLive":2,"columnArticles":1589,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":353418,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44728194111359854,"acs":168229,"articleLive":2,"columnArticles":1473,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":376114,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7567488358461689,"acs":162673,"articleLive":2,"columnArticles":1143,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":214963,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7900103752454658,"acs":177415,"articleLive":2,"columnArticles":1269,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":224573,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5881591024112405,"acs":137134,"articleLive":2,"columnArticles":939,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":233158,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.69871822065998,"acs":115292,"articleLive":2,"columnArticles":1032,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":165005,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.800258817064199,"acs":90286,"articleLive":2,"columnArticles":698,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":112821,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6661705758622058,"acs":134284,"articleLive":2,"columnArticles":844,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":201576,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7073310540038755,"acs":139439,"articleLive":2,"columnArticles":1859,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":197134,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.441841149458936,"acs":129801,"articleLive":2,"columnArticles":978,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":293773,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.857894209577239,"acs":205524,"articleLive":2,"columnArticles":1788,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":239568,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4442579433697179,"acs":131543,"articleLive":2,"columnArticles":1190,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":296096,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4752740903015747,"acs":94590,"articleLive":2,"columnArticles":1066,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":199022,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5615429513149763,"acs":65422,"articleLive":2,"columnArticles":591,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":116504,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45969306913065927,"acs":103282,"articleLive":2,"columnArticles":982,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":224676,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6555184742324464,"acs":110192,"articleLive":2,"columnArticles":766,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":168099,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6339641844573146,"acs":130809,"articleLive":2,"columnArticles":954,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":206335,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8569101951252868,"acs":137852,"articleLive":2,"columnArticles":1299,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":160871,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5841310029402156,"acs":71521,"articleLive":2,"columnArticles":495,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":122440,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5976951197521352,"acs":72920,"articleLive":2,"columnArticles":526,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":122002,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28659708526924493,"acs":68593,"articleLive":2,"columnArticles":555,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":239336,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6941353507209574,"acs":118087,"articleLive":2,"columnArticles":690,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":170121,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7006156436790532,"acs":117330,"articleLive":2,"columnArticles":690,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":167467,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2020012353304509,"acs":8176,"articleLive":2,"columnArticles":109,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":40475,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5744196631770596,"acs":7572,"articleLive":2,"columnArticles":125,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":13182,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7828794420458319,"acs":9429,"articleLive":2,"columnArticles":143,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":12044,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6876951905059338,"acs":7707,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":11207,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7137249936692833,"acs":5637,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":7898,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6648077487525682,"acs":6795,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":10221,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4548787146088449,"acs":5832,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":12821,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5083137459737094,"acs":5839,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":11487,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5505955822828726,"acs":4761,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":8647,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.435146097177386,"acs":5257,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12081,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5657776445909499,"acs":3776,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6674,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6608396618426708,"acs":4612,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":6979,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6533497234173326,"acs":3189,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":4881,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5053008398733306,"acs":3670,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7263,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6401564537157758,"acs":2946,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4602,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4973695747479176,"acs":4538,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9124,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5192066805845511,"acs":2487,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4790,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5305770887166236,"acs":4312,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8127,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4749739311783107,"acs":3644,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":7672,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7040437585465912,"acs":3604,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5119,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5364691872581125,"acs":5406,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10077,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5225396301188904,"acs":6329,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":12112,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7036690085870414,"acs":4507,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6405,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7706923477355544,"acs":11844,"articleLive":2,"columnArticles":121,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":15368,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6041269841269842,"acs":3806,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6300,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6487865203277168,"acs":4197,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6469,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6070094800344729,"acs":6339,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":10443,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6238332296204107,"acs":2005,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3214,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2948700686683722,"acs":2190,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":7427,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5447968836950473,"acs":1958,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3594,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5598526703499079,"acs":2432,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4344,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6030042918454935,"acs":3091,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5126,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7973061760840998,"acs":2427,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3044,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5813953488372093,"acs":2225,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":3827,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6862980769230769,"acs":2284,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3328,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5824150058616647,"acs":2484,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4265,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4400386847195358,"acs":2730,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6204,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7793038124556003,"acs":3291,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4223,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5187896534895071,"acs":2126,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4098,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5703616352201258,"acs":1451,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2544,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7867095391211146,"acs":2936,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3732,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8470020675396278,"acs":2458,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2902,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6543052003410059,"acs":1535,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2346,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6457765667574932,"acs":2844,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4404,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8090497737556561,"acs":2682,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3315,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7248454187745925,"acs":2579,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3558,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.686922430691683,"acs":2453,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3571,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.674428633031479,"acs":1564,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2319,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7530864197530864,"acs":2623,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3483,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6194155189788377,"acs":1844,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":2977,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4176917037424758,"acs":1596,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3821,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.739693446088795,"acs":2799,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3784,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6348547717842323,"acs":2601,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4097,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8494117647058823,"acs":2166,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2550,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8921119592875318,"acs":1753,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1965,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7335692618806876,"acs":2902,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":3956,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.359061438715653,"acs":1163,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3239,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5938155136268344,"acs":1133,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1908,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.624283305227656,"acs":1851,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":2965,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6683400267737617,"acs":1997,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":2988,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5372065260644647,"acs":1350,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2513,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7635658914728682,"acs":1576,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2064,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.722384570426651,"acs":1236,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1711,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6336448598130842,"acs":1017,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1605,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6265697290152016,"acs":948,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1513,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6469453376205788,"acs":1006,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1555,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6543026706231454,"acs":882,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1348,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.508180755746007,"acs":2609,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5134,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7279329608938547,"acs":2606,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3580,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6696173615077099,"acs":2345,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3502,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5010482180293501,"acs":956,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1908,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4206276858966011,"acs":3230,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":7679,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5439798125450613,"acs":1509,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2774,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5495,"acs":2198,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4000,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7117403754374801,"acs":2237,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3143,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6718007537276749,"acs":4100,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6103,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.585031847133758,"acs":3674,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6280,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6337183474011551,"acs":2853,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4502,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8533077660594439,"acs":2670,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3129,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8063479308959421,"acs":2007,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2489,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7822482321385028,"acs":3208,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4101,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.640245529757139,"acs":2399,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3747,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.856020942408377,"acs":2943,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3438,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6768345323741007,"acs":2352,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3475,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8566822977725674,"acs":2923,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3412,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.764825345247766,"acs":1883,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2462,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6391376451077944,"acs":1927,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3015,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7413618912911699,"acs":3669,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":4949,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.626155138616634,"acs":2236,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3571,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5210343496719413,"acs":1350,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2591,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7650780261493041,"acs":1814,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2371,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6779904306220096,"acs":1417,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2090,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5744283714419038,"acs":1231,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2143,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5905649388468258,"acs":1014,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1717,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6636251541307029,"acs":5382,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8110,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4990448901623687,"acs":1045,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2094,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5410144020037571,"acs":864,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1597,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7768805779855503,"acs":1828,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2353,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.692071468453378,"acs":2479,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3582,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7349857006673022,"acs":1542,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2098,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48183603338242514,"acs":1963,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4074,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5936329588014981,"acs":1268,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2136,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49586943381019544,"acs":2461,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":4963,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5824175824175825,"acs":1060,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1820,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6985244040862656,"acs":3077,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4405,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5532837670384139,"acs":893,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1614,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5406046235921754,"acs":912,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1687,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5622406639004149,"acs":542,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":964,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6093845216331505,"acs":1000,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1641,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8382687927107062,"acs":1472,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1756,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6912751677852349,"acs":515,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":745,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5603070175438597,"acs":1022,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1824,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5872747747747747,"acs":1043,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1776,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.42294220665499127,"acs":483,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1142,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2878495660559306,"acs":597,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2074,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.637270621770889,"acs":3577,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5613,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6320346320346321,"acs":584,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":924,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6957695769576958,"acs":773,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1111,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4594775619557937,"acs":2744,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":5972,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7198537288668014,"acs":89372,"articleLive":2,"columnArticles":1536,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":124153,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6478339350180505,"acs":57424,"articleLive":2,"columnArticles":1106,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":88640,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5792206767806904,"acs":44059,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76066,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510676790658151,"acs":40207,"articleLive":2,"columnArticles":774,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":72962,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3323537600148483,"acs":32232,"articleLive":2,"columnArticles":555,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":96981,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47192891760904687,"acs":73031,"articleLive":2,"columnArticles":1172,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":154750,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7538479302580683,"acs":65287,"articleLive":2,"columnArticles":958,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":86605,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6212628865979382,"acs":43389,"articleLive":2,"columnArticles":487,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":69840,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5502457581470509,"acs":32689,"articleLive":2,"columnArticles":414,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":59408,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.682814339565579,"acs":63217,"articleLive":2,"columnArticles":690,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":92583,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7799937563037318,"acs":64961,"articleLive":2,"columnArticles":945,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83284,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8547150630867667,"acs":71467,"articleLive":2,"columnArticles":681,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83615,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6554602184087364,"acs":25209,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38460,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46675808827263954,"acs":36760,"articleLive":2,"columnArticles":522,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78756,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4834146099957918,"acs":39057,"articleLive":2,"columnArticles":505,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":80794,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6849332759362893,"acs":47733,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":69690,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5319885741117546,"acs":27191,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51112,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5378572130020622,"acs":10954,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20366,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6136352823635758,"acs":25796,"articleLive":2,"columnArticles":294,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42038,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3866672895449874,"acs":8277,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21406,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7123853211009175,"acs":23295,"articleLive":2,"columnArticles":342,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32700,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5431615404886496,"acs":14428,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26563,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5877049180327869,"acs":10755,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18300,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5317698391055359,"acs":17550,"articleLive":2,"columnArticles":244,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33003,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7902760609806345,"acs":34524,"articleLive":2,"columnArticles":421,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43686,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8061811938188062,"acs":23946,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29703,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5845057943792749,"acs":32986,"articleLive":2,"columnArticles":384,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56434,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3516462215822557,"acs":25398,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72226,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5904523353469869,"acs":20037,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33935,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7167809548453875,"acs":16620,"articleLive":2,"columnArticles":176,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23187,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47641915137614677,"acs":6647,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13952,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7167507300238917,"acs":16200,"articleLive":2,"columnArticles":252,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22602,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48626419274439214,"acs":17559,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36110,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5054797464274202,"acs":9409,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18614,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6901294498381877,"acs":7677,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11124,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38680257510729615,"acs":10815,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":27960,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38649362076550814,"acs":5271,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13638,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5271793473320607,"acs":11599,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22002,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7036050545094152,"acs":11359,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16144,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5528544542032622,"acs":3525,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6376,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36320995641514575,"acs":42667,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117472,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3608971521322119,"acs":12229,"articleLive":2,"columnArticles":197,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33885,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6758164487733737,"acs":51900,"articleLive":2,"columnArticles":433,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76796,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8202233933768583,"acs":20855,"articleLive":2,"columnArticles":327,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25426,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6788754515470394,"acs":21612,"articleLive":2,"columnArticles":478,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31835,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6565956744262836,"acs":23862,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36342,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8128196385952949,"acs":21456,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26397,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.718467780637843,"acs":16468,"articleLive":2,"columnArticles":237,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22921,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.813454287527532,"acs":21790,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26787,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5587934351082552,"acs":13653,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24433,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49463787491281097,"acs":34039,"articleLive":2,"columnArticles":326,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68816,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7603588015663418,"acs":16699,"articleLive":2,"columnArticles":296,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21962,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013948025253266,"acs":6830,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13622,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5339233038348082,"acs":4163,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7797,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5548040541865161,"acs":56600,"articleLive":2,"columnArticles":2373,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102018,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7398070272808778,"acs":34657,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46846,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39584021129085506,"acs":13189,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33319,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.55316108380016,"acs":19354,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":34988,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45505578555890813,"acs":12970,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28502,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6240520043336945,"acs":4608,"articleLive":2,"columnArticles":84,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7384,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6667822168298813,"acs":7694,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11539,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.831819821001213,"acs":25373,"articleLive":2,"columnArticles":402,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30503,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7657741801577418,"acs":14758,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19272,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4424701158443716,"acs":9587,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21667,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46030729833546735,"acs":7190,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15620,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4642995314447836,"acs":10801,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23263,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4240908789825793,"acs":12805,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30194,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329940881538577,"acs":19590,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26726,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3729615133724723,"acs":2287,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6132,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5485424588086185,"acs":2164,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3945,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6818061790335358,"acs":10328,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15148,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409183280193406,"acs":50337,"articleLive":2,"columnArticles":581,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114164,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43041293423639937,"acs":1970,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4577,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.548698315467075,"acs":3583,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6530,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5033730604902181,"acs":8954,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17788,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4534146415460696,"acs":14945,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32961,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6003684201379837,"acs":34547,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57543,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.343870382959438,"acs":15175,"articleLive":2,"columnArticles":313,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44130,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6116700201207244,"acs":20368,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33299,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7213462952373172,"acs":8830,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12241,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4648072429906542,"acs":9549,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20544,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5836184773310522,"acs":2729,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4676,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4716981132075472,"acs":10800,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22896,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5455089104174142,"acs":31927,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58527,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38786076520723256,"acs":14608,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37663,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5968267873655522,"acs":12263,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20547,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6440284262091488,"acs":28003,"articleLive":2,"columnArticles":453,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":43481,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3875123885034688,"acs":5474,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14126,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45009633911368013,"acs":4672,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10380,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4119202795881742,"acs":8722,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21174,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27157991106460894,"acs":8306,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30584,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5488433885589247,"acs":14046,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25592,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5706005377950404,"acs":66843,"articleLive":2,"columnArticles":927,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117145,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6867951463240543,"acs":14433,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21015,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6315725635271999,"acs":20828,"articleLive":2,"columnArticles":289,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":32978,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5527191011235955,"acs":24596,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44500,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5971543769868962,"acs":77015,"articleLive":2,"columnArticles":760,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":128970,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4024867761214536,"acs":5859,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14557,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184807545245985,"acs":61020,"articleLive":2,"columnArticles":1138,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117690,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4451291244188001,"acs":7946,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17851,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44537398525128585,"acs":7187,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16137,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5789614740368509,"acs":8641,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14925,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5706577220358757,"acs":3913,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6857,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359950138266015,"acs":44388,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69793,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3752070327430246,"acs":8835,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23547,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3787511493772465,"acs":4531,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11963,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5244562590623489,"acs":10851,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20690,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5038486209108403,"acs":1571,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3118,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3415576694411415,"acs":3447,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10092,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/MinimumOperationsToMakeAUniValueGrid.md b/src/main/java/leetcode/editor/cn/doc/content/MinimumOperationsToMakeAUniValueGrid.md new file mode 100644 index 0000000..8b34640 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/MinimumOperationsToMakeAUniValueGrid.md @@ -0,0 +1,54 @@ +

    给你一个大小为 m x n 的二维整数网格 grid 和一个整数 x 。每一次操作，你可以对 grid 中的任一元素 加 x 或 减 x 。

    + +

    单值网格 是全部元素都相等的网格。

    + +

    返回使网格化为单值网格所需的 最小 操作数。如果不能，返回 -1 。

    + +

     

    + +

    示例 1：

    + +

    + +
    +输入：grid = [[2,4],[6,8]], x = 2
+输出：4
+解释：可以执行下述操作使所有元素都等于 4 ： 
+- 2 加 x 一次。
+- 6 减 x 一次。
+- 8 减 x 两次。
+共计 4 次操作。
+
    + +

    示例 2：

    + +

    + +
    +输入：grid = [[1,5],[2,3]], x = 1
+输出：5
+解释：可以使所有元素都等于 3 。
+
    + +

    示例 3：

    + +

    + +
    +输入：grid = [[1,2],[3,4]], x = 2
+输出：-1
+解释：无法使所有元素相等。
+
    + +

     

    + +

    提示：

    + +
      +
    • m == grid.length
      • +
    • n == grid[i].length
      • +
    • 1 <= m, n <= 105
      • +
    • 1 <= m * n <= 105
      • +
    • 1 <= x, grid[i][j] <= 104
      • +
    +
  • 👍 8
  • 👎 0
    • \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/translation.json b/src/main/java/leetcode/editor/cn/doc/translation.json index faf5f2e..0f4fff2 100644 --- a/src/main/java/leetcode/editor/cn/doc/translation.json +++ b/src/main/java/leetcode/editor/cn/doc/translation.json @@ -1,2 +1 @@ -{"data":{"translations":[{"questionId":"1","title":"\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2","title":"\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"3","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"4","title":"\u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"5","title":"\u6700\u957f\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"6","title":"Z \u5b57\u5f62\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"7","title":"\u6574\u6570\u53cd\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"8","title":"\u5b57\u7b26\u4e32\u8f6c\u6362\u6574\u6570 (atoi)","__typename":"AppliedTranslationNode"},{"questionId":"9","title":"\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"10","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"11","title":"\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"12","title":"\u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"13","title":"\u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"14","title":"\u6700\u957f\u516c\u5171\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"15","title":"\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"16","title":"\u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"17","title":"\u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"18","title":"\u56db\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"19","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c N \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"20","title":"\u6709\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"21","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"22","title":"\u62ec\u53f7\u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"23","title":"\u5408\u5e76K\u4e2a\u5347\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"24","title":"\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"25","title":"K \u4e2a\u4e00\u7ec4\u7ffb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"26","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"27","title":"\u79fb\u9664\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"28","title":"\u5b9e\u73b0 strStr()","__typename":"AppliedTranslationNode"},{"questionId":"29","title":"\u4e24\u6570\u76f8\u9664","__typename":"AppliedTranslationNode"},{"questionId":"30","title":"\u4e32\u8054\u6240\u6709\u5355\u8bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"31","title":"\u4e0b\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"32","title":"\u6700\u957f\u6709\u6548\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"33","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"34","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"35","title":"\u641c\u7d22\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"36","title":"\u6709\u6548\u7684\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"37","title":"\u89e3\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"38","title":"\u5916\u89c2\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"39","title":"\u7ec4\u5408\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"40","title":"\u7ec4\u5408\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"41","title":"\u7f3a\u5931\u7684\u7b2c\u4e00\u4e2a\u6b63\u6570","__typename":"AppliedTranslationNode"},{"questionId":"42","title":"\u63a5\u96e8\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"43","title":"\u5b57\u7b26\u4e32\u76f8\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"44","title":"\u901a\u914d\u7b26\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"45","title":"\u8df3\u8dc3\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"46","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"47","title":"\u5168\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"48","title":"\u65cb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"49","title":"\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"50","title":"Pow(x, n)","__typename":"AppliedTranslationNode"},{"questionId":"51","title":"N \u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"52","title":"N\u7687\u540e II","__typename":"AppliedTranslationNode"},{"questionId":"53","title":"\u6700\u5927\u5b50\u5e8f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"54","title":"\u87ba\u65cb\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"55","title":"\u8df3\u8dc3\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"56","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"57","title":"\u63d2\u5165\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"58","title":"\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"59","title":"\u87ba\u65cb\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"60","title":"\u6392\u5217\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"61","title":"\u65cb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"62","title":"\u4e0d\u540c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"63","title":"\u4e0d\u540c\u8def\u5f84 II","__typename":"AppliedTranslationNode"},{"questionId":"64","title":"\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"65","title":"\u6709\u6548\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"66","title":"\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"67","title":"\u4e8c\u8fdb\u5236\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"68","title":"\u6587\u672c\u5de6\u53f3\u5bf9\u9f50","__typename":"AppliedTranslationNode"},{"questionId":"69","title":"Sqrt(x)","__typename":"AppliedTranslationNode"},{"questionId":"70","title":"\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"71","title":"\u7b80\u5316\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"72","title":"\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"73","title":"\u77e9\u9635\u7f6e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"74","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"75","title":"\u989c\u8272\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"76","title":"\u6700\u5c0f\u8986\u76d6\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"77","title":"\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"78","title":"\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"79","title":"\u5355\u8bcd\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"80","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"81","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"82","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"83","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"84","title":"\u67f1\u72b6\u56fe\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"85","title":"\u6700\u5927\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"86","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"87","title":"\u6270\u4e71\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"88","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"89","title":"\u683c\u96f7\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"90","title":"\u5b50\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"91","title":"\u89e3\u7801\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"92","title":"\u53cd\u8f6c\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"93","title":"\u590d\u539f IP \u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"94","title":"\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"95","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"96","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"97","title":"\u4ea4\u9519\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"98","title":"\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"99","title":"\u6062\u590d\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100","title":"\u76f8\u540c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"101","title":"\u5bf9\u79f0\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"102","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"103","title":"\u4e8c\u53c9\u6811\u7684\u952f\u9f7f\u5f62\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"104","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"105","title":"\u4ece\u524d\u5e8f\u4e0e\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"106","title":"\u4ece\u4e2d\u5e8f\u4e0e\u540e\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"107","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"108","title":"\u5c06\u6709\u5e8f\u6570\u7ec4\u8f6c\u6362\u4e3a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"109","title":"\u6709\u5e8f\u94fe\u8868\u8f6c\u6362\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"110","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"111","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"112","title":"\u8def\u5f84\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"113","title":"\u8def\u5f84\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"114","title":"\u4e8c\u53c9\u6811\u5c55\u5f00\u4e3a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"115","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"116","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488","__typename":"AppliedTranslationNode"},{"questionId":"117","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488 II","__typename":"AppliedTranslationNode"},{"questionId":"118","title":"\u6768\u8f89\u4e09\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"119","title":"\u6768\u8f89\u4e09\u89d2 II","__typename":"AppliedTranslationNode"},{"questionId":"120","title":"\u4e09\u89d2\u5f62\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"121","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a","__typename":"AppliedTranslationNode"},{"questionId":"122","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"123","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a III","__typename":"AppliedTranslationNode"},{"questionId":"124","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u5927\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"125","title":"\u9a8c\u8bc1\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"126","title":"\u5355\u8bcd\u63a5\u9f99 II","__typename":"AppliedTranslationNode"},{"questionId":"127","title":"\u5355\u8bcd\u63a5\u9f99","__typename":"AppliedTranslationNode"},{"questionId":"128","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"129","title":"\u6c42\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"130","title":"\u88ab\u56f4\u7ed5\u7684\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"131","title":"\u5206\u5272\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"132","title":"\u5206\u5272\u56de\u6587\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"133","title":"\u514b\u9686\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"134","title":"\u52a0\u6cb9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"135","title":"\u5206\u53d1\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"136","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"137","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 II","__typename":"AppliedTranslationNode"},{"questionId":"138","title":"\u590d\u5236\u5e26\u968f\u673a\u6307\u9488\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"139","title":"\u5355\u8bcd\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"140","title":"\u5355\u8bcd\u62c6\u5206 II","__typename":"AppliedTranslationNode"},{"questionId":"141","title":"\u73af\u5f62\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"142","title":"\u73af\u5f62\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"143","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"144","title":"\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"145","title":"\u4e8c\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"146","title":"LRU \u7f13\u5b58\u673a\u5236","__typename":"AppliedTranslationNode"},{"questionId":"147","title":"\u5bf9\u94fe\u8868\u8fdb\u884c\u63d2\u5165\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"148","title":"\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"149","title":"\u76f4\u7ebf\u4e0a\u6700\u591a\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"150","title":"\u9006\u6ce2\u5170\u8868\u8fbe\u5f0f\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"151","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"152","title":"\u4e58\u79ef\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"153","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"154","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"155","title":"\u6700\u5c0f\u6808","__typename":"AppliedTranslationNode"},{"questionId":"156","title":"\u4e0a\u4e0b\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"157","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"158","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26 II","__typename":"AppliedTranslationNode"},{"questionId":"159","title":"\u81f3\u591a\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"160","title":"\u76f8\u4ea4\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"161","title":"\u76f8\u9694\u4e3a 1 \u7684\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"162","title":"\u5bfb\u627e\u5cf0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"163","title":"\u7f3a\u5931\u7684\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"164","title":"\u6700\u5927\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"165","title":"\u6bd4\u8f83\u7248\u672c\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"166","title":"\u5206\u6570\u5230\u5c0f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"167","title":"\u4e24\u6570\u4e4b\u548c II - \u8f93\u5165\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"168","title":"Excel\u8868\u5217\u540d\u79f0","__typename":"AppliedTranslationNode"},{"questionId":"169","title":"\u591a\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"170","title":"\u4e24\u6570\u4e4b\u548c III - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"171","title":"Excel \u8868\u5217\u5e8f\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"172","title":"\u9636\u4e58\u540e\u7684\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"173","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"174","title":"\u5730\u4e0b\u57ce\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"175","title":"\u7ec4\u5408\u4e24\u4e2a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"176","title":"\u7b2c\u4e8c\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"177","title":"\u7b2cN\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"178","title":"\u5206\u6570\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"179","title":"\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"180","title":"\u8fde\u7eed\u51fa\u73b0\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"181","title":"\u8d85\u8fc7\u7ecf\u7406\u6536\u5165\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"182","title":"\u67e5\u627e\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"183","title":"\u4ece\u4e0d\u8ba2\u8d2d\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"184","title":"\u90e8\u95e8\u5de5\u8d44\u6700\u9ad8\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"185","title":"\u90e8\u95e8\u5de5\u8d44\u524d\u4e09\u9ad8\u7684\u6240\u6709\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"186","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd II","__typename":"AppliedTranslationNode"},{"questionId":"187","title":"\u91cd\u590d\u7684DNA\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"188","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a IV","__typename":"AppliedTranslationNode"},{"questionId":"189","title":"\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"190","title":"\u98a0\u5012\u4e8c\u8fdb\u5236\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"191","title":"\u4f4d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"192","title":"\u7edf\u8ba1\u8bcd\u9891","__typename":"AppliedTranslationNode"},{"questionId":"193","title":"\u6709\u6548\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"194","title":"\u8f6c\u7f6e\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"195","title":"\u7b2c\u5341\u884c","__typename":"AppliedTranslationNode"},{"questionId":"196","title":"\u5220\u9664\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"197","title":"\u4e0a\u5347\u7684\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"198","title":"\u6253\u5bb6\u52ab\u820d","__typename":"AppliedTranslationNode"},{"questionId":"199","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"200","title":"\u5c9b\u5c7f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"201","title":"\u6570\u5b57\u8303\u56f4\u6309\u4f4d\u4e0e","__typename":"AppliedTranslationNode"},{"questionId":"202","title":"\u5feb\u4e50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"203","title":"\u79fb\u9664\u94fe\u8868\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"204","title":"\u8ba1\u6570\u8d28\u6570","__typename":"AppliedTranslationNode"},{"questionId":"205","title":"\u540c\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"206","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"207","title":"\u8bfe\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"208","title":"\u5b9e\u73b0 Trie (\u524d\u7f00\u6811)","__typename":"AppliedTranslationNode"},{"questionId":"209","title":"\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"210","title":"\u8bfe\u7a0b\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"211","title":"\u6dfb\u52a0\u4e0e\u641c\u7d22\u5355\u8bcd - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"212","title":"\u5355\u8bcd\u641c\u7d22 II","__typename":"AppliedTranslationNode"},{"questionId":"213","title":"\u6253\u5bb6\u52ab\u820d II","__typename":"AppliedTranslationNode"},{"questionId":"214","title":"\u6700\u77ed\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"215","title":"\u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"216","title":"\u7ec4\u5408\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"217","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"218","title":"\u5929\u9645\u7ebf\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"219","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"220","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"221","title":"\u6700\u5927\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"222","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"223","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"224","title":"\u57fa\u672c\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"225","title":"\u7528\u961f\u5217\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"226","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"227","title":"\u57fa\u672c\u8ba1\u7b97\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"228","title":"\u6c47\u603b\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"229","title":"\u6c42\u4f17\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"230","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"231","title":"2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"232","title":"\u7528\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"233","title":"\u6570\u5b57 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"234","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"235","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"236","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"237","title":"\u5220\u9664\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"238","title":"\u9664\u81ea\u8eab\u4ee5\u5916\u6570\u7ec4\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"239","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"240","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"241","title":"\u4e3a\u8fd0\u7b97\u8868\u8fbe\u5f0f\u8bbe\u8ba1\u4f18\u5148\u7ea7","__typename":"AppliedTranslationNode"},{"questionId":"242","title":"\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"243","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"244","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"245","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb III","__typename":"AppliedTranslationNode"},{"questionId":"246","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"247","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"248","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"249","title":"\u79fb\u4f4d\u5b57\u7b26\u4e32\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"250","title":"\u7edf\u8ba1\u540c\u503c\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"251","title":"\u5c55\u5f00\u4e8c\u7ef4\u5411\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"252","title":"\u4f1a\u8bae\u5ba4","__typename":"AppliedTranslationNode"},{"questionId":"253","title":"\u4f1a\u8bae\u5ba4 II","__typename":"AppliedTranslationNode"},{"questionId":"254","title":"\u56e0\u5b50\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"255","title":"\u9a8c\u8bc1\u524d\u5e8f\u904d\u5386\u5e8f\u5217\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"256","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"257","title":"\u4e8c\u53c9\u6811\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"258","title":"\u5404\u4f4d\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"259","title":"\u8f83\u5c0f\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"260","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 III","__typename":"AppliedTranslationNode"},{"questionId":"261","title":"\u4ee5\u56fe\u5224\u6811","__typename":"AppliedTranslationNode"},{"questionId":"262","title":"\u884c\u7a0b\u548c\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"263","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"264","title":"\u4e11\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"265","title":"\u7c89\u5237\u623f\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"266","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"267","title":"\u56de\u6587\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"268","title":"\u4e22\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"269","title":"\u706b\u661f\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"270","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c","__typename":"AppliedTranslationNode"},{"questionId":"271","title":"\u5b57\u7b26\u4e32\u7684\u7f16\u7801\u4e0e\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"272","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"273","title":"\u6574\u6570\u8f6c\u6362\u82f1\u6587\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"274","title":"H \u6307\u6570","__typename":"AppliedTranslationNode"},{"questionId":"275","title":"H \u6307\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"276","title":"\u6805\u680f\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"277","title":"\u641c\u5bfb\u540d\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"278","title":"\u7b2c\u4e00\u4e2a\u9519\u8bef\u7684\u7248\u672c","__typename":"AppliedTranslationNode"},{"questionId":"279","title":"\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"280","title":"\u6446\u52a8\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"281","title":"\u952f\u9f7f\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"282","title":"\u7ed9\u8868\u8fbe\u5f0f\u6dfb\u52a0\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"283","title":"\u79fb\u52a8\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"284","title":"\u9876\u7aef\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"285","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"286","title":"\u5899\u4e0e\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"287","title":"\u5bfb\u627e\u91cd\u590d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"288","title":"\u5355\u8bcd\u7684\u552f\u4e00\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"289","title":"\u751f\u547d\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"290","title":"\u5355\u8bcd\u89c4\u5f8b","__typename":"AppliedTranslationNode"},{"questionId":"291","title":"\u5355\u8bcd\u89c4\u5f8b II","__typename":"AppliedTranslationNode"},{"questionId":"292","title":"Nim \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"293","title":"\u7ffb\u8f6c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"294","title":"\u7ffb\u8f6c\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"295","title":"\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"296","title":"\u6700\u4f73\u7684\u78b0\u5934\u5730\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"297","title":"\u4e8c\u53c9\u6811\u7684\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"298","title":"\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"299","title":"\u731c\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"300","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"301","title":"\u5220\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"302","title":"\u5305\u542b\u5168\u90e8\u9ed1\u8272\u50cf\u7d20\u7684\u6700\u5c0f\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"303","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"304","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"305","title":"\u5c9b\u5c7f\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"306","title":"\u7d2f\u52a0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"307","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u53ef\u4fee\u6539","__typename":"AppliedTranslationNode"},{"questionId":"308","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"309","title":"\u6700\u4f73\u4e70\u5356\u80a1\u7968\u65f6\u673a\u542b\u51b7\u51bb\u671f","__typename":"AppliedTranslationNode"},{"questionId":"310","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"311","title":"\u7a00\u758f\u77e9\u9635\u7684\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"312","title":"\u6233\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"313","title":"\u8d85\u7ea7\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"314","title":"\u4e8c\u53c9\u6811\u7684\u5782\u76f4\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"315","title":"\u8ba1\u7b97\u53f3\u4fa7\u5c0f\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"316","title":"\u53bb\u9664\u91cd\u590d\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"317","title":"\u79bb\u5efa\u7b51\u7269\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"318","title":"\u6700\u5927\u5355\u8bcd\u957f\u5ea6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"319","title":"\u706f\u6ce1\u5f00\u5173","__typename":"AppliedTranslationNode"},{"questionId":"320","title":"\u5217\u4e3e\u5355\u8bcd\u7684\u5168\u90e8\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"321","title":"\u62fc\u63a5\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"322","title":"\u96f6\u94b1\u5151\u6362","__typename":"AppliedTranslationNode"},{"questionId":"323","title":"\u65e0\u5411\u56fe\u4e2d\u8fde\u901a\u5206\u91cf\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"324","title":"\u6446\u52a8\u6392\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"325","title":"\u548c\u7b49\u4e8e k \u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"326","title":"3\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"327","title":"\u533a\u95f4\u548c\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"328","title":"\u5947\u5076\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"329","title":"\u77e9\u9635\u4e2d\u7684\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"330","title":"\u6309\u8981\u6c42\u8865\u9f50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"331","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"332","title":"\u91cd\u65b0\u5b89\u6392\u884c\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"333","title":"\u6700\u5927 BST \u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"334","title":"\u9012\u589e\u7684\u4e09\u5143\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"335","title":"\u8def\u5f84\u4ea4\u53c9","__typename":"AppliedTranslationNode"},{"questionId":"336","title":"\u56de\u6587\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"337","title":"\u6253\u5bb6\u52ab\u820d III","__typename":"AppliedTranslationNode"},{"questionId":"338","title":"\u6bd4\u7279\u4f4d\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"339","title":"\u5d4c\u5957\u5217\u8868\u6743\u91cd\u548c","__typename":"AppliedTranslationNode"},{"questionId":"340","title":"\u81f3\u591a\u5305\u542b K \u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"341","title":"\u6241\u5e73\u5316\u5d4c\u5957\u5217\u8868\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"342","title":"4\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"343","title":"\u6574\u6570\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"344","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"345","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"346","title":"\u6570\u636e\u6d41\u4e2d\u7684\u79fb\u52a8\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"347","title":"\u524d K \u4e2a\u9ad8\u9891\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"348","title":"\u8bbe\u8ba1\u4e95\u5b57\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"349","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"350","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"351","title":"\u5b89\u5353\u7cfb\u7edf\u624b\u52bf\u89e3\u9501","__typename":"AppliedTranslationNode"},{"questionId":"352","title":"\u5c06\u6570\u636e\u6d41\u53d8\u4e3a\u591a\u4e2a\u4e0d\u76f8\u4ea4\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"353","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"354","title":"\u4fc4\u7f57\u65af\u5957\u5a03\u4fe1\u5c01\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"355","title":"\u8bbe\u8ba1\u63a8\u7279","__typename":"AppliedTranslationNode"},{"questionId":"356","title":"\u76f4\u7ebf\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"357","title":"\u8ba1\u7b97\u5404\u4e2a\u4f4d\u6570\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"358","title":"K \u8ddd\u79bb\u95f4\u9694\u91cd\u6392\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"359","title":"\u65e5\u5fd7\u901f\u7387\u9650\u5236\u5668","__typename":"AppliedTranslationNode"},{"questionId":"360","title":"\u6709\u5e8f\u8f6c\u5316\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"361","title":"\u8f70\u70b8\u654c\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"362","title":"\u6572\u51fb\u8ba1\u6570\u5668","__typename":"AppliedTranslationNode"},{"questionId":"363","title":"\u77e9\u5f62\u533a\u57df\u4e0d\u8d85\u8fc7 K \u7684\u6700\u5927\u6570\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"364","title":"\u52a0\u6743\u5d4c\u5957\u5e8f\u5217\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"365","title":"\u6c34\u58f6\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"366","title":"\u5bfb\u627e\u4e8c\u53c9\u6811\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"367","title":"\u6709\u6548\u7684\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"368","title":"\u6700\u5927\u6574\u9664\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"369","title":"\u7ed9\u5355\u94fe\u8868\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"370","title":"\u533a\u95f4\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"371","title":"\u4e24\u6574\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"372","title":"\u8d85\u7ea7\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"373","title":"\u67e5\u627e\u548c\u6700\u5c0f\u7684K\u5bf9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"374","title":"\u731c\u6570\u5b57\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"375","title":"\u731c\u6570\u5b57\u5927\u5c0f II","__typename":"AppliedTranslationNode"},{"questionId":"376","title":"\u6446\u52a8\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"377","title":"\u7ec4\u5408\u603b\u548c \u2163","__typename":"AppliedTranslationNode"},{"questionId":"378","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"379","title":"\u7535\u8bdd\u76ee\u5f55\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"380","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"381","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20 - \u5141\u8bb8\u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"382","title":"\u94fe\u8868\u968f\u673a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"383","title":"\u8d4e\u91d1\u4fe1","__typename":"AppliedTranslationNode"},{"questionId":"384","title":"\u6253\u4e71\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"385","title":"\u8ff7\u4f60\u8bed\u6cd5\u5206\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"386","title":"\u5b57\u5178\u5e8f\u6392\u6570","__typename":"AppliedTranslationNode"},{"questionId":"387","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c\u4e00\u4e2a\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"388","title":"\u6587\u4ef6\u7684\u6700\u957f\u7edd\u5bf9\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"389","title":"\u627e\u4e0d\u540c","__typename":"AppliedTranslationNode"},{"questionId":"390","title":"\u6d88\u9664\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"391","title":"\u5b8c\u7f8e\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"392","title":"\u5224\u65ad\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"393","title":"UTF-8 \u7f16\u7801\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"394","title":"\u5b57\u7b26\u4e32\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"395","title":"\u81f3\u5c11\u6709 K \u4e2a\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"396","title":"\u65cb\u8f6c\u51fd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"397","title":"\u6574\u6570\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"398","title":"\u968f\u673a\u6570\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"399","title":"\u9664\u6cd5\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"400","title":"\u7b2c N \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"401","title":"\u4e8c\u8fdb\u5236\u624b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"402","title":"\u79fb\u6389 K \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"403","title":"\u9752\u86d9\u8fc7\u6cb3","__typename":"AppliedTranslationNode"},{"questionId":"404","title":"\u5de6\u53f6\u5b50\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"405","title":"\u6570\u5b57\u8f6c\u6362\u4e3a\u5341\u516d\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"406","title":"\u6839\u636e\u8eab\u9ad8\u91cd\u5efa\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"407","title":"\u63a5\u96e8\u6c34 II","__typename":"AppliedTranslationNode"},{"questionId":"408","title":"\u6709\u6548\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"409","title":"\u6700\u957f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"410","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"411","title":"\u6700\u77ed\u72ec\u5360\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"412","title":"Fizz Buzz","__typename":"AppliedTranslationNode"},{"questionId":"413","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"414","title":"\u7b2c\u4e09\u5927\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"415","title":"\u5b57\u7b26\u4e32\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"416","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"417","title":"\u592a\u5e73\u6d0b\u5927\u897f\u6d0b\u6c34\u6d41\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"418","title":"\u5c4f\u5e55\u53ef\u663e\u793a\u53e5\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"419","title":"\u7532\u677f\u4e0a\u7684\u6218\u8230","__typename":"AppliedTranslationNode"},{"questionId":"420","title":"\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668","__typename":"AppliedTranslationNode"},{"questionId":"421","title":"\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"422","title":"\u6709\u6548\u7684\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"423","title":"\u4ece\u82f1\u6587\u4e2d\u91cd\u5efa\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"424","title":"\u66ff\u6362\u540e\u7684\u6700\u957f\u91cd\u590d\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"425","title":"\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"432","title":"\u5168 O(1) \u7684\u6570\u636e\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"433","title":"\u6700\u5c0f\u57fa\u56e0\u53d8\u5316","__typename":"AppliedTranslationNode"},{"questionId":"434","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"435","title":"\u65e0\u91cd\u53e0\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"436","title":"\u5bfb\u627e\u53f3\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"437","title":"\u8def\u5f84\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"438","title":"\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"439","title":"\u4e09\u5143\u8868\u8fbe\u5f0f\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"440","title":"\u5b57\u5178\u5e8f\u7684\u7b2cK\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"441","title":"\u6392\u5217\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"442","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"443","title":"\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"444","title":"\u5e8f\u5217\u91cd\u5efa","__typename":"AppliedTranslationNode"},{"questionId":"445","title":"\u4e24\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"446","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206 II - \u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"447","title":"\u56de\u65cb\u9556\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"448","title":"\u627e\u5230\u6240\u6709\u6570\u7ec4\u4e2d\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"449","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"450","title":"\u5220\u9664\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"451","title":"\u6839\u636e\u5b57\u7b26\u51fa\u73b0\u9891\u7387\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"452","title":"\u7528\u6700\u5c11\u6570\u91cf\u7684\u7bad\u5f15\u7206\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"453","title":"\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"454","title":"\u56db\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"455","title":"\u5206\u53d1\u997c\u5e72","__typename":"AppliedTranslationNode"},{"questionId":"456","title":"132 \u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"457","title":"\u73af\u5f62\u6570\u7ec4\u662f\u5426\u5b58\u5728\u5faa\u73af","__typename":"AppliedTranslationNode"},{"questionId":"458","title":"\u53ef\u601c\u7684\u5c0f\u732a","__typename":"AppliedTranslationNode"},{"questionId":"459","title":"\u91cd\u590d\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"460","title":"LFU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"461","title":"\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"462","title":"\u6700\u5c11\u79fb\u52a8\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49 II","__typename":"AppliedTranslationNode"},{"questionId":"463","title":"\u5c9b\u5c7f\u7684\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"464","title":"\u6211\u80fd\u8d62\u5417","__typename":"AppliedTranslationNode"},{"questionId":"465","title":"\u6700\u4f18\u8d26\u5355\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"466","title":"\u7edf\u8ba1\u91cd\u590d\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"467","title":"\u73af\u7ed5\u5b57\u7b26\u4e32\u4e2d\u552f\u4e00\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"468","title":"\u9a8c\u8bc1IP\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"469","title":"\u51f8\u591a\u8fb9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"471","title":"\u7f16\u7801\u6700\u77ed\u957f\u5ea6\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"472","title":"\u8fde\u63a5\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"473","title":"\u706b\u67f4\u62fc\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"474","title":"\u4e00\u548c\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"475","title":"\u4f9b\u6696\u5668","__typename":"AppliedTranslationNode"},{"questionId":"476","title":"\u6570\u5b57\u7684\u8865\u6570","__typename":"AppliedTranslationNode"},{"questionId":"477","title":"\u6c49\u660e\u8ddd\u79bb\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"479","title":"\u6700\u5927\u56de\u6587\u6570\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"480","title":"\u6ed1\u52a8\u7a97\u53e3\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"481","title":"\u795e\u5947\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"482","title":"\u5bc6\u94a5\u683c\u5f0f\u5316","__typename":"AppliedTranslationNode"},{"questionId":"483","title":"\u6700\u5c0f\u597d\u8fdb\u5236","__typename":"AppliedTranslationNode"},{"questionId":"484","title":"\u5bfb\u627e\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"485","title":"\u6700\u5927\u8fde\u7eed 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"486","title":"\u9884\u6d4b\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"487","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"488","title":"\u7956\u739b\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"489","title":"\u7b2c K \u6761\u6700\u5c0f\u6307\u4ee4","__typename":"AppliedTranslationNode"},{"questionId":"490","title":"\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"491","title":"\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"492","title":"\u6784\u9020\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"493","title":"\u7ffb\u8f6c\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"494","title":"\u76ee\u6807\u548c","__typename":"AppliedTranslationNode"},{"questionId":"495","title":"\u63d0\u83ab\u653b\u51fb","__typename":"AppliedTranslationNode"},{"questionId":"496","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"498","title":"\u5bf9\u89d2\u7ebf\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"499","title":"\u8ff7\u5bab III","__typename":"AppliedTranslationNode"},{"questionId":"500","title":"\u952e\u76d8\u884c","__typename":"AppliedTranslationNode"},{"questionId":"501","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4f17\u6570","__typename":"AppliedTranslationNode"},{"questionId":"502","title":"IPO","__typename":"AppliedTranslationNode"},{"questionId":"503","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"504","title":"\u4e03\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"505","title":"\u8ff7\u5bab II","__typename":"AppliedTranslationNode"},{"questionId":"506","title":"\u76f8\u5bf9\u540d\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"507","title":"\u5b8c\u7f8e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"508","title":"\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b50\u6811\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"509","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7 II","__typename":"AppliedTranslationNode"},{"questionId":"511","title":"\u4ece\u59cb\u70b9\u5230\u7ec8\u70b9\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"513","title":"\u627e\u6811\u5de6\u4e0b\u89d2\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"514","title":"\u81ea\u7531\u4e4b\u8def","__typename":"AppliedTranslationNode"},{"questionId":"515","title":"\u5728\u6bcf\u4e2a\u6811\u884c\u4e2d\u627e\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"516","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"517","title":"\u8d85\u7ea7\u6d17\u8863\u673a","__typename":"AppliedTranslationNode"},{"questionId":"518","title":"\u96f6\u94b1\u5151\u6362 II","__typename":"AppliedTranslationNode"},{"questionId":"520","title":"\u68c0\u6d4b\u5927\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"521","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 \u2160","__typename":"AppliedTranslationNode"},{"questionId":"522","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"523","title":"\u8fde\u7eed\u7684\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"524","title":"\u901a\u8fc7\u5220\u9664\u5b57\u6bcd\u5339\u914d\u5230\u5b57\u5178\u91cc\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"525","title":"\u8fde\u7eed\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"526","title":"\u4f18\u7f8e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"527","title":"\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"528","title":"\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"529","title":"\u626b\u96f7\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"530","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"531","title":"\u5b64\u72ec\u50cf\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"532","title":"\u6570\u7ec4\u4e2d\u7684 k-diff \u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"533","title":"\u5b64\u72ec\u50cf\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"535","title":"TinyURL \u7684\u52a0\u5bc6\u4e0e\u89e3\u5bc6","__typename":"AppliedTranslationNode"},{"questionId":"536","title":"\u4ece\u5b57\u7b26\u4e32\u751f\u6210\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"537","title":"\u590d\u6570\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"538","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"539","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"540","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u5355\u4e00\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"541","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"542","title":"01 \u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"543","title":"\u4e8c\u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"544","title":"\u8f93\u51fa\u6bd4\u8d5b\u5339\u914d\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"545","title":"\u4e8c\u53c9\u6811\u7684\u8fb9\u754c","__typename":"AppliedTranslationNode"},{"questionId":"546","title":"\u79fb\u9664\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"547","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"548","title":"\u5c06\u6570\u7ec4\u5206\u5272\u6210\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"549","title":"\u4e8c\u53c9\u6811\u4e2d\u6700\u957f\u7684\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"550","title":"\u83b7\u53d6\u98df\u7269\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"551","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 I","__typename":"AppliedTranslationNode"},{"questionId":"552","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"553","title":"\u6700\u4f18\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"554","title":"\u7816\u5899","__typename":"AppliedTranslationNode"},{"questionId":"555","title":"\u5206\u5272\u8fde\u63a5\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"556","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"557","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd III","__typename":"AppliedTranslationNode"},{"questionId":"560","title":"\u548c\u4e3a K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"561","title":"\u6570\u7ec4\u62c6\u5206 I","__typename":"AppliedTranslationNode"},{"questionId":"562","title":"\u77e9\u9635\u4e2d\u6700\u957f\u7684\u8fde\u7eed1\u7ebf\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"563","title":"\u4e8c\u53c9\u6811\u7684\u5761\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"564","title":"\u5bfb\u627e\u6700\u8fd1\u7684\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"565","title":"\u6570\u7ec4\u5d4c\u5957","__typename":"AppliedTranslationNode"},{"questionId":"566","title":"\u91cd\u5851\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"567","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"568","title":"\u6700\u5927\u4f11\u5047\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"569","title":"\u5458\u5de5\u85aa\u6c34\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"570","title":"\u81f3\u5c11\u67095\u540d\u76f4\u63a5\u4e0b\u5c5e\u7684\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"571","title":"\u7ed9\u5b9a\u6570\u5b57\u7684\u9891\u7387\u67e5\u8be2\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"572","title":"\u53e6\u4e00\u68f5\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"573","title":"\u677e\u9f20\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"574","title":"\u5f53\u9009\u8005","__typename":"AppliedTranslationNode"},{"questionId":"575","title":"\u5206\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"576","title":"\u51fa\u754c\u7684\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"577","title":"\u5458\u5de5\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"578","title":"\u67e5\u8be2\u56de\u7b54\u7387\u6700\u9ad8\u7684\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"579","title":"\u67e5\u8be2\u5458\u5de5\u7684\u7d2f\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"580","title":"\u7edf\u8ba1\u5404\u4e13\u4e1a\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"581","title":"\u6700\u77ed\u65e0\u5e8f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"582","title":"\u6740\u6389\u8fdb\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"583","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u5220\u9664\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"584","title":"\u5bfb\u627e\u7528\u6237\u63a8\u8350\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"585","title":"2016\u5e74\u7684\u6295\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"586","title":"\u8ba2\u5355\u6700\u591a\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"587","title":"\u5b89\u88c5\u6805\u680f","__typename":"AppliedTranslationNode"},{"questionId":"588","title":"\u8bbe\u8ba1\u5185\u5b58\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"591","title":"\u6807\u7b7e\u9a8c\u8bc1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"592","title":"\u5206\u6570\u52a0\u51cf\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"593","title":"\u6709\u6548\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"594","title":"\u6700\u957f\u548c\u8c10\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"595","title":"\u5927\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"596","title":"\u8d85\u8fc75\u540d\u5b66\u751f\u7684\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"597","title":"\u597d\u53cb\u7533\u8bf7 I\uff1a\u603b\u4f53\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"598","title":"\u8303\u56f4\u6c42\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"599","title":"\u4e24\u4e2a\u5217\u8868\u7684\u6700\u5c0f\u7d22\u5f15\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"600","title":"\u4e0d\u542b\u8fde\u7eed1\u7684\u975e\u8d1f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"601","title":"\u4f53\u80b2\u9986\u7684\u4eba\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"602","title":"\u597d\u53cb\u7533\u8bf7 II \uff1a\u8c01\u6709\u6700\u591a\u7684\u597d\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"603","title":"\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"604","title":"\u8fed\u4ee3\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"605","title":"\u79cd\u82b1\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"606","title":"\u6839\u636e\u4e8c\u53c9\u6811\u521b\u5efa\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"607","title":"\u9500\u552e\u5458","__typename":"AppliedTranslationNode"},{"questionId":"608","title":"\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"609","title":"\u5728\u7cfb\u7edf\u4e2d\u67e5\u627e\u91cd\u590d\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"610","title":"\u5224\u65ad\u4e09\u89d2\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"611","title":"\u6709\u6548\u4e09\u89d2\u5f62\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"612","title":"\u5e73\u9762\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"613","title":"\u76f4\u7ebf\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"614","title":"\u4e8c\u7ea7\u5173\u6ce8\u8005","__typename":"AppliedTranslationNode"},{"questionId":"615","title":"\u5e73\u5747\u5de5\u8d44\uff1a\u90e8\u95e8\u4e0e\u516c\u53f8\u6bd4\u8f83","__typename":"AppliedTranslationNode"},{"questionId":"616","title":"\u7ed9\u5b57\u7b26\u4e32\u6dfb\u52a0\u52a0\u7c97\u6807\u7b7e","__typename":"AppliedTranslationNode"},{"questionId":"617","title":"\u5408\u5e76\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"618","title":"\u5b66\u751f\u5730\u7406\u4fe1\u606f\u62a5\u544a","__typename":"AppliedTranslationNode"},{"questionId":"619","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"620","title":"\u6709\u8da3\u7684\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"621","title":"\u4efb\u52a1\u8c03\u5ea6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"623","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u589e\u52a0\u4e00\u884c","__typename":"AppliedTranslationNode"},{"questionId":"624","title":"\u6570\u7ec4\u5217\u8868\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"625","title":"\u6700\u5c0f\u56e0\u5f0f\u5206\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"626","title":"\u6362\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"627","title":"\u53d8\u66f4\u6027\u522b","__typename":"AppliedTranslationNode"},{"questionId":"628","title":"\u4e09\u4e2a\u6570\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"629","title":"K\u4e2a\u9006\u5e8f\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"630","title":"\u8bfe\u7a0b\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"631","title":"\u8bbe\u8ba1 Excel \u6c42\u548c\u516c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"632","title":"\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"633","title":"\u5e73\u65b9\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"634","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u9519\u4f4d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"635","title":"\u8bbe\u8ba1\u65e5\u5fd7\u5b58\u50a8\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"636","title":"\u51fd\u6570\u7684\u72ec\u5360\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"637","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"638","title":"\u5927\u793c\u5305","__typename":"AppliedTranslationNode"},{"questionId":"639","title":"\u89e3\u7801\u65b9\u6cd5 II","__typename":"AppliedTranslationNode"},{"questionId":"640","title":"\u6c42\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"642","title":"\u8bbe\u8ba1\u641c\u7d22\u81ea\u52a8\u8865\u5168\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"643","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 I","__typename":"AppliedTranslationNode"},{"questionId":"644","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"645","title":"\u9519\u8bef\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"646","title":"\u6700\u957f\u6570\u5bf9\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"647","title":"\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"648","title":"\u5355\u8bcd\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"649","title":"Dota2 \u53c2\u8bae\u9662","__typename":"AppliedTranslationNode"},{"questionId":"650","title":"\u53ea\u6709\u4e24\u4e2a\u952e\u7684\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"651","title":"4\u952e\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"652","title":"\u5bfb\u627e\u91cd\u590d\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"653","title":"\u4e24\u6570\u4e4b\u548c IV - \u8f93\u5165 BST","__typename":"AppliedTranslationNode"},{"questionId":"654","title":"\u6700\u5927\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"655","title":"\u8f93\u51fa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"656","title":"\u91d1\u5e01\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"657","title":"\u673a\u5668\u4eba\u80fd\u5426\u8fd4\u56de\u539f\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"658","title":"\u627e\u5230 K \u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"659","title":"\u5206\u5272\u6570\u7ec4\u4e3a\u8fde\u7eed\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"660","title":"\u79fb\u9664 9","__typename":"AppliedTranslationNode"},{"questionId":"661","title":"\u56fe\u7247\u5e73\u6ed1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"662","title":"\u4e8c\u53c9\u6811\u6700\u5927\u5bbd\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"663","title":"\u5747\u5300\u6811\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"664","title":"\u5947\u602a\u7684\u6253\u5370\u673a","__typename":"AppliedTranslationNode"},{"questionId":"665","title":"\u975e\u9012\u51cf\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"666","title":"\u8def\u5f84\u603b\u548c IV","__typename":"AppliedTranslationNode"},{"questionId":"667","title":"\u4f18\u7f8e\u7684\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"668","title":"\u4e58\u6cd5\u8868\u4e2d\u7b2ck\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"669","title":"\u4fee\u526a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"670","title":"\u6700\u5927\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"671","title":"\u4e8c\u53c9\u6811\u4e2d\u7b2c\u4e8c\u5c0f\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"672","title":"\u706f\u6ce1\u5f00\u5173 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"673","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"674","title":"\u6700\u957f\u8fde\u7eed\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"675","title":"\u4e3a\u9ad8\u5c14\u592b\u6bd4\u8d5b\u780d\u6811","__typename":"AppliedTranslationNode"},{"questionId":"676","title":"\u5b9e\u73b0\u4e00\u4e2a\u9b54\u6cd5\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"677","title":"\u952e\u503c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"678","title":"\u6709\u6548\u7684\u62ec\u53f7\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"679","title":"24 \u70b9\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"680","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"681","title":"\u6700\u8fd1\u65f6\u523b","__typename":"AppliedTranslationNode"},{"questionId":"682","title":"\u68d2\u7403\u6bd4\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"683","title":"K \u4e2a\u5173\u95ed\u7684\u706f\u6ce1","__typename":"AppliedTranslationNode"},{"questionId":"684","title":"\u5197\u4f59\u8fde\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"685","title":"\u5197\u4f59\u8fde\u63a5 II","__typename":"AppliedTranslationNode"},{"questionId":"686","title":"\u91cd\u590d\u53e0\u52a0\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"687","title":"\u6700\u957f\u540c\u503c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"688","title":"\u201c\u9a6c\u201d\u5728\u68cb\u76d8\u4e0a\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"689","title":"\u4e09\u4e2a\u65e0\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"690","title":"\u5458\u5de5\u7684\u91cd\u8981\u6027","__typename":"AppliedTranslationNode"},{"questionId":"691","title":"\u8d34\u7eb8\u62fc\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"692","title":"\u524dK\u4e2a\u9ad8\u9891\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"693","title":"\u4ea4\u66ff\u4f4d\u4e8c\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"694","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"695","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"696","title":"\u8ba1\u6570\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"697","title":"\u6570\u7ec4\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"698","title":"\u5212\u5206\u4e3ak\u4e2a\u76f8\u7b49\u7684\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"699","title":"\u6389\u843d\u7684\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"711","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"712","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5c0fASCII\u5220\u9664\u548c","__typename":"AppliedTranslationNode"},{"questionId":"713","title":"\u4e58\u79ef\u5c0f\u4e8eK\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"714","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u624b\u7eed\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"715","title":"Range \u6a21\u5757","__typename":"AppliedTranslationNode"},{"questionId":"716","title":"\u6700\u5927\u6808","__typename":"AppliedTranslationNode"},{"questionId":"717","title":"1\u6bd4\u7279\u4e0e2\u6bd4\u7279\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"718","title":"\u6700\u957f\u91cd\u590d\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"719","title":"\u627e\u51fa\u7b2c k \u5c0f\u7684\u8ddd\u79bb\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"720","title":"\u8bcd\u5178\u4e2d\u6700\u957f\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"721","title":"\u8d26\u6237\u5408\u5e76","__typename":"AppliedTranslationNode"},{"questionId":"722","title":"\u5220\u9664\u6ce8\u91ca","__typename":"AppliedTranslationNode"},{"questionId":"723","title":"\u7c89\u788e\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"724","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u4e0b\u6807","__typename":"AppliedTranslationNode"},{"questionId":"725","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"726","title":"\u539f\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"727","title":"\u6700\u5c0f\u7a97\u53e3\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"728","title":"\u81ea\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"729","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 I","__typename":"AppliedTranslationNode"},{"questionId":"730","title":"\u7edf\u8ba1\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"731","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"732","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"733","title":"\u56fe\u50cf\u6e32\u67d3","__typename":"AppliedTranslationNode"},{"questionId":"734","title":"\u53e5\u5b50\u76f8\u4f3c\u6027","__typename":"AppliedTranslationNode"},{"questionId":"735","title":"\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"736","title":"Lisp \u8bed\u6cd5\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"737","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 II","__typename":"AppliedTranslationNode"},{"questionId":"738","title":"\u5355\u8c03\u9012\u589e\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"739","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"740","title":"\u5220\u9664\u5e76\u83b7\u5f97\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"741","title":"\u6458\u6a31\u6843","__typename":"AppliedTranslationNode"},{"questionId":"742","title":"\u8f6c\u6362\u6210\u5c0f\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"743","title":"\u4e8c\u53c9\u6811\u6700\u8fd1\u7684\u53f6\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"744","title":"\u7f51\u7edc\u5ef6\u8fdf\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"745","title":"\u5bfb\u627e\u6bd4\u76ee\u6807\u5b57\u6bcd\u5927\u7684\u6700\u5c0f\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"746","title":"\u524d\u7f00\u548c\u540e\u7f00\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"747","title":"\u4f7f\u7528\u6700\u5c0f\u82b1\u8d39\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"748","title":"\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"749","title":"\u6700\u77ed\u8865\u5168\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"750","title":"\u9694\u79bb\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"751","title":"\u89d2\u77e9\u5f62\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"752","title":"IP \u5230 CIDR","__typename":"AppliedTranslationNode"},{"questionId":"753","title":"\u6253\u5f00\u8f6c\u76d8\u9501","__typename":"AppliedTranslationNode"},{"questionId":"754","title":"\u7834\u89e3\u4fdd\u9669\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"755","title":"\u5230\u8fbe\u7ec8\u70b9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"756","title":"\u5012\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"757","title":"\u91d1\u5b57\u5854\u8f6c\u6362\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"758","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u5316\u4e3a\u6392\u5e8f\u7684\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"759","title":"\u8bbe\u7f6e\u4ea4\u96c6\u5927\u5c0f\u81f3\u5c11\u4e3a2","__typename":"AppliedTranslationNode"},{"questionId":"760","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u52a0\u7c97\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"761","title":"\u5458\u5de5\u7a7a\u95f2\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"762","title":"\u627e\u51fa\u53d8\u4f4d\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"763","title":"\u7279\u6b8a\u7684\u4e8c\u8fdb\u5236\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"764","title":"N \u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"765","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"766","title":"\u6241\u5e73\u5316\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"767","title":"\u4e8c\u8fdb\u5236\u8868\u793a\u4e2d\u8d28\u6570\u4e2a\u8ba1\u7b97\u7f6e\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"768","title":"\u5212\u5206\u5b57\u6bcd\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"769","title":"\u6700\u5927\u52a0\u53f7\u6807\u5fd7","__typename":"AppliedTranslationNode"},{"questionId":"770","title":"\u60c5\u4fa3\u7275\u624b","__typename":"AppliedTranslationNode"},{"questionId":"771","title":"\u5c06 N \u53c9\u6811\u7f16\u7801\u4e3a\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"772","title":"\u5efa\u7acb\u56db\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"773","title":"\u56db\u53c9\u6811\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"774","title":"N \u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"775","title":"N \u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"776","title":"N \u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"777","title":"\u6258\u666e\u5229\u8328\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"778","title":"\u91cd\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"779","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757 II","__typename":"AppliedTranslationNode"},{"questionId":"780","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757","__typename":"AppliedTranslationNode"},{"questionId":"781","title":"\u57fa\u672c\u8ba1\u7b97\u5668 IV","__typename":"AppliedTranslationNode"},{"questionId":"782","title":"\u5b9d\u77f3\u4e0e\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"783","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"784","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u63d2\u5165\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"785","title":"\u57fa\u672c\u8ba1\u7b97\u5668 III","__typename":"AppliedTranslationNode"},{"questionId":"786","title":"\u641c\u7d22\u957f\u5ea6\u672a\u77e5\u7684\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"787","title":"\u6ed1\u52a8\u8c1c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"788","title":"\u6700\u5c0f\u5316\u53bb\u52a0\u6cb9\u7ad9\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"789","title":"\u6570\u636e\u6d41\u4e2d\u7684\u7b2c K \u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"790","title":"\u5168\u5c40\u5012\u7f6e\u4e0e\u5c40\u90e8\u5012\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"791","title":"\u62c6\u5206\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"792","title":"\u4e8c\u5206\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"793","title":"\u5728LR\u5b57\u7b26\u4e32\u4e2d\u4ea4\u6362\u76f8\u90bb\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"794","title":"\u6c34\u4f4d\u4e0a\u5347\u7684\u6cf3\u6c60\u4e2d\u6e38\u6cf3","__typename":"AppliedTranslationNode"},{"questionId":"795","title":"\u7b2cK\u4e2a\u8bed\u6cd5\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"796","title":"\u5230\u8fbe\u7ec8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"797","title":"\u68ee\u6797\u4e2d\u7684\u5154\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"798","title":"\u53d8\u4e3a\u68cb\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"799","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8282\u70b9\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"800","title":"\u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"801","title":"\u5224\u65ad\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"802","title":"\u7b2c K \u4e2a\u6700\u5c0f\u7684\u7d20\u6570\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"803","title":"K \u7ad9\u4e2d\u8f6c\u5185\u6700\u4fbf\u5b9c\u7684\u822a\u73ed","__typename":"AppliedTranslationNode"},{"questionId":"804","title":"\u65cb\u8f6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"805","title":"\u9003\u8131\u963b\u788d\u8005","__typename":"AppliedTranslationNode"},{"questionId":"806","title":"\u591a\u7c73\u8bfa\u548c\u6258\u7c73\u8bfa\u5e73\u94fa","__typename":"AppliedTranslationNode"},{"questionId":"807","title":"\u81ea\u5b9a\u4e49\u5b57\u7b26\u4e32\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"808","title":"\u5339\u914d\u5b50\u5e8f\u5217\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"809","title":"\u9636\u4e58\u51fd\u6570\u540e K \u4e2a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"810","title":"\u6709\u6548\u7684\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"811","title":"\u533a\u95f4\u5b50\u6570\u7ec4\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"812","title":"\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"813","title":"\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"814","title":"\u5f97\u5206\u6700\u9ad8\u7684\u6700\u5c0f\u8f6e\u8c03","__typename":"AppliedTranslationNode"},{"questionId":"815","title":"\u9999\u69df\u5854","__typename":"AppliedTranslationNode"},{"questionId":"816","title":"\u8bbe\u8ba1\u54c8\u5e0c\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"817","title":"\u8bbe\u8ba1\u54c8\u5e0c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"818","title":"\u76f8\u4f3c RGB \u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"819","title":"\u4f7f\u5e8f\u5217\u9012\u589e\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"820","title":"\u627e\u5230\u6700\u7ec8\u7684\u5b89\u5168\u72b6\u6001","__typename":"AppliedTranslationNode"},{"questionId":"821","title":"\u6253\u7816\u5757","__typename":"AppliedTranslationNode"},{"questionId":"822","title":"\u552f\u4e00\u6469\u5c14\u65af\u5bc6\u7801\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"823","title":"\u6570\u7ec4\u7684\u5747\u503c\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"824","title":"\u5199\u5b57\u7b26\u4e32\u9700\u8981\u7684\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"825","title":"\u4fdd\u6301\u57ce\u5e02\u5929\u9645\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"826","title":"\u5206\u6c64","__typename":"AppliedTranslationNode"},{"questionId":"827","title":"\u60c5\u611f\u4e30\u5bcc\u7684\u6587\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"828","title":"\u9ed1\u677f\u5f02\u6216\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"829","title":"\u5b50\u57df\u540d\u8bbf\u95ee\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"830","title":"\u6700\u5927\u4e09\u89d2\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"831","title":"\u6700\u5927\u5e73\u5747\u503c\u548c\u7684\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"832","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"833","title":"\u516c\u4ea4\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"834","title":"\u6a21\u7cca\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"835","title":"\u94fe\u8868\u7ec4\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"836","title":"\u8d5b\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"837","title":"\u6700\u5e38\u89c1\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"838","title":"\u8bbe\u8ba1\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"839","title":"\u5355\u8bcd\u7684\u538b\u7f29\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"841","title":"\u5b57\u7b26\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"842","title":"\u7ffb\u8f6c\u5361\u7247\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"843","title":"\u5e26\u56e0\u5b50\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"850","title":"\u5faa\u73af\u6709\u5e8f\u5217\u8868\u7684\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"851","title":"\u5c71\u7f8a\u62c9\u4e01\u6587","__typename":"AppliedTranslationNode"},{"questionId":"852","title":"\u9002\u9f84\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"853","title":"\u5b89\u6392\u5de5\u4f5c\u4ee5\u8fbe\u5230\u6700\u5927\u6536\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"854","title":"\u6700\u5927\u4eba\u5de5\u5c9b","__typename":"AppliedTranslationNode"},{"questionId":"855","title":"\u7edf\u8ba1\u5b50\u4e32\u4e2d\u7684\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"856","title":"\u8fde\u7eed\u6574\u6570\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"857","title":"\u8f83\u5927\u5206\u7ec4\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"858","title":"\u9690\u85cf\u4e2a\u4eba\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"859","title":"\u8bbe\u8ba1\u5faa\u73af\u53cc\u7aef\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"860","title":"\u8bbe\u8ba1\u5faa\u73af\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"861","title":"\u7ffb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"862","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u67e5\u627e\u4e0e\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"863","title":"\u6811\u4e2d\u8ddd\u79bb\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"864","title":"\u56fe\u50cf\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"865","title":"\u626b\u5730\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"866","title":"\u77e9\u5f62\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"867","title":"\u65b021\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"868","title":"\u63a8\u591a\u7c73\u8bfa","__typename":"AppliedTranslationNode"},{"questionId":"869","title":"\u76f8\u4f3c\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"870","title":"\u77e9\u9635\u4e2d\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"871","title":"\u94a5\u5319\u548c\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"872","title":"\u5c06\u6570\u7ec4\u62c6\u5206\u6210\u6590\u6ce2\u90a3\u5951\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"873","title":"\u731c\u731c\u8fd9\u4e2a\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"874","title":"\u6bd4\u8f83\u542b\u9000\u683c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"875","title":"\u6570\u7ec4\u4e2d\u7684\u6700\u957f\u5c71\u8109","__typename":"AppliedTranslationNode"},{"questionId":"876","title":"\u4e00\u624b\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"877","title":"\u8bbf\u95ee\u6240\u6709\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"878","title":"\u5b57\u6bcd\u79fb\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"879","title":"\u5230\u6700\u8fd1\u7684\u4eba\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"880","title":"\u77e9\u5f62\u9762\u79ef II","__typename":"AppliedTranslationNode"},{"questionId":"881","title":"\u55a7\u95f9\u548c\u5bcc\u6709","__typename":"AppliedTranslationNode"},{"questionId":"882","title":"\u5c71\u8109\u6570\u7ec4\u7684\u5cf0\u9876\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"883","title":"\u8f66\u961f","__typename":"AppliedTranslationNode"},{"questionId":"884","title":"\u76f8\u4f3c\u5ea6\u4e3a K \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"885","title":"\u8003\u573a\u5c31\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"886","title":"\u62ec\u53f7\u7684\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"887","title":"\u96c7\u4f63 K \u540d\u5de5\u4eba\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"888","title":"\u955c\u9762\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"889","title":"\u4eb2\u5bc6\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"890","title":"\u67e0\u6aac\u6c34\u627e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"891","title":"\u7ffb\u8f6c\u77e9\u9635\u540e\u7684\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"892","title":"\u548c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"893","title":"\u4e8c\u53c9\u6811\u4e2d\u6240\u6709\u8ddd\u79bb\u4e3a K \u7684\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"894","title":"\u9ed1\u540d\u5355\u4e2d\u7684\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"895","title":"\u83b7\u53d6\u6240\u6709\u94a5\u5319\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"896","title":"\u5177\u6709\u6240\u6709\u6700\u6df1\u8282\u70b9\u7684\u6700\u5c0f\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"897","title":"\u56de\u6587\u7d20\u6570","__typename":"AppliedTranslationNode"},{"questionId":"898","title":"\u8f6c\u7f6e\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"899","title":"\u4e8c\u8fdb\u5236\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"900","title":"\u91cd\u65b0\u6392\u5e8f\u5f97\u5230 2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"901","title":"\u4f18\u52bf\u6d17\u724c","__typename":"AppliedTranslationNode"},{"questionId":"902","title":"\u6700\u4f4e\u52a0\u6cb9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"903","title":"\u7528 Rand7() \u5b9e\u73b0 Rand10()","__typename":"AppliedTranslationNode"},{"questionId":"904","title":"\u53f6\u5b50\u76f8\u4f3c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"905","title":"\u6700\u957f\u7684\u6590\u6ce2\u90a3\u5951\u5b50\u5e8f\u5217\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"906","title":"\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"907","title":"\u7231\u5403\u9999\u8549\u7684\u73c2\u73c2","__typename":"AppliedTranslationNode"},{"questionId":"908","title":"\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"909","title":"\u77f3\u5b50\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"910","title":"\u7b2c N \u4e2a\u795e\u5947\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"911","title":"\u76c8\u5229\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"912","title":"\u6309\u6743\u91cd\u968f\u673a\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"913","title":"\u968f\u673a\u7ffb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"914","title":"\u975e\u91cd\u53e0\u77e9\u5f62\u4e2d\u7684\u968f\u673a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"915","title":"\u5728\u5706\u5185\u968f\u673a\u751f\u6210\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"916","title":"\u7d22\u5f15\u5904\u7684\u89e3\u7801\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"917","title":"\u6551\u751f\u8247","__typename":"AppliedTranslationNode"},{"questionId":"918","title":"\u7ec6\u5206\u56fe\u4e2d\u7684\u53ef\u5230\u8fbe\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"919","title":"\u4e09\u7ef4\u5f62\u4f53\u6295\u5f71\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"920","title":"\u4e24\u53e5\u8bdd\u4e2d\u7684\u4e0d\u5e38\u89c1\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"921","title":"\u87ba\u65cb\u77e9\u9635 III","__typename":"AppliedTranslationNode"},{"questionId":"922","title":"\u53ef\u80fd\u7684\u4e8c\u5206\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"923","title":"\u9e21\u86cb\u6389\u843d","__typename":"AppliedTranslationNode"},{"questionId":"924","title":"\u516c\u5e73\u7684\u7cd6\u679c\u68d2\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"925","title":"\u6839\u636e\u524d\u5e8f\u548c\u540e\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"926","title":"\u67e5\u627e\u548c\u66ff\u6362\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"927","title":"\u5b50\u5e8f\u5217\u5bbd\u5ea6\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"928","title":"\u4e09\u7ef4\u5f62\u4f53\u7684\u8868\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"929","title":"\u7279\u6b8a\u7b49\u4ef7\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"930","title":"\u6240\u6709\u53ef\u80fd\u7684\u6ee1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"931","title":"\u6700\u5927\u9891\u7387\u6808","__typename":"AppliedTranslationNode"},{"questionId":"932","title":"\u5355\u8c03\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"933","title":"\u9012\u589e\u987a\u5e8f\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"934","title":"\u5b50\u6570\u7ec4\u6309\u4f4d\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"935","title":"\u6709\u5e8f\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"936","title":"RLE \u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"937","title":"\u80a1\u7968\u4ef7\u683c\u8de8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"938","title":"\u6700\u5927\u4e3a N \u7684\u6570\u5b57\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"939","title":"DI \u5e8f\u5217\u7684\u6709\u6548\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"940","title":"\u6c34\u679c\u6210\u7bee","__typename":"AppliedTranslationNode"},{"questionId":"941","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"942","title":"\u8d85\u7ea7\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"943","title":"\u5b50\u6570\u7ec4\u7684\u6700\u5c0f\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"944","title":"\u6700\u5c0f\u5dee\u503c I","__typename":"AppliedTranslationNode"},{"questionId":"945","title":"\u86c7\u68af\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"946","title":"\u6700\u5c0f\u5dee\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"947","title":"\u5728\u7ebf\u9009\u4e3e","__typename":"AppliedTranslationNode"},{"questionId":"948","title":"\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"949","title":"\u732b\u548c\u8001\u9f20","__typename":"AppliedTranslationNode"},{"questionId":"950","title":"\u5361\u724c\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"951","title":"\u5206\u5272\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"952","title":"\u5355\u8bcd\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"953","title":"\u4ec5\u4ec5\u53cd\u8f6c\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"954","title":"\u73af\u5f62\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"955","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u63d2\u5165\u5668","__typename":"AppliedTranslationNode"},{"questionId":"956","title":"\u64ad\u653e\u5217\u8868\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"957","title":"\u4f7f\u62ec\u53f7\u6709\u6548\u7684\u6700\u5c11\u6dfb\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"958","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"959","title":"\u4e09\u6570\u4e4b\u548c\u7684\u591a\u79cd\u53ef\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"960","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad","__typename":"AppliedTranslationNode"},{"questionId":"961","title":"\u957f\u6309\u952e\u5165","__typename":"AppliedTranslationNode"},{"questionId":"962","title":"\u5c06\u5b57\u7b26\u4e32\u7ffb\u8f6c\u5230\u5355\u8c03\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"963","title":"\u4e09\u7b49\u5206","__typename":"AppliedTranslationNode"},{"questionId":"964","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad II","__typename":"AppliedTranslationNode"},{"questionId":"965","title":"\u72ec\u7279\u7684\u7535\u5b50\u90ae\u4ef6\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"966","title":"\u548c\u76f8\u540c\u7684\u4e8c\u5143\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"967","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"968","title":"\u6f02\u4eae\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"969","title":"\u6700\u8fd1\u7684\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"971","title":"\u6700\u77ed\u7684\u6865","__typename":"AppliedTranslationNode"},{"questionId":"972","title":"\u9a91\u58eb\u62e8\u53f7\u5668","__typename":"AppliedTranslationNode"},{"questionId":"973","title":"\u6233\u5370\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"974","title":"\u91cd\u65b0\u6392\u5217\u65e5\u5fd7\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"975","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u8303\u56f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"976","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"977","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"978","title":"\u6709\u6548\u7684\u5c71\u8109\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"979","title":"\u589e\u51cf\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"980","title":"\u6700\u77ed\u8d85\u7ea7\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"981","title":"\u5220\u5217\u9020\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"982","title":"\u4f7f\u6570\u7ec4\u552f\u4e00\u7684\u6700\u5c0f\u589e\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"983","title":"\u9a8c\u8bc1\u6808\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"984","title":"\u79fb\u9664\u6700\u591a\u7684\u540c\u884c\u6216\u540c\u5217\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"985","title":"\u4ee4\u724c\u653e\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"986","title":"\u7ed9\u5b9a\u6570\u5b57\u80fd\u7ec4\u6210\u7684\u6700\u5927\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"987","title":"\u6309\u9012\u589e\u987a\u5e8f\u663e\u793a\u5361\u724c","__typename":"AppliedTranslationNode"},{"questionId":"988","title":"\u7ffb\u8f6c\u7b49\u4ef7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"989","title":"\u6309\u516c\u56e0\u6570\u8ba1\u7b97\u6700\u5927\u7ec4\u4ef6\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"990","title":"\u9a8c\u8bc1\u5916\u661f\u8bed\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"991","title":"\u4e8c\u500d\u6570\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"992","title":"\u5220\u5217\u9020\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"993","title":"\u6700\u9ad8\u7684\u5e7f\u544a\u724c","__typename":"AppliedTranslationNode"},{"questionId":"994","title":"N \u5929\u540e\u7684\u7262\u623f","__typename":"AppliedTranslationNode"},{"questionId":"998","title":"\u4e8c\u53c9\u6811\u7684\u5b8c\u5168\u6027\u68c0\u9a8c","__typename":"AppliedTranslationNode"},{"questionId":"999","title":"\u7531\u659c\u6760\u5212\u5206\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1000","title":"\u5220\u5217\u9020\u5e8f III","__typename":"AppliedTranslationNode"},{"questionId":"1001","title":"\u91cd\u590d N \u6b21\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1002","title":"\u6700\u5927\u5bbd\u5ea6\u5761","__typename":"AppliedTranslationNode"},{"questionId":"1003","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62 II","__typename":"AppliedTranslationNode"},{"questionId":"1004","title":"\u8868\u793a\u6570\u5b57\u7684\u6700\u5c11\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1005","title":"\u5355\u503c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1006","title":"\u5143\u97f3\u62fc\u5199\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1007","title":"\u8fde\u7eed\u5dee\u76f8\u540c\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1008","title":"\u76d1\u63a7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1009","title":"\u714e\u997c\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1010","title":"\u5f3a\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1011","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811\u4ee5\u5339\u914d\u5148\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1012","title":"\u76f8\u7b49\u7684\u6709\u7406\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1013","title":"\u6590\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1014","title":"\u6700\u63a5\u8fd1\u539f\u70b9\u7684 K \u4e2a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1016","title":"\u548c\u53ef\u88ab K \u6574\u9664\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1017","title":"\u5947\u5076\u8df3","__typename":"AppliedTranslationNode"},{"questionId":"1018","title":"\u4e09\u89d2\u5f62\u7684\u6700\u5927\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1019","title":"\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1020","title":"\u6700\u957f\u6e4d\u6d41\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1021","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u5206\u914d\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1022","title":"\u4e0d\u540c\u8def\u5f84 III","__typename":"AppliedTranslationNode"},{"questionId":"1023","title":"\u57fa\u4e8e\u65f6\u95f4\u7684\u952e\u503c\u5b58\u50a8","__typename":"AppliedTranslationNode"},{"questionId":"1024","title":"\u6309\u4f4d\u4e0e\u4e3a\u96f6\u7684\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1025","title":"\u6700\u4f4e\u7968\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1026","title":"\u4e0d\u542b AAA \u6216 BBB \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1027","title":"\u67e5\u8be2\u540e\u7684\u5076\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1028","title":"\u533a\u95f4\u5217\u8868\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1029","title":"\u4e8c\u53c9\u6811\u7684\u5782\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1030","title":"\u4ece\u53f6\u7ed3\u70b9\u5f00\u59cb\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1031","title":"\u6570\u7ec4\u5f62\u5f0f\u7684\u6574\u6570\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1032","title":"\u7b49\u5f0f\u65b9\u7a0b\u7684\u53ef\u6ee1\u8db3\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1033","title":"\u574f\u4e86\u7684\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1034","title":"K \u4e2a\u4e0d\u540c\u6574\u6570\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1035","title":"\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1036","title":"\u8150\u70c2\u7684\u6a58\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1037","title":"K \u8fde\u7eed\u4f4d\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1038","title":"\u6b63\u65b9\u5f62\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1039","title":"\u627e\u5230\u5c0f\u9547\u7684\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1040","title":"\u6700\u5927\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"1041","title":"\u53ef\u4ee5\u88ab\u4e00\u6b65\u6355\u83b7\u7684\u68cb\u5b50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1042","title":"\u5408\u5e76\u77f3\u5934\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1043","title":"\u7f51\u683c\u7167\u660e","__typename":"AppliedTranslationNode"},{"questionId":"1044","title":"\u67e5\u627e\u5171\u7528\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1045","title":"\u68c0\u67e5\u66ff\u6362\u540e\u7684\u8bcd\u662f\u5426\u6709\u6548","__typename":"AppliedTranslationNode"},{"questionId":"1046","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1047","title":"K \u6b21\u53d6\u53cd\u540e\u6700\u5927\u5316\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1048","title":"\u7b28\u9636\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"1049","title":"\u884c\u76f8\u7b49\u7684\u6700\u5c11\u591a\u7c73\u8bfa\u65cb\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"1050","title":"\u524d\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1051","title":"\u5f62\u6210\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1052","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1053","title":"\u6700\u5c0f\u5316\u820d\u5165\u8bef\u5dee\u4ee5\u6ee1\u8db3\u76ee\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1054","title":"\u5341\u8fdb\u5236\u6574\u6570\u7684\u53cd\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1055","title":"\u603b\u6301\u7eed\u65f6\u95f4\u53ef\u88ab 60 \u6574\u9664\u7684\u6b4c\u66f2","__typename":"AppliedTranslationNode"},{"questionId":"1056","title":"\u5728 D \u5929\u5185\u9001\u8fbe\u5305\u88f9\u7684\u80fd\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1057","title":"\u81f3\u5c11\u6709 1 \u4f4d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1058","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5217\u6700\u5c0f\u7684\u7b49\u6548\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1059","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7f3a\u5931\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1060","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1061","title":"\u6709\u6548\u5b50\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1062","title":"\u5c06\u6570\u7ec4\u5206\u6210\u548c\u76f8\u7b49\u7684\u4e09\u4e2a\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1063","title":"\u6700\u4f73\u89c2\u5149\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1064","title":"\u53ef\u88ab K \u6574\u9664\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1065","title":"\u5b50\u4e32\u80fd\u8868\u793a\u4ece 1 \u5230 N \u6570\u5b57\u7684\u4e8c\u8fdb\u5236\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1066","title":"\u4e0d\u52a8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1067","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d II","__typename":"AppliedTranslationNode"},{"questionId":"1068","title":"\u8303\u56f4\u5185\u7684\u6570\u5b57\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1069","title":"\u6613\u6df7\u6dc6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1070","title":"\u8d1f\u4e8c\u8fdb\u5236\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1071","title":"\u53ef\u88ab 5 \u6574\u9664\u7684\u4e8c\u8fdb\u5236\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1072","title":"\u94fe\u8868\u4e2d\u7684\u4e0b\u4e00\u4e2a\u66f4\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1073","title":"\u98de\u5730\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1074","title":"\u524d\u4e94\u79d1\u7684\u5747\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1075","title":"\u5b57\u7b26\u4e32\u7684\u7d22\u5f15\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1076","title":"\u82b1\u62ec\u53f7\u5c55\u5f00","__typename":"AppliedTranslationNode"},{"questionId":"1077","title":"\u6613\u6df7\u6dc6\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"1078","title":"\u5220\u9664\u6700\u5916\u5c42\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1079","title":"\u4ece\u6839\u5230\u53f6\u7684\u4e8c\u8fdb\u5236\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1080","title":"\u9a7c\u5cf0\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1081","title":"\u89c6\u9891\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1082","title":"\u6700\u5c0f\u5143\u7d20\u5404\u6570\u4f4d\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1083","title":"\u5c0f\u4e8e K \u7684\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1084","title":"\u957f\u5ea6\u4e3a K \u7684\u65e0\u91cd\u590d\u5b57\u7b26\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1085","title":"\u5f7c\u6b64\u719f\u8bc6\u7684\u6700\u65e9\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1086","title":"\u9664\u6570\u535a\u5f08","__typename":"AppliedTranslationNode"},{"questionId":"1087","title":"\u6700\u957f\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1088","title":"\u4e00\u6708\u6709\u591a\u5c11\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1089","title":"\u5220\u53bb\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3","__typename":"AppliedTranslationNode"},{"questionId":"1090","title":"\u963f\u59c6\u65af\u7279\u6717\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1091","title":"\u5b50\u6811\u7684\u6700\u5927\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1092","title":"\u8282\u70b9\u4e0e\u5176\u7956\u5148\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1093","title":"\u4ece\u5148\u5e8f\u904d\u5386\u8fd8\u539f\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1094","title":"\u8ddd\u79bb\u987a\u5e8f\u6392\u5217\u77e9\u9635\u5355\u5143\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1095","title":"\u4e24\u5730\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1096","title":"\u4e24\u4e2a\u975e\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1097","title":"\u5b57\u7b26\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1098","title":"\u6700\u5927\u552f\u4e00\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1099","title":"\u5f97\u5206\u6700\u9ad8\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1100","title":"\u6700\u4f4e\u6210\u672c\u8054\u901a\u6240\u6709\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1101","title":"\u5e73\u884c\u8bfe\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1102","title":"\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u5728\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1103","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed","__typename":"AppliedTranslationNode"},{"questionId":"1104","title":"\u8fb9\u6846\u7740\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1105","title":"\u4e0d\u76f8\u4ea4\u7684\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1106","title":"\u9003\u79bb\u5927\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1107","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1","__typename":"AppliedTranslationNode"},{"questionId":"1108","title":"\u7528\u6237\u7f51\u7ad9\u8bbf\u95ee\u884c\u4e3a\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1110","title":"\u516c\u8def\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1111","title":"\u591a\u8fb9\u5f62\u4e09\u89d2\u5256\u5206\u7684\u6700\u4f4e\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1112","title":"\u62fc\u5199\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1113","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed II","__typename":"AppliedTranslationNode"},{"questionId":"1114","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1115","title":"\u6709\u6548\u7684\u56de\u65cb\u9556","__typename":"AppliedTranslationNode"},{"questionId":"1116","title":"\u6700\u5927\u5c42\u5185\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1117","title":"\u5730\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1118","title":"\u5c06\u6570\u7ec4\u5206\u6210\u51e0\u4e2a\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1119","title":"\u56f0\u4e8e\u73af\u4e2d\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1120","title":"\u4e0d\u90bb\u63a5\u690d\u82b1","__typename":"AppliedTranslationNode"},{"questionId":"1121","title":"\u5206\u9694\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1122","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1123","title":"\u5355\u884c\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1124","title":"\u5b57\u7b26\u4e32\u8f6c\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1125","title":"\u8bbe\u8ba1\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1126","title":"\u8fde\u63a5\u68d2\u6750\u7684\u6700\u4f4e\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1127","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1128","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"1129","title":"\u6700\u957f\u5b57\u7b26\u4e32\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"1130","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"1131","title":"\u7edf\u8ba1\u53ea\u542b\u5355\u4e00\u5b57\u6bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1132","title":"\u524d\u540e\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1133","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5728\u6700\u540e\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1134","title":"\u4e0e\u76ee\u6807\u989c\u8272\u95f4\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1135","title":"\u4e70\u4e0b\u6240\u6709\u4ea7\u54c1\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1136","title":"\u5408\u4f5c\u8fc7\u81f3\u5c11\u4e09\u6b21\u7684\u6f14\u5458\u548c\u5bfc\u6f14","__typename":"AppliedTranslationNode"},{"questionId":"1137","title":"\u9ad8\u5ea6\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1138","title":"\u7231\u751f\u6c14\u7684\u4e66\u5e97\u8001\u677f","__typename":"AppliedTranslationNode"},{"questionId":"1139","title":"\u4ea4\u6362\u4e00\u6b21\u7684\u5148\u524d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1140","title":"\u8ddd\u79bb\u76f8\u7b49\u7684\u6761\u5f62\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1141","title":"\u6700\u591a\u53ef\u4ee5\u4e70\u5230\u7684\u82f9\u679c\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1142","title":"\u8fdb\u51fb\u7684\u9a91\u58eb","__typename":"AppliedTranslationNode"},{"questionId":"1143","title":"\u627e\u51fa\u6240\u6709\u884c\u4e2d\u6700\u5c0f\u516c\u5171\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1144","title":"\u6c34\u8d44\u6e90\u5206\u914d\u4f18\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1145","title":"\u5143\u7d20\u548c\u4e3a\u76ee\u6807\u503c\u7684\u5b50\u77e9\u9635\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1146","title":"\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1147","title":"\u6309\u5217\u7ffb\u8f6c\u5f97\u5230\u6700\u5927\u503c\u7b49\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1148","title":"\u8d1f\u4e8c\u8fdb\u5236\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1149","title":"\u4e09\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1150","title":"\u67e5\u627e\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1151","title":"\u6b65\u8fdb\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1152","title":"\u77e9\u9635\u4e2d 1 \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1153","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1154","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1155","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1156","title":"Bigram \u5206\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1157","title":"\u6839\u5230\u53f6\u8def\u5f84\u4e0a\u7684\u4e0d\u8db3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1159","title":"\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1160","title":"\u6d3b\u5b57\u5370\u5237","__typename":"AppliedTranslationNode"},{"questionId":"1161","title":"\u9879\u76ee\u5458\u5de5 I","__typename":"AppliedTranslationNode"},{"questionId":"1162","title":"\u9879\u76ee\u5458\u5de5II","__typename":"AppliedTranslationNode"},{"questionId":"1163","title":"\u9879\u76ee\u5458\u5de5 III","__typename":"AppliedTranslationNode"},{"questionId":"1164","title":"\u7b49\u5dee\u6570\u5217\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1165","title":"\u5b89\u6392\u4f1a\u8bae\u65e5\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1166","title":"\u629b\u63b7\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1167","title":"\u5efa\u9020\u8857\u533a\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1168","title":"\u590d\u5199\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1169","title":"\u53d7\u6807\u7b7e\u5f71\u54cd\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1170","title":"\u6700\u77ed\u516c\u5171\u8d85\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1171","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1172","title":"\u9500\u552e\u5206\u6790 I ","__typename":"AppliedTranslationNode"},{"questionId":"1173","title":"\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1174","title":"\u9500\u552e\u5206\u6790III","__typename":"AppliedTranslationNode"},{"questionId":"1175","title":"\u6570\u7ec4\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1176","title":"\u529b\u6263\u6392\u884c\u699c","__typename":"AppliedTranslationNode"},{"questionId":"1177","title":"\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1178","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1179","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1180","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1181","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1182","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 IV","__typename":"AppliedTranslationNode"},{"questionId":"1183","title":"\u5927\u6837\u672c\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1184","title":"\u62fc\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"1185","title":"\u5c71\u8109\u6570\u7ec4\u4e2d\u67e5\u627e\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1186","title":"H2O \u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"1187","title":"\u4ea4\u66ff\u6253\u5370FooBar","__typename":"AppliedTranslationNode"},{"questionId":"1188","title":"\u82b1\u62ec\u53f7\u5c55\u5f00 II","__typename":"AppliedTranslationNode"},{"questionId":"1189","title":"\u52a0\u5bc6\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1190","title":"\u6700\u5c0f\u516c\u5171\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1191","title":"\u8fd1\u4e49\u8bcd\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1192","title":"\u5206\u4eab\u5de7\u514b\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1193","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 V","__typename":"AppliedTranslationNode"},{"questionId":"1194","title":"\u4e8c\u53c9\u6811\u5bfb\u8def","__typename":"AppliedTranslationNode"},{"questionId":"1195","title":"\u5206\u7cd6\u679c II","__typename":"AppliedTranslationNode"},{"questionId":"1196","title":"\u586b\u5145\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1197","title":"\u89e3\u6790\u5e03\u5c14\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1198","title":"\u5c0f\u4f17\u4e66\u7c4d","__typename":"AppliedTranslationNode"},{"questionId":"1199","title":"\u5341\u516d\u8fdb\u5236\u9b54\u672f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1200","title":"\u5220\u9664\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1201","title":"\u5220\u9664\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1202","title":"\u5220\u9664\u56de\u6587\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1203","title":"\u6309\u5e8f\u6253\u5370","__typename":"AppliedTranslationNode"},{"questionId":"1204","title":"\u6bcf\u65e5\u65b0\u7528\u6237\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1205","title":"IP \u5730\u5740\u65e0\u6548\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1206","title":"\u822a\u73ed\u9884\u8ba2\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1207","title":"\u5220\u70b9\u6210\u6797","__typename":"AppliedTranslationNode"},{"questionId":"1208","title":"\u6709\u6548\u62ec\u53f7\u7684\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1209","title":"\u8bbe\u8ba1\u6709\u9650\u963b\u585e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1210","title":"\u5220\u9664\u67d0\u4e9b\u5143\u7d20\u540e\u7684\u6570\u7ec4\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1211","title":"\u5b57\u6bcd\u7ec4\u5408\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1212","title":"\u987a\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1213","title":"\u4e0d\u76f8\u4ea4\u7684\u63e1\u624b","__typename":"AppliedTranslationNode"},{"questionId":"1214","title":"\u6bcf\u4f4d\u5b66\u751f\u7684\u6700\u9ad8\u6210\u7ee9","__typename":"AppliedTranslationNode"},{"questionId":"1215","title":"\u62a5\u544a\u7684\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1216","title":"\u6253\u5370\u96f6\u4e0e\u5947\u5076\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1217","title":"\u6570\u7ec4\u7684\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1218","title":"\u6700\u6df1\u53f6\u8282\u70b9\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1219","title":"\u8868\u73b0\u826f\u597d\u7684\u6700\u957f\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1220","title":"\u6700\u5c0f\u7684\u5fc5\u8981\u56e2\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1221","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc725%\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1222","title":"\u5220\u9664\u88ab\u8986\u76d6\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1223","title":"\u5e26\u9608\u503c\u7684\u56fe\u8fde\u901a\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1224","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"1225","title":"\u67e5\u8be2\u6d3b\u8dc3\u4e1a\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1226","title":"\u7528\u6237\u8d2d\u4e70\u5e73\u53f0","__typename":"AppliedTranslationNode"},{"questionId":"1227","title":"\u7b49\u4ef7\u591a\u7c73\u8bfa\u9aa8\u724c\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1228","title":"\u53f6\u503c\u7684\u6700\u5c0f\u4ee3\u4ef7\u751f\u6210\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1229","title":"\u989c\u8272\u4ea4\u66ff\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1230","title":"\u7edd\u5bf9\u503c\u8868\u8fbe\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1231","title":"\u5c06\u6bcf\u4e2a\u5143\u7d20\u66ff\u6362\u4e3a\u53f3\u4fa7\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1232","title":"\u8f6c\u53d8\u6570\u7ec4\u540e\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1233","title":"\u77e9\u5f62\u5185\u8239\u53ea\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1234","title":"\u6700\u5927\u5f97\u5206\u7684\u8def\u5f84\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1236","title":"\u7b2c N \u4e2a\u6cf0\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1237","title":"\u62a5\u544a\u7684\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"1238","title":"\u5b57\u6bcd\u677f\u4e0a\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1239","title":"\u6700\u5927\u7684\u4ee5 1 \u4e3a\u8fb9\u754c\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1240","title":"\u77f3\u5b50\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"1241","title":"\u89e3\u538b\u7f29\u7f16\u7801\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1242","title":"\u77e9\u9635\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1243","title":"\u7956\u7236\u8282\u70b9\u503c\u4e3a\u5076\u6570\u7684\u8282\u70b9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1244","title":"\u4e0d\u540c\u7684\u5faa\u73af\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1245","title":"\u67e5\u8be2\u8fd130\u5929\u6d3b\u8dc3\u7528\u6237\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1246","title":"\u8fc7\u53bb30\u5929\u7684\u7528\u6237\u6d3b\u52a8 II","__typename":"AppliedTranslationNode"},{"questionId":"1247","title":"\u9012\u51cf\u5143\u7d20\u4f7f\u6570\u7ec4\u5448\u952f\u9f7f\u72b6","__typename":"AppliedTranslationNode"},{"questionId":"1248","title":"\u4e8c\u53c9\u6811\u7740\u8272\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1249","title":"\u5feb\u7167\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1250","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1251","title":"\u6bb5\u5f0f\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1252","title":"\u7834\u574f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1253","title":"\u5c06\u77e9\u9635\u6309\u5bf9\u89d2\u7ebf\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1254","title":"\u5c42\u6570\u6700\u6df1\u53f6\u5b50\u8282\u70b9\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1255","title":"\u7ffb\u8f6c\u5b50\u6570\u7ec4\u5f97\u5230\u6700\u5927\u7684\u6570\u7ec4\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1256","title":"\u6570\u7ec4\u5e8f\u53f7\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1257","title":"\u77e9\u9635\u8f6c\u6362\u540e\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1258","title":"\u6587\u7ae0\u6d4f\u89c8 I","__typename":"AppliedTranslationNode"},{"questionId":"1259","title":"\u6587\u7ae0\u6d4f\u89c8 II","__typename":"AppliedTranslationNode"},{"questionId":"1260","title":"\u4e00\u5e74\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1261","title":"\u5355\u5b57\u7b26\u91cd\u590d\u5b50\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1262","title":"\u5b50\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1263","title":"\u63b7\u9ab0\u5b50\u7684N\u79cd\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1264","title":"\u53ef\u4ee5\u8f93\u5165\u7684\u6700\u5927\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1267","title":"\u4ece\u94fe\u8868\u4e2d\u5220\u53bb\u603b\u548c\u503c\u4e3a\u96f6\u7684\u8fde\u7eed\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1268","title":"\u5e02\u573a\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1269","title":"\u5e02\u573a\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1270","title":"\u9910\u76d8\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1271","title":"\u7f51\u7edc\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1272","title":"\u67e5\u8be2\u65e0\u6548\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1273","title":"\u6bd4\u8f83\u5b57\u7b26\u4e32\u6700\u5c0f\u5b57\u6bcd\u51fa\u73b0\u9891\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"1274","title":"\u65e5\u671f\u4e4b\u95f4\u9694\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1275","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1276","title":"\u6700\u63a5\u8fd1\u7684\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1277","title":"\u5f62\u6210\u4e09\u7684\u6700\u5927\u500d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1278","title":"\u6307\u5b9a\u65e5\u671f\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1279","title":"\u8d28\u6570\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1280","title":"\u5065\u8eab\u8ba1\u5212\u8bc4\u4f30","__typename":"AppliedTranslationNode"},{"questionId":"1281","title":"\u6784\u5efa\u56de\u6587\u4e32\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"1282","title":"\u731c\u5b57\u8c1c","__typename":"AppliedTranslationNode"},{"questionId":"1283","title":"\u8f6c\u53d8\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1284","title":"\u56db\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1285","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u53d8\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"1286","title":"\u5e26\u9650\u5236\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1287","title":"\u516c\u4ea4\u7ad9\u95f4\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1288","title":"\u5220\u9664\u4e00\u6b21\u5f97\u5230\u5b50\u6570\u7ec4\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1289","title":"\u4e00\u5468\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1290","title":"\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1291","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 I","__typename":"AppliedTranslationNode"},{"questionId":"1292","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 II","__typename":"AppliedTranslationNode"},{"questionId":"1293","title":"\u5b58\u5728\u8fde\u7eed\u4e09\u4e2a\u5947\u6570\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1295","title":"\u6536\u96c6\u8db3\u591f\u82f9\u679c\u7684\u6700\u5c0f\u82b1\u56ed\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1296","title":"\u6811\u8282\u70b9\u7684\u7b2c K \u4e2a\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1297","title":"\u201c\u6c14\u7403\u201d \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1298","title":"\u53cd\u8f6c\u6bcf\u5bf9\u62ec\u53f7\u95f4\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1299","title":"K \u6b21\u4e32\u8054\u540e\u6700\u5927\u5b50\u6570\u7ec4\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1300","title":"\u67e5\u627e\u96c6\u7fa4\u5185\u7684\u300c\u5173\u952e\u8fde\u63a5\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1301","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u90e8\u95e8\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1302","title":"\u5220\u9664\u5b57\u7b26\u4f7f\u5b57\u7b26\u4e32\u53d8\u597d","__typename":"AppliedTranslationNode"},{"questionId":"1304","title":"\u6700\u957f\u5feb\u4e50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1305","title":"\u961f\u5217\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1306","title":"\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1307","title":"\u4e11\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1308","title":"\u4ea4\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1309","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1311","title":"\u6700\u5927\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1313","title":"\u7edf\u8ba1\u4e3a\u8681\u7fa4\u6784\u7b51\u623f\u95f4\u7684\u4e0d\u540c\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1316","title":"\u4ea4\u66ff\u6253\u5370\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1317","title":"\u6bcf\u6708\u4ea4\u6613 I","__typename":"AppliedTranslationNode"},{"questionId":"1318","title":"\u9526\u6807\u8d5b\u4f18\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1319","title":"\u72ec\u4e00\u65e0\u4e8c\u7684\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1320","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"1321","title":"\u5c3d\u53ef\u80fd\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1322","title":"\u7a7f\u8fc7\u8ff7\u5bab\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1324","title":"\u7403\u4f1a\u843d\u4f55\u5904","__typename":"AppliedTranslationNode"},{"questionId":"1325","title":"\u6982\u7387\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1326","title":"\u5411\u4e0b\u53d6\u6574\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1327","title":"\u6700\u540e\u4e00\u4e2a\u80fd\u8fdb\u5165\u7535\u68af\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1328","title":"\u6bcf\u6708\u4ea4\u6613II","__typename":"AppliedTranslationNode"},{"questionId":"1329","title":"\u73a9\u7b79\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1330","title":"\u6700\u957f\u5b9a\u5dee\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1331","title":"\u9ec4\u91d1\u77ff\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"1332","title":"\u7edf\u8ba1\u5143\u97f3\u5b57\u6bcd\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1336","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1337","title":"\u8bbe\u8ba1\u8df3\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1338","title":"\u67e5\u8be2\u7ed3\u679c\u7684\u8d28\u91cf\u548c\u5360\u6bd4","__typename":"AppliedTranslationNode"},{"questionId":"1339","title":"\u67e5\u8be2\u7403\u961f\u79ef\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1340","title":"\u54f2\u5b66\u5bb6\u8fdb\u9910","__typename":"AppliedTranslationNode"},{"questionId":"1341","title":"\u5206\u5272\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1342","title":"\u53ef\u4ee5\u653b\u51fb\u56fd\u738b\u7684\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"1343","title":"\u63b7\u9ab0\u5b50\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"1344","title":"\u6700\u5927\u76f8\u7b49\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1345","title":"\u5b57\u7b26\u4e32\u7684\u5de6\u53f3\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1349","title":"\u7f00\u70b9\u6210\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1350","title":"\u5220\u9664\u5b50\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"1351","title":"\u66ff\u6362\u5b50\u4e32\u5f97\u5230\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1352","title":"\u89c4\u5212\u517c\u804c\u5de5\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1357","title":"\u62a5\u544a\u7cfb\u7edf\u72b6\u6001\u7684\u8fde\u7eed\u65e5\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1358","title":"\u627e\u51fa\u7ed9\u5b9a\u65b9\u7a0b\u7684\u6b63\u6574\u6570\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"1359","title":"\u5faa\u73af\u7801\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1360","title":"\u4e32\u8054\u5b57\u7b26\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1361","title":"\u94fa\u74f7\u7816","__typename":"AppliedTranslationNode"},{"questionId":"1362","title":"\u98de\u673a\u5ea7\u4f4d\u5206\u914d\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1364","title":"\u540c\u79ef\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1366","title":"\u7b2c\u4e00\u4e2a\u552f\u4e00\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1367","title":"\u5806\u53e0\u957f\u65b9\u4f53\u7684\u6700\u5927\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1368","title":"\u591a\u7ebf\u7a0b\u7f51\u9875\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1369","title":"\u4ea4\u6362\u5b57\u7b26\u4f7f\u5f97\u5b57\u7b26\u4e32\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"1370","title":"\u7edf\u8ba1\u300c\u4f18\u7f8e\u5b50\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1371","title":"\u79fb\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1372","title":"\u68c0\u67e5\u300c\u597d\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1374","title":"\u81f3\u5c11\u6709\u4e00\u4e2a 1 \u7684\u6700\u5de6\u7aef\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1377","title":"\u6bcf\u4e2a\u5e16\u5b50\u7684\u8bc4\u8bba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1378","title":"\u5947\u6570\u503c\u5355\u5143\u683c\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1379","title":"\u91cd\u6784 2 \u884c\u4e8c\u8fdb\u5236\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1380","title":"\u7edf\u8ba1\u5c01\u95ed\u5c9b\u5c7f\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1381","title":"\u5f97\u5206\u6700\u9ad8\u7684\u5355\u8bcd\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1384","title":"\u627e\u51fa\u9002\u5e94\u5c4f\u5e55\u7684\u6700\u5927\u5b57\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1386","title":"\u4e8c\u7ef4\u7f51\u683c\u8fc1\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1387","title":"\u5728\u53d7\u6c61\u67d3\u7684\u4e8c\u53c9\u6811\u4e2d\u67e5\u627e\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1388","title":"\u53ef\u88ab\u4e09\u6574\u9664\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1389","title":"\u63a8\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1390","title":"\u5e73\u5747\u552e\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1391","title":"\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1395","title":"\u8bbf\u95ee\u6240\u6709\u70b9\u7684\u6700\u5c0f\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1396","title":"\u7edf\u8ba1\u53c2\u4e0e\u901a\u4fe1\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1397","title":"\u641c\u7d22\u63a8\u8350\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1398","title":"\u505c\u5728\u539f\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1399","title":"\u9875\u9762\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1400","title":"\u627e\u51fa\u4e95\u5b57\u68cb\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1401","title":"\u4e0d\u6d6a\u8d39\u539f\u6599\u7684\u6c49\u5821\u5236\u4f5c\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1402","title":"\u7edf\u8ba1\u5168\u4e3a 1 \u7684\u6b63\u65b9\u5f62\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1403","title":"\u5206\u5272\u56de\u6587\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1404","title":"\u9006\u5e8f\u6253\u5370\u4e0d\u53ef\u53d8\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1405","title":"\u5411\u516c\u53f8CEO\u6c47\u62a5\u5de5\u4f5c\u7684\u6240\u6709\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1406","title":"\u6574\u6570\u7684\u5404\u4f4d\u79ef\u548c\u4e4b\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1407","title":"\u7528\u6237\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1408","title":"\u4f7f\u7ed3\u679c\u4e0d\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c0f\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1409","title":"\u8f6c\u5316\u4e3a\u5168\u96f6\u77e9\u9635\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1410","title":"\u7ea2\u7eff\u706f\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1411","title":"\u4e8c\u8fdb\u5236\u94fe\u8868\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1413","title":"\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u6b63\u65b9\u5f62\u7684\u6700\u5927\u8fb9\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1414","title":"\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1415","title":"\u5b66\u751f\u4eec\u53c2\u52a0\u5404\u79d1\u6d4b\u8bd5\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1420","title":"\u627e\u5230\u8fde\u7eed\u533a\u95f4\u7684\u5f00\u59cb\u548c\u7ed3\u675f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1421","title":"\u7edf\u8ba1\u4f4d\u6570\u4e3a\u5076\u6570\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1422","title":"\u5212\u5206\u6570\u7ec4\u4e3a\u8fde\u7eed\u6570\u5b57\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1423","title":"\u5b50\u4e32\u7684\u6700\u5927\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1424","title":"\u4f60\u80fd\u4ece\u76d2\u5b50\u91cc\u83b7\u5f97\u7684\u6700\u5927\u7cd6\u679c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1425","title":"\u4e0d\u540c\u56fd\u5bb6\u7684\u5929\u6c14\u7c7b\u578b","__typename":"AppliedTranslationNode"},{"questionId":"1426","title":"\u548c\u4e3a\u96f6\u7684N\u4e2a\u552f\u4e00\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1427","title":"\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u6240\u6709\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1428","title":"\u8df3\u8dc3\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1429","title":"\u53e3\u7b97\u96be\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1432","title":"\u5224\u65ad\u7ed9\u5b9a\u7684\u5e8f\u5217\u662f\u5426\u662f\u4e8c\u53c9\u6811\u4ece\u6839\u5230\u53f6\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1434","title":"\u89e3\u7801\u5b57\u6bcd\u5230\u6574\u6570\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1435","title":"\u5b50\u6570\u7ec4\u5f02\u6216\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1436","title":"\u83b7\u53d6\u4f60\u597d\u53cb\u5df2\u89c2\u770b\u7684\u89c6\u9891","__typename":"AppliedTranslationNode"},{"questionId":"1437","title":"\u8ba9\u5b57\u7b26\u4e32\u6210\u4e3a\u56de\u6587\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1438","title":"\u6c42\u56e2\u961f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1439","title":"\u4e0d\u540c\u6027\u522b\u6bcf\u65e5\u5206\u6570\u603b\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1440","title":"\u5c06\u6574\u6570\u8f6c\u6362\u4e3a\u4e24\u4e2a\u65e0\u96f6\u6574\u6570\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1441","title":"\u6216\u8fd0\u7b97\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1442","title":"\u8fde\u901a\u7f51\u7edc\u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1443","title":"\u4e8c\u6307\u8f93\u5165\u7684\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1444","title":"\u5c06\u6570\u5b57\u53d8\u6210 0 \u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1445","title":"\u5927\u5c0f\u4e3a K \u4e14\u5e73\u5747\u503c\u5927\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1446","title":"\u65f6\u949f\u6307\u9488\u7684\u5939\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"1447","title":"\u8df3\u8dc3\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1448","title":"6 \u548c 9 \u7ec4\u6210\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1449","title":"\u7ad6\u76f4\u6253\u5370\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1450","title":"\u5220\u9664\u7ed9\u5b9a\u503c\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1451","title":"\u704c\u6e89\u82b1\u56ed\u7684\u6700\u5c11\u6c34\u9f99\u5934\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1452","title":"\u9910\u9986\u8425\u4e1a\u989d\u53d8\u5316\u589e\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1453","title":"\u5e7f\u544a\u6548\u679c","__typename":"AppliedTranslationNode"},{"questionId":"1454","title":"\u5220\u9664\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1455","title":"\u9910\u5385\u8fc7\u6ee4\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1456","title":"\u9608\u503c\u8ddd\u79bb\u5185\u90bb\u5c45\u6700\u5c11\u7684\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1457","title":"\u5de5\u4f5c\u8ba1\u5212\u7684\u6700\u4f4e\u96be\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1458","title":"\u6839\u636e\u6570\u5b57\u4e8c\u8fdb\u5236\u4e0b 1 \u7684\u6570\u76ee\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1459","title":"\u6bcf\u9694 n \u4e2a\u987e\u5ba2\u6253\u6298","__typename":"AppliedTranslationNode"},{"questionId":"1460","title":"\u5305\u542b\u6240\u6709\u4e09\u79cd\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1461","title":"\u6709\u6548\u7684\u5feb\u9012\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1462","title":"\u5217\u51fa\u6307\u5b9a\u65f6\u95f4\u6bb5\u5185\u6240\u6709\u7684\u4e0b\u5355\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1463","title":"\u77e9\u9635\u4e2d\u6218\u6597\u529b\u6700\u5f31\u7684 K \u884c","__typename":"AppliedTranslationNode"},{"questionId":"1464","title":"\u6570\u7ec4\u5927\u5c0f\u51cf\u534a","__typename":"AppliedTranslationNode"},{"questionId":"1465","title":"\u5206\u88c2\u4e8c\u53c9\u6811\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1466","title":"\u8df3\u8dc3\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1467","title":"\u6bcf\u6b21\u8bbf\u95ee\u7684\u4ea4\u6613\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1468","title":"\u68c0\u67e5\u6574\u6570\u53ca\u5176\u4e24\u500d\u6570\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1469","title":"\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1470","title":"\u63a8\u6587\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1471","title":"\u53c2\u52a0\u8003\u8bd5\u7684\u6700\u5927\u5b66\u751f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1472","title":"\u4e0a\u5347\u4e0b\u964d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1473","title":"\u6bcf\u4e2a\u5143\u97f3\u5305\u542b\u5076\u6570\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1474","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u957f\u4ea4\u9519\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1475","title":"\u4e8c\u53c9\u641c\u7d22\u5b50\u6811\u7684\u6700\u5927\u952e\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1476","title":"\u7edf\u8ba1\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u8d1f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1477","title":"\u6700\u540e K \u4e2a\u6570\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1478","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1479","title":"\u591a\u6b21\u6c42\u548c\u6784\u9020\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1480","title":"\u7535\u5f71\u8bc4\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1481","title":"\u9662\u7cfb\u65e0\u6548\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1482","title":"\u6709\u591a\u5c11\u5c0f\u4e8e\u5f53\u524d\u6570\u5b57\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1483","title":"\u901a\u8fc7\u6295\u7968\u5bf9\u56e2\u961f\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1484","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1485","title":"\u4f7f\u7f51\u683c\u56fe\u81f3\u5c11\u6709\u4e00\u6761\u6709\u6548\u8def\u5f84\u7684\u6700\u5c0f\u4ee3\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1486","title":"\u4e24\u4e2a\u6570\u7ec4\u95f4\u7684\u8ddd\u79bb\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1487","title":"\u5b89\u6392\u7535\u5f71\u9662\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1488","title":"\u5c06\u6574\u6570\u6309\u6743\u91cd\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1489","title":"3n \u5757\u62ab\u8428","__typename":"AppliedTranslationNode"},{"questionId":"1490","title":"\u751f\u6210\u6bcf\u79cd\u5b57\u7b26\u90fd\u662f\u5947\u6570\u4e2a\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1491","title":"\u706f\u6ce1\u5f00\u5173 III","__typename":"AppliedTranslationNode"},{"questionId":"1492","title":"\u901a\u77e5\u6240\u6709\u5458\u5de5\u6240\u9700\u7684\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1493","title":"T \u79d2\u540e\u9752\u86d9\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1494","title":"\u6d3b\u52a8\u53c2\u4e0e\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1495","title":"\u987e\u5ba2\u7684\u53ef\u4fe1\u8054\u7cfb\u4eba\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1496","title":"\u77e9\u9635\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1497","title":"\u8bbe\u8ba1\u4e00\u4e2a\u652f\u6301\u589e\u91cf\u64cd\u4f5c\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1498","title":"\u627e\u51fa\u514b\u9686\u4e8c\u53c9\u6811\u4e2d\u7684\u76f8\u540c\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1499","title":"\u6700\u5927\u7684\u56e2\u961f\u8868\u73b0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1500","title":"\u7edf\u8ba1\u6700\u5927\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1501","title":"\u5706\u548c\u77e9\u5f62\u662f\u5426\u6709\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"1502","title":"\u6784\u9020 K \u4e2a\u56de\u6587\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1503","title":"\u505a\u83dc\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1504","title":"\u83b7\u53d6\u6700\u8fd1\u7b2c\u4e8c\u6b21\u7684\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1505","title":"\u6309\u65e2\u5b9a\u987a\u5e8f\u521b\u5efa\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1507","title":"\u68c0\u67e5\u7f51\u683c\u4e2d\u662f\u5426\u5b58\u5728\u6709\u6548\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1508","title":"\u6700\u957f\u5feb\u4e50\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1509","title":"\u4f7f\u7528\u552f\u4e00\u6807\u8bc6\u7801\u66ff\u6362\u5458\u5de5ID","__typename":"AppliedTranslationNode"},{"questionId":"1510","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1511","title":"\u7edf\u8ba1\u4f5c\u6218\u5355\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1512","title":"\u8bbe\u8ba1\u5730\u94c1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1513","title":"\u627e\u5230\u6240\u6709\u597d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1514","title":"\u9010\u6b65\u6c42\u548c\u5f97\u5230\u6b63\u6570\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1515","title":"\u548c\u4e3a K \u7684\u6700\u5c11\u6590\u6ce2\u90a3\u5951\u6570\u5b57\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1516","title":"\u957f\u5ea6\u4e3a n \u7684\u5f00\u5fc3\u5b57\u7b26\u4e32\u4e2d\u5b57\u5178\u5e8f\u7b2c k \u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1517","title":"\u6062\u590d\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1518","title":"\u6309\u5e74\u5ea6\u5217\u51fa\u9500\u552e\u603b\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1519","title":"\u975e\u9012\u589e\u987a\u5e8f\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1520","title":"\u5c06\u4e8c\u8fdb\u5236\u8868\u793a\u51cf\u5230 1 \u7684\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1522","title":"\u77f3\u5b50\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1523","title":"\u80a1\u7968\u7684\u8d44\u672c\u635f\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"1524","title":"\u6570\u7ec4\u4e2d\u7684\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1525","title":"\u67e5\u8be2\u5e26\u952e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1526","title":"HTML \u5b9e\u4f53\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1527","title":"\u7ed9 N x 3 \u7f51\u683c\u56fe\u6d82\u8272\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1528","title":"\u62e5\u6709\u6700\u591a\u7cd6\u679c\u7684\u5b69\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1529","title":"\u6539\u53d8\u4e00\u4e2a\u6574\u6570\u80fd\u5f97\u5230\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1530","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u6253\u7834\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1531","title":"\u6bcf\u4e2a\u4eba\u6234\u4e0d\u540c\u5e3d\u5b50\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1532","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1533","title":"\u70b9\u83dc\u5c55\u793a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1534","title":"\u6570\u9752\u86d9","__typename":"AppliedTranslationNode"},{"questionId":"1535","title":"\u751f\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1536","title":"\u8d2d\u4e70\u4e86\u4ea7\u54c1 A \u548c\u4ea7\u54c1 B \u5374\u6ca1\u6709\u8d2d\u4e70\u4ea7\u54c1 C \u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1537","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1538","title":"\u53ef\u83b7\u5f97\u7684\u6700\u5927\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1539","title":"\u5bf9\u89d2\u7ebf\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"1541","title":"\u6392\u540d\u9760\u524d\u7684\u65c5\u884c\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1542","title":"\u8fde\u7eed\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1543","title":"\u6700\u7b80\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1544","title":"\u7edf\u8ba1\u4e8c\u53c9\u6811\u4e2d\u597d\u8282\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1545","title":"\u6570\u4f4d\u6210\u672c\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1546","title":"\u67e5\u627e\u6210\u7ee9\u5904\u4e8e\u4e2d\u6e38\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1547","title":"\u65c5\u884c\u7ec8\u70b9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"1548","title":"\u662f\u5426\u6240\u6709 1 \u90fd\u81f3\u5c11\u76f8\u9694 k \u4e2a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1549","title":"\u7edd\u5bf9\u5dee\u4e0d\u8d85\u8fc7\u9650\u5236\u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1550","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u7b2c k \u4e2a\u6700\u5c0f\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1551","title":"\u51c0\u73b0\u503c\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1552","title":"\u7528\u6808\u64cd\u4f5c\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1553","title":"\u5f62\u6210\u4e24\u4e2a\u5f02\u6216\u76f8\u7b49\u6570\u7ec4\u7684\u4e09\u5143\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1554","title":"\u6536\u96c6\u6811\u4e0a\u6240\u6709\u82f9\u679c\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1555","title":"\u5207\u62ab\u8428\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1556","title":"\u901a\u8fc7\u7ffb\u8f6c\u5b50\u6570\u7ec4\u4f7f\u4e24\u4e2a\u6570\u7ec4\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1557","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u5305\u542b\u6240\u6709\u957f\u5ea6\u4e3a K \u7684\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1558","title":"\u8bfe\u7a0b\u8868 IV","__typename":"AppliedTranslationNode"},{"questionId":"1559","title":"\u6458\u6a31\u6843 II","__typename":"AppliedTranslationNode"},{"questionId":"1560","title":"\u5728\u65e2\u5b9a\u65f6\u95f4\u505a\u4f5c\u4e1a\u7684\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1561","title":"\u91cd\u65b0\u6392\u5217\u53e5\u5b50\u4e2d\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1562","title":"\u6536\u85cf\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1563","title":"\u5706\u5f62\u9776\u5185\u7684\u6700\u5927\u98de\u9556\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1564","title":"\u5236\u4f5c\u4f1a\u8bdd\u67f1\u72b6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1565","title":"\u8ba1\u7b97\u5e03\u5c14\u8868\u8fbe\u5f0f\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1566","title":"\u68c0\u67e5\u5355\u8bcd\u662f\u5426\u4e3a\u53e5\u4e2d\u5176\u4ed6\u5355\u8bcd\u7684\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1567","title":"\u5b9a\u957f\u5b50\u4e32\u4e2d\u5143\u97f3\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1568","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u4f2a\u56de\u6587\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1569","title":"\u4e24\u4e2a\u5b50\u5e8f\u5217\u7684\u6700\u5927\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1570","title":"\u5546\u54c1\u6298\u6263\u540e\u7684\u6700\u7ec8\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1571","title":"\u5b89\u6392\u90ae\u7b52","__typename":"AppliedTranslationNode"},{"questionId":"1572","title":"\u5b50\u77e9\u5f62\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1573","title":"\u627e\u4e24\u4e2a\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1574","title":"\u6570\u7ec4\u4e2d\u4e24\u5143\u7d20\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1575","title":"\u5207\u5272\u540e\u9762\u79ef\u6700\u5927\u7684\u86cb\u7cd5","__typename":"AppliedTranslationNode"},{"questionId":"1576","title":"\u91cd\u65b0\u89c4\u5212\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1577","title":"\u4e24\u4e2a\u76d2\u5b50\u4e2d\u7403\u7684\u989c\u8272\u6570\u76f8\u540c\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1578","title":"\u82f9\u679c\u548c\u6854\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1579","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1580","title":"\u91cd\u65b0\u6392\u5217\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1581","title":"\u6570\u7ec4\u4e2d\u7684 k \u4e2a\u6700\u5f3a\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1582","title":"\u8bbe\u8ba1\u6d4f\u89c8\u5668\u5386\u53f2\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1583","title":"\u7c89\u5237\u623f\u5b50 III","__typename":"AppliedTranslationNode"},{"questionId":"1584","title":"\u53bb\u6389\u6700\u4f4e\u5de5\u8d44\u548c\u6700\u9ad8\u5de5\u8d44\u540e\u7684\u5de5\u8d44\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1585","title":"n \u7684\u7b2c k \u4e2a\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1586","title":"\u5220\u6389\u4e00\u4e2a\u5143\u7d20\u4ee5\u540e\u5168\u4e3a 1 \u7684\u6700\u957f\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1587","title":"\u5e76\u884c\u8bfe\u7a0b II","__typename":"AppliedTranslationNode"},{"questionId":"1603","title":"\u4e00\u7ef4\u6570\u7ec4\u7684\u52a8\u6001\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1604","title":"\u4e0d\u540c\u6574\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1605","title":"\u5236\u4f5c m \u675f\u82b1\u6240\u9700\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1607","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1608","title":"\u8ba1\u7b97\u7a0e\u540e\u5de5\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"1609","title":"\u5bfb\u627e\u6240\u6709\u7684\u72ec\u751f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1610","title":"\u6570\u7ec4\u5f02\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1611","title":"\u4fdd\u8bc1\u6587\u4ef6\u540d\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"1612","title":"\u907f\u514d\u6d2a\u6c34\u6cdb\u6ee5","__typename":"AppliedTranslationNode"},{"questionId":"1613","title":"\u627e\u5230\u6700\u5c0f\u751f\u6210\u6811\u91cc\u7684\u5173\u952e\u8fb9\u548c\u4f2a\u5173\u952e\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1615","title":"\u5b50\u6570\u7ec4\u548c\u6392\u5e8f\u540e\u7684\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1616","title":"\u4e09\u6b21\u64cd\u4f5c\u540e\u6700\u5927\u503c\u4e0e\u6700\u5c0f\u503c\u7684\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1617","title":"\u77f3\u5b50\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1618","title":"\u5220\u9664\u94fe\u8868 M \u4e2a\u8282\u70b9\u4e4b\u540e\u7684 N \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1619","title":"\u5224\u65ad\u8def\u5f84\u662f\u5426\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1620","title":"\u68c0\u67e5\u6570\u7ec4\u5bf9\u662f\u5426\u53ef\u4ee5\u88ab k \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1621","title":"\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1622","title":"\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1623","title":"\u5468\u5185\u6bcf\u5929\u7684\u9500\u552e\u60c5\u51b5","__typename":"AppliedTranslationNode"},{"questionId":"1624","title":"\u514b\u9686\u542b\u968f\u673a\u6307\u9488\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1625","title":"\u6309\u65e5\u671f\u5206\u7ec4\u9500\u552e\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1626","title":"\u5224\u65ad\u80fd\u5426\u5f62\u6210\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1627","title":"\u6240\u6709\u8682\u8681\u6389\u4e0b\u6765\u524d\u7684\u6700\u540e\u4e00\u523b","__typename":"AppliedTranslationNode"},{"questionId":"1628","title":"\u7edf\u8ba1\u5168 1 \u5b50\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1629","title":"\u6700\u591a K \u6b21\u4ea4\u6362\u76f8\u90bb\u6570\u4f4d\u540e\u5f97\u5230\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1630","title":"\u5728\u533a\u95f4\u8303\u56f4\u5185\u7edf\u8ba1\u5947\u6570\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1631","title":"\u548c\u4e3a\u5947\u6570\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1632","title":"\u5b57\u7b26\u4e32\u7684\u597d\u5206\u5272\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1633","title":"\u5f62\u6210\u76ee\u6807\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6700\u5c11\u589e\u52a0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1634","title":"\u514b\u9686 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1635","title":"\u597d\u6570\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1636","title":"\u4ec5\u542b 1 \u7684\u5b50\u4e32\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1637","title":"\u538b\u7f29\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"1638","title":"\u670d\u52a1\u4e2d\u5fc3\u7684\u6700\u4f73\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1639","title":"\u4e0a\u6708\u64ad\u653e\u7684\u513f\u7ae5\u9002\u5b9c\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"1640","title":"\u8bbe\u8ba1\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1641","title":"\u53ef\u4ee5\u653e\u5fc3\u6295\u8d44\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1642","title":"\u6362\u9152\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1643","title":"\u5b50\u6811\u4e2d\u6807\u7b7e\u76f8\u540c\u7684\u8282\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1644","title":"\u6700\u591a\u7684\u4e0d\u91cd\u53e0\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1645","title":"\u627e\u5230\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u51fd\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1646","title":"\u7b2c k \u4e2a\u7f3a\u5931\u7684\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1647","title":"K \u6b21\u64cd\u4f5c\u8f6c\u53d8\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1648","title":"\u5e73\u8861\u62ec\u53f7\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1649","title":"\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u975e\u7a7a\u5b50\u6570\u7ec4\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1650","title":"\u627e\u5230 N \u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1651","title":"\u91cd\u65b0\u6392\u5217\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1652","title":"\u706f\u6ce1\u5f00\u5173 IV","__typename":"AppliedTranslationNode"},{"questionId":"1653","title":"\u597d\u53f6\u5b50\u8282\u70b9\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1654","title":"\u6d88\u8d39\u8005\u4e0b\u5355\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1655","title":"\u79fb\u52a8 N \u53c9\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1656","title":"\u7edf\u8ba1\u597d\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1657","title":"\u627e\u51fa\u6570\u7ec4\u6e38\u620f\u7684\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1658","title":"\u6392\u5e03\u4e8c\u8fdb\u5236\u7f51\u683c\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1659","title":"\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1660","title":"\u5343\u4f4d\u5206\u9694\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1661","title":"\u53ef\u4ee5\u5230\u8fbe\u6240\u6709\u70b9\u7684\u6700\u5c11\u70b9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1662","title":"\u5f97\u5230\u76ee\u6807\u6570\u7ec4\u7684\u6700\u5c11\u51fd\u6570\u8c03\u7528\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1663","title":"\u4e8c\u7ef4\u7f51\u683c\u56fe\u4e2d\u63a2\u6d4b\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1664","title":"\u67e5\u627e\u62e5\u6709\u6709\u6548\u90ae\u7bb1\u7684\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1665","title":"N \u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1666","title":"\u6574\u7406\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1667","title":"\u627e\u51fa\u7b2c N \u4e2a\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c K \u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1668","title":"\u627e\u51fa\u6700\u957f\u7684\u8d85\u8d5e\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1669","title":"\u5207\u68cd\u5b50\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1670","title":"\u60a3\u67d0\u79cd\u75be\u75c5\u7684\u60a3\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1671","title":"\u6700\u8fd1\u7684\u4e09\u7b14\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1672","title":"\u627e\u5230\u6700\u5927\u6574\u6570\u7684\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"1674","title":"\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1675","title":"\u4e24\u7403\u4e4b\u95f4\u7684\u78c1\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1676","title":"\u5403\u6389 N \u4e2a\u6a58\u5b50\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1677","title":"\u77e9\u9635\u5bf9\u89d2\u7ebf\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1678","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1679","title":"\u5220\u9664\u6700\u77ed\u7684\u5b50\u6570\u7ec4\u4f7f\u5269\u4f59\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1680","title":"\u7edf\u8ba1\u6240\u6709\u53ef\u884c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1681","title":"\u627e\u51fa\u9690\u85cf\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1682","title":"\u5706\u5f62\u8d5b\u9053\u4e0a\u7ecf\u8fc7\u6b21\u6570\u6700\u591a\u7684\u6247\u533a","__typename":"AppliedTranslationNode"},{"questionId":"1683","title":"\u4f60\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1684","title":"\u67e5\u627e\u5927\u5c0f\u4e3a M \u7684\u6700\u65b0\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1685","title":"\u77f3\u5b50\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1686","title":"\u4ea7\u54c1\u540d\u79f0\u683c\u5f0f\u4fee\u590d","__typename":"AppliedTranslationNode"},{"questionId":"1687","title":"\u56fe\u4e2d\u6700\u76f8\u4f3c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1688","title":"\u6bcf\u4ef6\u5546\u54c1\u7684\u6700\u65b0\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1689","title":"\u91cd\u590d\u81f3\u5c11 K \u6b21\u4e14\u957f\u5ea6\u4e3a M \u7684\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1690","title":"\u4e58\u79ef\u4e3a\u6b63\u6570\u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1691","title":"\u4f7f\u9646\u5730\u5206\u79bb\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1692","title":"\u5c06\u5b50\u6570\u7ec4\u91cd\u65b0\u6392\u5e8f\u5f97\u5230\u540c\u4e00\u4e2a\u4e8c\u53c9\u67e5\u627e\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1693","title":"\u6240\u6709\u5947\u6570\u957f\u5ea6\u5b50\u6570\u7ec4\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1694","title":"\u4f7f\u6570\u7ec4\u548c\u80fd\u88ab P \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1695","title":"\u6240\u6709\u6392\u5217\u4e2d\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1696","title":"\u5947\u602a\u7684\u6253\u5370\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"1697","title":"\u53ea\u6709\u4e00\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1698","title":"\u66ff\u6362\u6240\u6709\u7684\u95ee\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1699","title":"\u6570\u7684\u5e73\u65b9\u7b49\u4e8e\u4e24\u6570\u4e58\u79ef\u7684\u65b9\u6cd5\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1700","title":"\u907f\u514d\u91cd\u590d\u5b57\u6bcd\u7684\u6700\u5c0f\u5220\u9664\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1701","title":"\u4fdd\u8bc1\u56fe\u53ef\u5b8c\u5168\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1702","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981","__typename":"AppliedTranslationNode"},{"questionId":"1703","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc I","__typename":"AppliedTranslationNode"},{"questionId":"1704","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u7279\u6b8a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1705","title":"\u7edf\u8ba1\u4e0d\u5f00\u5fc3\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"1706","title":"\u8fde\u63a5\u6240\u6709\u70b9\u7684\u6700\u5c0f\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1707","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u901a\u8fc7\u6392\u5e8f\u5b50\u5b57\u7b26\u4e32\u5f97\u5230\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1708","title":"\u8bbe\u8ba1\u505c\u8f66\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1709","title":"\u8b66\u544a\u4e00\u5c0f\u65f6\u5185\u4f7f\u7528\u76f8\u540c\u5458\u5de5\u5361\u5927\u4e8e\u7b49\u4e8e\u4e09\u6b21\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1710","title":"\u627e\u5230\u5904\u7406\u6700\u591a\u8bf7\u6c42\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1711","title":"\u7ed9\u5b9a\u884c\u548c\u5217\u7684\u548c\u6c42\u53ef\u884c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1712","title":"\u6309\u6708\u7edf\u8ba1\u8ba2\u5355\u6570\u4e0e\u987e\u5ba2\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1713","title":"\u4e24\u4e2a\u7a00\u758f\u5411\u91cf\u7684\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1714","title":"\u91cd\u65b0\u6392\u5217\u5355\u8bcd\u95f4\u7684\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1715","title":"\u62c6\u5206\u5b57\u7b26\u4e32\u4f7f\u552f\u4e00\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee\u6700\u5927","__typename":"AppliedTranslationNode"},{"questionId":"1716","title":"\u77e9\u9635\u7684\u6700\u5927\u975e\u8d1f\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1717","title":"\u8fde\u901a\u4e24\u7ec4\u70b9\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1718","title":"\u4ed3\u5e93\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1719","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc II","__typename":"AppliedTranslationNode"},{"questionId":"1720","title":"\u6587\u4ef6\u5939\u64cd\u4f5c\u65e5\u5fd7\u641c\u96c6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1721","title":"\u7ecf\u8425\u6469\u5929\u8f6e\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"1722","title":"\u7687\u4f4d\u7ee7\u627f\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1723","title":"\u6700\u591a\u53ef\u8fbe\u6210\u7684\u6362\u697c\u8bf7\u6c42\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1724","title":"\u8fdb\u5e97\u5374\u672a\u8fdb\u884c\u8fc7\u4ea4\u6613\u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1725","title":"\u5927\u5c0f\u4e3a K \u7684\u4e0d\u91cd\u53e0\u7ebf\u6bb5\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1726","title":"\u7f51\u7edc\u4fe1\u53f7\u6700\u597d\u7684\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1727","title":"\u732b\u548c\u8001\u9f20 II","__typename":"AppliedTranslationNode"},{"questionId":"1728","title":"\u5947\u5999\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1729","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"1730","title":"\u7279\u6b8a\u6570\u7ec4\u7684\u7279\u5f81\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1731","title":"\u5947\u5076\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1732","title":"\u4f7f\u6574\u6570\u53d8\u4e3a 0 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1733","title":"\u53ef\u89c1\u70b9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1734","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981 II","__typename":"AppliedTranslationNode"},{"questionId":"1735","title":"\u6bcf\u4f4d\u987e\u5ba2\u6700\u7ecf\u5e38\u8ba2\u8d2d\u7684\u5546\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1736","title":"\u6839\u636e\u4e2d\u7f00\u8868\u8fbe\u5f0f\u6784\u9020\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1737","title":"\u62ec\u53f7\u7684\u6700\u5927\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1738","title":"\u6700\u5927\u7f51\u7edc\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1739","title":"\u5206\u5272\u4e24\u4e2a\u5b57\u7b26\u4e32\u5f97\u5230\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1740","title":"\u7edf\u8ba1\u5b50\u6811\u4e2d\u57ce\u5e02\u4e4b\u95f4\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1741","title":"\u6309\u7167\u9891\u7387\u5c06\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1742","title":"\u4e24\u70b9\u4e4b\u95f4\u4e0d\u5305\u542b\u4efb\u4f55\u70b9\u7684\u6700\u5bbd\u5782\u76f4\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1743","title":"\u7edf\u8ba1\u53ea\u5dee\u4e00\u4e2a\u5b57\u7b26\u7684\u5b50\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1744","title":"\u901a\u8fc7\u7ed9\u5b9a\u8bcd\u5178\u6784\u9020\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1745","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u6700\u8fd1\u7684\u53f3\u4fa7\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1746","title":"\u4e24\u4e2a\u76f8\u540c\u5b57\u7b26\u4e4b\u95f4\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1747","title":"\u6267\u884c\u64cd\u4f5c\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1748","title":"\u65e0\u77db\u76fe\u7684\u6700\u4f73\u7403\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1749","title":"\u6ca1\u6709\u5356\u51fa\u7684\u5356\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1750","title":"\u68c0\u67e5\u4e24\u68f5\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811\u662f\u5426\u7b49\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1751","title":"\u6309\u952e\u6301\u7eed\u65f6\u95f4\u6700\u957f\u7684\u952e","__typename":"AppliedTranslationNode"},{"questionId":"1752","title":"\u7b49\u5dee\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1753","title":"\u6700\u5c0f\u4f53\u529b\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1755","title":"\u62c6\u70b8\u5f39","__typename":"AppliedTranslationNode"},{"questionId":"1756","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1757","title":"\u5230\u5bb6\u7684\u6700\u5c11\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1758","title":"\u5206\u914d\u91cd\u590d\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1759","title":"\u627e\u5230\u9057\u5931\u7684ID","__typename":"AppliedTranslationNode"},{"questionId":"1760","title":"\u80fd\u5426\u8fde\u63a5\u5f62\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1761","title":"\u7edf\u8ba1\u5b57\u5178\u5e8f\u5143\u97f3\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1762","title":"\u53ef\u4ee5\u5230\u8fbe\u7684\u6700\u8fdc\u5efa\u7b51","__typename":"AppliedTranslationNode"},{"questionId":"1763","title":"\u4e09\u4eba\u56fd\u5bb6\u4ee3\u8868\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1764","title":"\u6700\u5927\u91cd\u590d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1765","title":"\u5408\u5e76\u4e24\u4e2a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1766","title":"\u5f97\u5230\u5c71\u5f62\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1767","title":"\u8bbe\u8ba1\u524d\u4e2d\u540e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1768","title":"\u8bbe\u8ba1\u5e26\u89e3\u6790\u51fd\u6570\u7684\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1769","title":"\u83b7\u53d6\u751f\u6210\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1770","title":"\u5b57\u7b26\u9891\u6b21\u552f\u4e00\u7684\u6700\u5c0f\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1771","title":"\u9500\u552e\u4ef7\u503c\u51cf\u5c11\u7684\u989c\u8272\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1772","title":"\u901a\u8fc7\u6307\u4ee4\u521b\u5efa\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1773","title":"\u5404\u8d5b\u4e8b\u7684\u7528\u6237\u6ce8\u518c\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1774","title":"\u6c42\u4e24\u4e2a\u591a\u9879\u5f0f\u94fe\u8868\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1775","title":"\u8bbe\u8ba1\u6709\u5e8f\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1776","title":"\u5c06 x \u51cf\u5230 0 \u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1777","title":"\u786e\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u63a5\u8fd1","__typename":"AppliedTranslationNode"},{"questionId":"1778","title":"\u6700\u5927\u5316\u7f51\u683c\u5e78\u798f\u611f","__typename":"AppliedTranslationNode"},{"questionId":"1779","title":"Hopper \u516c\u53f8\u67e5\u8be2 I","__typename":"AppliedTranslationNode"},{"questionId":"1780","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 II","__typename":"AppliedTranslationNode"},{"questionId":"1781","title":"\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u6570\u7ec4\u662f\u5426\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1782","title":"\u5177\u6709\u7ed9\u5b9a\u6570\u503c\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1783","title":"\u751f\u6210\u5e73\u8861\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1784","title":"\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u521d\u59cb\u80fd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1786","title":"\u7edf\u8ba1\u4e00\u81f4\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1787","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u5dee\u7edd\u5bf9\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1788","title":"\u77f3\u5b50\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1789","title":"\u4ece\u4ed3\u5e93\u5230\u7801\u5934\u8fd0\u8f93\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1790","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 III","__typename":"AppliedTranslationNode"},{"questionId":"1791","title":"\u6700\u5bcc\u6709\u5ba2\u6237\u7684\u8d44\u4ea7\u603b\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1792","title":"\u627e\u51fa\u6700\u5177\u7ade\u4e89\u529b\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1793","title":"\u4f7f\u6570\u7ec4\u4e92\u8865\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1794","title":"\u6570\u7ec4\u7684\u6700\u5c0f\u504f\u79fb\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1796","title":"\u7ea0\u6b63\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1797","title":"\u8bbe\u8ba1 Goal \u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1798","title":"K \u548c\u6570\u5bf9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1799","title":"\u6700\u5c0f\u4e0d\u517c\u5bb9\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1800","title":"\u8fde\u63a5\u8fde\u7eed\u4e8c\u8fdb\u5236\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1801","title":"\u6bcf\u53f0\u673a\u5668\u7684\u8fdb\u7a0b\u5e73\u5747\u8fd0\u884c\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1802","title":"\u65e0\u6cd5\u5403\u5348\u9910\u7684\u5b66\u751f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1803","title":"\u5e73\u5747\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1804","title":"\u4fee\u6539\u540e\u7684\u6700\u5927\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1805","title":"\u5f97\u5230\u8fde\u7eed K \u4e2a 1 \u7684\u6700\u5c11\u76f8\u90bb\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1806","title":"\u6bd4\u8d5b\u4e2d\u7684\u914d\u5bf9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1807","title":"\u5341-\u4e8c\u8fdb\u5236\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1808","title":"\u77f3\u5b50\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"1809","title":"\u6570\u7ec4\u4e2d\u7279\u6b8a\u7b49\u95f4\u8ddd\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1810","title":"\u6539\u53d8\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1811","title":"\u4fee\u590d\u8868\u4e2d\u7684\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1812","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1813","title":"\u5220\u9664\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1814","title":"\u8df3\u8dc3\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1815","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1816","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 IV","__typename":"AppliedTranslationNode"},{"questionId":"1817","title":"\u8ba1\u7b97\u529b\u6263\u94f6\u884c\u7684\u94b1","__typename":"AppliedTranslationNode"},{"questionId":"1818","title":"\u5220\u9664\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1819","title":"\u6784\u5efa\u5b57\u5178\u5e8f\u6700\u5927\u7684\u53ef\u884c\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1820","title":"\u91cd\u6784\u4e00\u68f5\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1821","title":"\u53d1\u7968\u4e2d\u7684\u4ea7\u54c1\u91d1\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1822","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"1823","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u7684\u4e24\u534a\u662f\u5426\u76f8\u4f3c","__typename":"AppliedTranslationNode"},{"questionId":"1824","title":"\u5403\u82f9\u679c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1825","title":"\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1826","title":"\u4e0e\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1827","title":"\u65e0\u6548\u7684\u63a8\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1828","title":"\u8ba1\u7b97\u5206\u914d\u7cd6\u679c\u7684\u4e0d\u540c\u65b9\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1829","title":"\u5361\u8f66\u4e0a\u7684\u6700\u5927\u5355\u5143\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1830","title":"\u5927\u9910\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1831","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e09\u4e2a\u5b50\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1832","title":"\u5f97\u5230\u5b50\u5e8f\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1833","title":"\u627e\u5230\u6700\u9ad8\u6d77\u62d4","__typename":"AppliedTranslationNode"},{"questionId":"1834","title":"\u9700\u8981\u6559\u8bed\u8a00\u7684\u6700\u5c11\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1835","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1836","title":"\u751f\u6210\u4e58\u79ef\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1837","title":"\u6bcf\u5929\u7684\u9886\u5bfc\u548c\u5408\u4f19\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1838","title":"\u5b57\u7b26\u4e32\u7684\u4e0d\u540c\u5b50\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1839","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1840","title":"\u6267\u884c\u4ea4\u6362\u64cd\u4f5c\u540e\u7684\u6700\u5c0f\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1842","title":"\u4e24\u4eba\u4e4b\u95f4\u7684\u901a\u8bdd\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1843","title":"\u53ef\u4ee5\u5f62\u6210\u6700\u5927\u6b63\u65b9\u5f62\u7684\u77e9\u5f62\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1844","title":"\u76d2\u5b50\u4e2d\u5c0f\u7403\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1845","title":"\u91cd\u65b0\u6392\u5217\u540e\u7684\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1847","title":"\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1848","title":"\u552f\u4e00\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1849","title":"\u4efb\u610f\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u503c\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1850","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e24\u7aef\u76f8\u540c\u5b57\u7b26\u540e\u7684\u6700\u77ed\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1851","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee II","__typename":"AppliedTranslationNode"},{"questionId":"1852","title":"\u8bbf\u95ee\u65e5\u671f\u4e4b\u95f4\u6700\u5927\u7684\u7a7a\u6863\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1858","title":"\u66ff\u6362\u9690\u85cf\u6570\u5b57\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1859","title":"\u6ee1\u8db3\u4e09\u6761\u4ef6\u4e4b\u4e00\u9700\u6539\u53d8\u7684\u6700\u5c11\u5b57\u7b26\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1860","title":"\u627e\u51fa\u7b2c K \u5927\u7684\u5f02\u6216\u5750\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1861","title":"\u653e\u7f6e\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1862","title":"\u82f9\u679c\u548c\u6a58\u5b50\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1865","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728 II","__typename":"AppliedTranslationNode"},{"questionId":"1866","title":"\u4ece\u76f8\u90bb\u5143\u7d20\u5bf9\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1871","title":"\u56de\u6587\u4e32\u5206\u5272 IV","__typename":"AppliedTranslationNode"},{"questionId":"1872","title":"\u4f60\u80fd\u5728\u4f60\u6700\u559c\u6b22\u7684\u90a3\u5929\u5403\u5230\u4f60\u6700\u559c\u6b22\u7684\u7cd6\u679c\u5417\uff1f","__typename":"AppliedTranslationNode"},{"questionId":"1873","title":"\u6700\u957f\u7684\u7f8e\u597d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1874","title":"\u901a\u8fc7\u8fde\u63a5\u53e6\u4e00\u4e2a\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u5f97\u5230\u4e00\u4e2a\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1875","title":"\u4e92\u8d28\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1876","title":"\u5730\u56fe\u4e2d\u7684\u6700\u9ad8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1877","title":"\u6c42\u5173\u6ce8\u8005\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1878","title":"\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u7ecf\u6392\u5e8f\u548c\u8f6e\u8f6c\u5f97\u5230","__typename":"AppliedTranslationNode"},{"questionId":"1879","title":"\u79fb\u9664\u77f3\u5b50\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1880","title":"\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5927\u7684\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1881","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1882","title":"\u6bcf\u4f4d\u7ecf\u7406\u7684\u4e0b\u5c5e\u5458\u5de5\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1883","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1884","title":"\u751f\u6210\u4ea4\u66ff\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1885","title":"\u7edf\u8ba1\u540c\u6784\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1886","title":"\u888b\u5b50\u91cc\u6700\u5c11\u6570\u76ee\u7684\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1887","title":"\u4e00\u4e2a\u56fe\u4e2d\u8fde\u901a\u4e09\u5143\u7ec4\u7684\u6700\u5c0f\u5ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1888","title":"\u627e\u5230\u6700\u8fd1\u7684\u6709\u76f8\u540c X \u6216 Y \u5750\u6807\u7684\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1889","title":"\u5224\u65ad\u4e00\u4e2a\u6570\u5b57\u662f\u5426\u53ef\u4ee5\u8868\u793a\u6210\u4e09\u7684\u5e42\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1890","title":"\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u7f8e\u4e3d\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1891","title":"\u7edf\u8ba1\u70b9\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1892","title":"\u67e5\u627e\u6bcf\u4e2a\u5458\u5de5\u82b1\u8d39\u7684\u603b\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1893","title":"\u7ecf\u8fc7\u4e00\u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1894","title":"\u4ea4\u66ff\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1895","title":"\u79fb\u52a8\u6240\u6709\u7403\u5230\u6bcf\u4e2a\u76d2\u5b50\u6240\u9700\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1896","title":"\u6267\u884c\u4e58\u6cd5\u8fd0\u7b97\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1897","title":"\u7531\u5b50\u5e8f\u5217\u6784\u9020\u7684\u6700\u957f\u56de\u6587\u4e32\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1898","title":"\u5e94\u8be5\u88ab\u7981\u6b62\u7684Leetflex\u8d26\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1899","title":"\u7edf\u8ba1\u5339\u914d\u68c0\u7d22\u89c4\u5219\u7684\u7269\u54c1\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1900","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u4ef7\u683c\u7684\u751c\u70b9\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1901","title":"\u901a\u8fc7\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1902","title":"\u8f66\u961f II","__typename":"AppliedTranslationNode"},{"questionId":"1903","title":"\u8bbe\u8ba1\u6700\u8fd1\u4f7f\u7528\uff08MRU\uff09\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1904","title":"\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e8c\u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1905","title":"\u8bbe\u8ba1\u4e00\u4e2a\u9a8c\u8bc1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1906","title":"N \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1907","title":"\u7edf\u8ba1\u5f02\u6216\u503c\u5728\u8303\u56f4\u5185\u7684\u6570\u5bf9\u6709\u591a\u5c11","__typename":"AppliedTranslationNode"},{"questionId":"1908","title":"\u53ef\u56de\u6536\u4e14\u4f4e\u8102\u7684\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1909","title":"\u80fd\u770b\u5230\u6d77\u666f\u7684\u5efa\u7b51\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1910","title":"\u68c0\u67e5\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1911","title":"\u6784\u6210\u7279\u5b9a\u548c\u9700\u8981\u6dfb\u52a0\u7684\u6700\u5c11\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1912","title":"\u4ece\u7b2c\u4e00\u4e2a\u8282\u70b9\u51fa\u53d1\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684\u53d7\u9650\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1913","title":"\u4f7f\u6240\u6709\u533a\u95f4\u7684\u5f02\u6216\u7ed3\u679c\u4e3a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1914","title":"\u5bfb\u627e\u6ca1\u6709\u88ab\u6267\u884c\u7684\u4efb\u52a1\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1915","title":"\u4ec5\u6267\u884c\u4e00\u6b21\u5b57\u7b26\u4e32\u4ea4\u6362\u80fd\u5426\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1916","title":"\u627e\u51fa\u661f\u578b\u56fe\u7684\u4e2d\u5fc3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1917","title":"\u6700\u5927\u5e73\u5747\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1918","title":"\u597d\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1919","title":"\u6309\u53d7\u6b22\u8fce\u7a0b\u5ea6\u6392\u5217\u529f\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"1920","title":"\u5224\u65ad\u56fd\u9645\u8c61\u68cb\u68cb\u76d8\u4e2d\u4e00\u4e2a\u683c\u5b50\u7684\u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1923","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 III","__typename":"AppliedTranslationNode"},{"questionId":"1924","title":"\u5f97\u5230\u65b0\u9c9c\u751c\u751c\u5708\u7684\u6700\u591a\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1925","title":"\u7edf\u8ba1\u4e00\u4e2a\u6570\u7ec4\u4e2d\u597d\u5bf9\u5b50\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1926","title":"\u6bcf\u5bb6\u5546\u5e97\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1927","title":"\u6700\u5927\u5347\u5e8f\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1928","title":"\u79ef\u538b\u8ba2\u5355\u4e2d\u7684\u8ba2\u5355\u603b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1929","title":"\u6709\u754c\u6570\u7ec4\u4e2d\u6307\u5b9a\u4e0b\u6807\u5904\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1930","title":"\u4f60\u80fd\u6784\u9020\u51fa\u8fde\u7eed\u503c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1931","title":"\u672a\u77e5\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1932","title":"\u5927\u6ee1\u8d2f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1933","title":"\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1934","title":"\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u62ec\u53f7\u5185\u5bb9","__typename":"AppliedTranslationNode"},{"questionId":"1935","title":"\u8fd8\u539f\u6392\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b65\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1936","title":"\u597d\u56e0\u5b50\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1937","title":"\u6700\u5927\u5316\u82b1\u56ed\u7684\u7f8e\u89c2\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1938","title":"\u6700\u5c11\u64cd\u4f5c\u4f7f\u6570\u7ec4\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1939","title":"\u7edf\u8ba1\u4e00\u4e2a\u5706\u4e2d\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1940","title":"\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1941","title":"\u4f7f\u5b57\u7b26\u4e32\u6709\u5e8f\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1942","title":"\u5458\u5de5\u7684\u76f4\u5c5e\u90e8\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"1943","title":"\u7edf\u8ba1\u8ddd\u79bb\u6700\u5c0f\u7684\u5b50\u4e32\u5bf9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1944","title":"\u622a\u65ad\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1945","title":"\u67e5\u627e\u7528\u6237\u6d3b\u8dc3\u5206\u949f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1946","title":"\u7edd\u5bf9\u5dee\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1947","title":"\u5e8f\u5217\u4e2d\u4e0d\u540c\u6700\u5927\u516c\u7ea6\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1948","title":"\u6bcf\u4e2a\u4ea7\u54c1\u5728\u4e0d\u540c\u5546\u5e97\u7684\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1949","title":"\u5b9e\u73b0 Trie \uff08\u524d\u7f00\u6811\uff09 II","__typename":"AppliedTranslationNode"},{"questionId":"1950","title":"\u6570\u7ec4\u5143\u7d20\u79ef\u7684\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1951","title":"\u627e\u51fa\u6e38\u620f\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1952","title":"\u6700\u5c11\u4fa7\u8df3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1953","title":"\u6c42\u51fa MK \u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1954","title":"\u5c06\u6240\u6709\u6570\u5b57\u7528\u5b57\u7b26\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1955","title":"\u5ea7\u4f4d\u9884\u7ea6\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1956","title":"\u51cf\u5c0f\u548c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\u540e\u7684\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1957","title":"\u6700\u8fd1\u7684\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1958","title":"\u6ca1\u6709\u5e7f\u544a\u7684\u5267\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1959","title":"\u9690\u85cf\u7f51\u683c\u4e0b\u7684\u6700\u5c0f\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1960","title":"\u5224\u65ad\u53e5\u5b50\u662f\u5426\u4e3a\u5168\u5b57\u6bcd\u53e5","__typename":"AppliedTranslationNode"},{"questionId":"1961","title":"\u96ea\u7cd5\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1962","title":"\u5355\u7ebf\u7a0b CPU","__typename":"AppliedTranslationNode"},{"questionId":"1963","title":"\u6240\u6709\u6570\u5bf9\u6309\u4f4d\u4e0e\u7ed3\u679c\u7684\u5f02\u6216\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1964","title":"\u5bfb\u627e\u9762\u8bd5\u5019\u9009\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1965","title":"K \u8fdb\u5236\u8868\u793a\u4e0b\u7684\u5404\u4f4d\u6570\u5b57\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1966","title":"\u6700\u9ad8\u9891\u5143\u7d20\u7684\u9891\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1967","title":"\u6240\u6709\u5143\u97f3\u6309\u987a\u5e8f\u6392\u5e03\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1968","title":"\u6700\u9ad8\u5efa\u7b51\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1969","title":"\u6700\u591a\u9080\u8bf7\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1970","title":"\u5c06\u53e5\u5b50\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1971","title":"\u589e\u957f\u7684\u5185\u5b58\u6cc4\u9732","__typename":"AppliedTranslationNode"},{"questionId":"1972","title":"\u65cb\u8f6c\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1974","title":"\u5bfb\u627e\u4eca\u5e74\u5177\u6709\u6b63\u6536\u5165\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1975","title":"\u5230\u76ee\u6807\u5143\u7d20\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1976","title":"\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u9012\u51cf\u7684\u8fde\u7eed\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1977","title":"\u5305\u542b\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1978","title":"\u90bb\u4f4d\u4ea4\u6362\u7684\u6700\u5c0f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1980","title":"\u6709\u7f3a\u9677\u7684\u4f20\u611f\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1981","title":"\u6bcf\u5929\u7684\u6700\u5927\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1982","title":"\u4ece\u672a\u6392\u5e8f\u7684\u94fe\u8868\u4e2d\u79fb\u9664\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1983","title":"\u4eba\u53e3\u6700\u591a\u7684\u5e74\u4efd","__typename":"AppliedTranslationNode"},{"questionId":"1984","title":"\u4e0b\u6807\u5bf9\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1985","title":"\u5b50\u6570\u7ec4\u6700\u5c0f\u4e58\u79ef\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1986","title":"\u6709\u5411\u56fe\u4e2d\u6700\u5927\u989c\u8272\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1987","title":"\u957f\u5ea6\u4e3a\u4e09\u4e14\u5404\u5b57\u7b26\u4e0d\u540c\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1988","title":"\u6570\u7ec4\u4e2d\u6700\u5927\u6570\u5bf9\u548c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1989","title":"\u4e24\u4e2a\u6570\u7ec4\u6700\u5c0f\u7684\u5f02\u6216\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1990","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u4e09\u4e2a\u83f1\u5f62\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1991","title":"\u8054\u8d5b\u4fe1\u606f\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1993","title":"\u627e\u51fa\u6240\u6709\u5b50\u96c6\u7684\u5f02\u6216\u603b\u548c\u518d\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1994","title":"\u6784\u6210\u4ea4\u66ff\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1995","title":"\u627e\u51fa\u548c\u4e3a\u6307\u5b9a\u503c\u7684\u4e0b\u6807\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1996","title":"\u6070\u6709 K \u6839\u6728\u68cd\u53ef\u4ee5\u770b\u5230\u7684\u6392\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1997","title":"\u4e0b\u4e2a\u7531\u76f8\u540c\u6570\u5b57\u6784\u6210\u7684\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1999","title":"\u54ea\u79cd\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u66f4\u957f","__typename":"AppliedTranslationNode"},{"questionId":"2000","title":"\u51c6\u65f6\u5230\u8fbe\u7684\u5217\u8f66\u6700\u5c0f\u65f6\u901f","__typename":"AppliedTranslationNode"},{"questionId":"2001","title":"\u8df3\u8dc3\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"2002","title":"\u77f3\u5b50\u6e38\u620f VIII","__typename":"AppliedTranslationNode"},{"questionId":"2003","title":"\u6bcf\u4e2a\u5b50\u6570\u7ec4\u7684\u6570\u5b57\u79cd\u7c7b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2004","title":"\u8f6c\u6362\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"2005","title":"\u68c0\u67e5\u662f\u5426\u533a\u57df\u5185\u6240\u6709\u6574\u6570\u90fd\u88ab\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"2006","title":"\u627e\u5230\u9700\u8981\u8865\u5145\u7c89\u7b14\u7684\u5b66\u751f\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2008","title":"\u53cd\u8f6c\u8868\u8fbe\u5f0f\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2009","title":"\u5305\u542b\u6240\u6709\u524d\u7f00\u7684\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"2010","title":"\u68c0\u67e5\u67d0\u5355\u8bcd\u662f\u5426\u7b49\u4e8e\u4e24\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2011","title":"\u63d2\u5165\u540e\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2012","title":"\u4f7f\u7528\u670d\u52a1\u5668\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"2013","title":"\u51c6\u65f6\u62b5\u8fbe\u4f1a\u8bae\u73b0\u573a\u7684\u6700\u5c0f\u8df3\u8fc7\u4f11\u606f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2015","title":"\u5224\u65ad\u77e9\u9635\u7ecf\u8f6e\u8f6c\u540e\u662f\u5426\u4e00\u81f4","__typename":"AppliedTranslationNode"},{"questionId":"2016","title":"\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49\u7684\u51cf\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2017","title":"\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u7b26\u4ea4\u66ff\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2018","title":"\u88c5\u5305\u88f9\u7684\u6700\u5c0f\u6d6a\u8d39\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2019","title":"\u4e24\u4e2a\u884c\u7a0b\u7f16\u7801\u6570\u7ec4\u7684\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2020","title":"\u5220\u9664\u4e00\u4e2a\u5143\u7d20\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"2021","title":"\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u51fa\u73b0\u7684\u7ed9\u5b9a\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2022","title":"\u6700\u5927\u5b50\u5e8f\u5217\u4ea4\u66ff\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2023","title":"\u8bbe\u8ba1\u7535\u5f71\u79df\u501f\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"2024","title":"\u8ba1\u7b97\u7279\u6b8a\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"2025","title":"\u91cd\u65b0\u5206\u914d\u5b57\u7b26\u4f7f\u6240\u6709\u5b57\u7b26\u4e32\u90fd\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"2026","title":"\u5408\u5e76\u82e5\u5e72\u4e09\u5143\u7ec4\u4ee5\u5f62\u6210\u76ee\u6807\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2027","title":"\u53ef\u79fb\u9664\u5b57\u7b26\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2028","title":"\u6700\u4f73\u8fd0\u52a8\u5458\u7684\u6bd4\u62fc\u56de\u5408","__typename":"AppliedTranslationNode"},{"questionId":"2029","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u6700\u5c0f\u4e58\u79ef\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2031","title":"\u9e21\u86cb\u6389\u843d-\u4e24\u679a\u9e21\u86cb","__typename":"AppliedTranslationNode"},{"questionId":"2032","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6700\u5927\u5947\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2033","title":"\u4f60\u5b8c\u6210\u7684\u5b8c\u6574\u5bf9\u5c40\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2034","title":"\u67e5\u8be2\u5dee\u7edd\u5bf9\u503c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2035","title":"\u7edf\u8ba1\u5b50\u5c9b\u5c7f","__typename":"AppliedTranslationNode"},{"questionId":"2037","title":"\u7edf\u8ba1\u5e73\u65b9\u548c\u4e09\u5143\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2038","title":"\u8ff7\u5bab\u4e2d\u79bb\u5165\u53e3\u6700\u8fd1\u7684\u51fa\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"2039","title":"\u6c42\u548c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2040","title":"\u89c4\u5b9a\u65f6\u95f4\u5185\u5230\u8fbe\u7ec8\u70b9\u7684\u6700\u5c0f\u82b1\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"2041","title":"2020\u5e74\u6700\u540e\u4e00\u6b21\u767b\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"2042","title":"\u4e24\u4e2a\u6570\u5bf9\u4e4b\u95f4\u7684\u6700\u5927\u4e58\u79ef\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2043","title":"\u5faa\u73af\u8f6e\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"2044","title":"\u6700\u7f8e\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2045","title":"\u5272\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"2046","title":"\u9875\u9762\u63a8\u8350\u2161","__typename":"AppliedTranslationNode"},{"questionId":"2047","title":"\u627e\u51fa\u9876\u5cf0\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"2048","title":"\u57fa\u4e8e\u6392\u5217\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2049","title":"\u6d88\u706d\u602a\u7269\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2050","title":"\u7edf\u8ba1\u597d\u6570\u5b57\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2051","title":"\u6700\u957f\u516c\u5171\u5b50\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"2053","title":"\u68c0\u67e5\u662f\u5426\u6240\u6709\u5b57\u7b26\u51fa\u73b0\u6b21\u6570\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"2054","title":"\u6700\u5c0f\u672a\u88ab\u5360\u636e\u6905\u5b50\u7684\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2055","title":"\u63cf\u8ff0\u7ed8\u753b\u7ed3\u679c","__typename":"AppliedTranslationNode"},{"questionId":"2057","title":"\u6309\u5206\u7c7b\u7edf\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"2058","title":"\u6570\u7ec4\u4e32\u8054","__typename":"AppliedTranslationNode"},{"questionId":"2059","title":"\u957f\u5ea6\u4e3a 3 \u7684\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2060","title":"\u5408\u5e76\u591a\u68f5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"2061","title":"\u7528\u4e09\u79cd\u4e0d\u540c\u989c\u8272\u4e3a\u7f51\u683c\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"2062","title":"Nim \u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"2064","title":"\u5174\u8da3\u76f8\u540c\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"2066","title":"\u65b0\u589e\u7684\u6700\u5c11\u53f0\u9636\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2067","title":"\u6263\u5206\u540e\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"2068","title":"\u67e5\u8be2\u6700\u5927\u57fa\u56e0\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2069","title":"\u7b2c K \u5c0f\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2070","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u5206\u89e3\u4e3a\u503c\u5747\u7b49\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2071","title":"\u6392\u5e8f\u6570\u7ec4\u4e4b\u95f4\u7684\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2072","title":"\u6240\u6709\u5b50\u6570\u7ec4\u6700\u5c0f\u503c\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2073","title":"\u611f\u67d3 K \u79cd\u75c5\u6bd2\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2076","title":"\u5b57\u7b26\u4e32\u8f6c\u5316\u540e\u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2077","title":"\u5b50\u5b57\u7b26\u4e32\u7a81\u53d8\u540e\u53ef\u80fd\u5f97\u5230\u7684\u6700\u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2078","title":"\u6700\u5927\u517c\u5bb9\u6027\u8bc4\u5206\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2079","title":"\u5220\u9664\u7cfb\u7edf\u4e2d\u7684\u91cd\u590d\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"2080","title":"\u68c0\u67e5\u64cd\u4f5c\u662f\u5426\u5408\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"2081","title":"K \u6b21\u8c03\u6574\u6570\u7ec4\u5927\u5c0f\u6d6a\u8d39\u7684\u6700\u5c0f\u603b\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2083","title":"\u4e09\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2084","title":"\u4f60\u53ef\u4ee5\u5de5\u4f5c\u7684\u6700\u5927\u5468\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2085","title":"\u6784\u9020\u5143\u7d20\u4e0d\u7b49\u4e8e\u4e24\u76f8\u90bb\u5143\u7d20\u5e73\u5747\u503c\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2086","title":"\u7edf\u8ba1\u7279\u6b8a\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2088","title":"\u4f7f\u7528\u7279\u6b8a\u6253\u5b57\u673a\u952e\u5165\u5355\u8bcd\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2089","title":"\u6700\u5927\u65b9\u9635\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2090","title":"\u5230\u8fbe\u76ee\u7684\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2091","title":"\u5212\u5206\u6570\u5b57\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2093","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u4e3a\u6570\u7ec4\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2094","title":"\u79fb\u9664\u77f3\u5b50\u4f7f\u603b\u6570\u6700\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"2095","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2096","title":"\u627e\u51fa\u5230\u6bcf\u4e2a\u4f4d\u7f6e\u4e3a\u6b62\u6700\u957f\u7684\u6709\u6548\u969c\u788d\u8d5b\u8dd1\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"2098","title":"\u67e5\u8be2\u5177\u6709\u6700\u591a\u5171\u540c\u5173\u6ce8\u8005\u7684\u6240\u6709\u4e24\u4e24\u7ed3\u5bf9\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2099","title":"\u4f5c\u4e3a\u5b50\u5b57\u7b26\u4e32\u51fa\u73b0\u5728\u5355\u8bcd\u4e2d\u7684\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2100","title":"\u6570\u7ec4\u5143\u7d20\u7684\u6700\u5c0f\u975e\u96f6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2101","title":"\u4f60\u80fd\u7a7f\u8fc7\u77e9\u9635\u7684\u6700\u540e\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2102","title":"\u627e\u5230\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"2103","title":"\u627e\u5230\u6240\u6709\u7684\u519c\u573a\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2104","title":"\u6811\u4e0a\u7684\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"2105","title":"\u597d\u5b50\u96c6\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2106","title":"\u627e\u51fa\u6570\u7ec4\u7684\u6700\u5927\u516c\u7ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2107","title":"\u627e\u51fa\u4e0d\u540c\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2108","title":"\u6700\u5c0f\u5316\u76ee\u6807\u503c\u4e0e\u6240\u9009\u5143\u7d20\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2109","title":"\u4ece\u5b50\u96c6\u7684\u548c\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2112","title":"\u5b66\u751f\u5206\u6570\u7684\u6700\u5c0f\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2113","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c K \u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2114","title":"\u5b8c\u6210\u4efb\u52a1\u7684\u6700\u5c11\u5de5\u4f5c\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"2115","title":"\u4e0d\u540c\u7684\u597d\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2116","title":"\u5dee\u7684\u7edd\u5bf9\u503c\u4e3a K \u7684\u6570\u5bf9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2117","title":"\u4ece\u53cc\u500d\u6570\u7ec4\u4e2d\u8fd8\u539f\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2118","title":"\u51fa\u79df\u8f66\u7684\u6700\u5927\u76c8\u5229","__typename":"AppliedTranslationNode"},{"questionId":"2119","title":"\u4f7f\u6570\u7ec4\u8fde\u7eed\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2122","title":"\u7edf\u8ba1\u7279\u6b8a\u56db\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2123","title":"\u6e38\u620f\u4e2d\u5f31\u89d2\u8272\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2124","title":"\u8bbf\u95ee\u5b8c\u6240\u6709\u623f\u95f4\u7684\u7b2c\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2125","title":"\u6570\u7ec4\u7684\u6700\u5927\u516c\u56e0\u6570\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"2128","title":"\u53cd\u8f6c\u5355\u8bcd\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2129","title":"\u53ef\u4e92\u6362\u77e9\u5f62\u7684\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2130","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5e8f\u5217\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2131","title":"\u6bcf\u68f5\u5b50\u6811\u5185\u7f3a\u5931\u7684\u6700\u5c0f\u57fa\u56e0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2132","title":"\u5c06\u4e00\u7ef4\u6570\u7ec4\u8f6c\u53d8\u6210\u4e8c\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2133","title":"\u8fde\u63a5\u540e\u7b49\u4e8e\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"2134","title":"\u8003\u8bd5\u7684\u6700\u5927\u56f0\u6270\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"2135","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u591a\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2137","title":"\u6267\u884c\u64cd\u4f5c\u540e\u7684\u53d8\u91cf\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2138","title":"\u6570\u7ec4\u7f8e\u4e3d\u503c\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2139","title":"\u68c0\u6d4b\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"2140","title":"\u91cd\u590d K \u6b21\u7684\u6700\u957f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2144","title":"\u589e\u91cf\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2145","title":"\u7f51\u683c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2146","title":"\u5224\u65ad\u5355\u8bcd\u662f\u5426\u80fd\u653e\u5165\u586b\u5b57\u6e38\u620f\u5185","__typename":"AppliedTranslationNode"},{"questionId":"2147","title":"\u89e3\u51fa\u6570\u5b66\u8868\u8fbe\u5f0f\u7684\u5b66\u751f\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2154","title":"\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2155","title":"\u627e\u51fa\u7f3a\u5931\u7684\u89c2\u6d4b\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"2156","title":"\u77f3\u5b50\u6e38\u620f IX","__typename":"AppliedTranslationNode"},{"questionId":"2157","title":"\u542b\u7279\u5b9a\u5b57\u6bcd\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100002","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100003","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100004","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100005","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100006","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100007","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100008","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100009","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100010","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100011","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100012","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100013","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100014","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100015","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100016","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100017","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100018","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100019","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100020","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100021","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100022","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100023","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100024","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100025","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100026","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100027","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100028","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100029","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100030","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100031","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100032","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100033","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100034","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100035","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100036","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100037","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100038","title":"\u78b0\u649e\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100039","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100040","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100041","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100042","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100043","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100044","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100045","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100046","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100047","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100048","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100049","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100050","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100051","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100052","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100065","title":"\u6700\u5c0f\u4ea4\u6362\u6b21\u6570\u4f7f\u5f97\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100091","title":"\u529b\u6263\u8c61\u68cb\u5b66\u5802","__typename":"AppliedTranslationNode"},{"questionId":"100092","title":"\u5206\u5f0f\u5316\u7b80","__typename":"AppliedTranslationNode"},{"questionId":"100093","title":"\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"100094","title":"\u53d1 LeetCoin","__typename":"AppliedTranslationNode"},{"questionId":"100096","title":"\u673a\u5668\u4eba\u5927\u5192\u9669","__typename":"AppliedTranslationNode"},{"questionId":"100103","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100104","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100105","title":"\u56f4\u6210\u4e00\u5708","__typename":"AppliedTranslationNode"},{"questionId":"100106","title":"\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100107","title":"\u731c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100125","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570 - LC","__typename":"AppliedTranslationNode"},{"questionId":"100129","title":"\u5458\u5de5\u4e92\u8bc4","__typename":"AppliedTranslationNode"},{"questionId":"100130","title":"\u7535\u68af","__typename":"AppliedTranslationNode"},{"questionId":"100136","title":"\u5b57\u7b26\u4e32\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"100139","title":"\u6d4b\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100144","title":"\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100146","title":"\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"100147","title":"\u6d88\u9664\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100148","title":"PK","__typename":"AppliedTranslationNode"},{"questionId":"100149","title":"\u5408\u5e76\u4efb\u52a1\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100151","title":"\u56fd\u5bb6\u7ed3\u76df -- 952 \u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"100152","title":"\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100153","title":"\u5feb\u9012\u5458\u6d3e\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"100154","title":"\u8fde\u8fde\u770b","__typename":"AppliedTranslationNode"},{"questionId":"100157","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"100158","title":"\u5224\u5b9a\u5b57\u7b26\u662f\u5426\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100159","title":"\u5224\u5b9a\u662f\u5426\u4e92\u4e3a\u5b57\u7b26\u91cd\u6392","__typename":"AppliedTranslationNode"},{"questionId":"100160","title":"URL\u5316","__typename":"AppliedTranslationNode"},{"questionId":"100161","title":"\u5b57\u7b26\u4e32\u538b\u7f29","__typename":"AppliedTranslationNode"},{"questionId":"100162","title":"\u5b57\u7b26\u4e32\u8f6e\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"100163","title":"\u79fb\u9664\u91cd\u590d\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100164","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100167","title":"\u94fe\u8868\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"100168","title":"\u73af\u8def\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"100169","title":"\u6808\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100170","title":"\u5316\u6808\u4e3a\u961f","__typename":"AppliedTranslationNode"},{"questionId":"100171","title":"\u8282\u70b9\u95f4\u901a\u8def","__typename":"AppliedTranslationNode"},{"questionId":"100172","title":"\u4e09\u5408\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100173","title":"\u6808\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100174","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100175","title":"\u7279\u5b9a\u6df1\u5ea6\u8282\u70b9\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100176","title":"\u68c0\u67e5\u5e73\u8861\u6027","__typename":"AppliedTranslationNode"},{"questionId":"100177","title":"\u5408\u6cd5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100178","title":"\u540e\u7ee7\u8005","__typename":"AppliedTranslationNode"},{"questionId":"100179","title":"\u9996\u4e2a\u5171\u540c\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100180","title":"\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"100181","title":"\u6574\u6570\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100182","title":"\u914d\u5bf9\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100183","title":"\u4e0b\u4e00\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100184","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100185","title":"\u65cb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100186","title":"\u96f6\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100187","title":"\u5220\u9664\u4e2d\u95f4\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100188","title":"\u94fe\u8868\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100189","title":"\u897f\u6e38\u8bb0","__typename":"AppliedTranslationNode"},{"questionId":"100191","title":"\u4f18\u5316\u53c2\u8d5b\u961f\u4f0d","__typename":"AppliedTranslationNode"},{"questionId":"100193","title":"\u9ed1\u767d\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"100194","title":"2048 \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100195","title":"\u5806\u76d8\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100196","title":"\u7ed8\u5236\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100197","title":"\u4e09\u6b65\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100198","title":"\u5e42\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"100199","title":"\u9012\u5f52\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100200","title":"\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"100201","title":"\u989c\u8272\u586b\u5145","__typename":"AppliedTranslationNode"},{"questionId":"100202","title":"\u5806\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100203","title":"\u4e8c\u8fdb\u5236\u6570\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100206","title":"\u70b9\u4eae\u5723\u8bde\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100207","title":"\u8ff7\u5bab\u91cd\u529b\u7403","__typename":"AppliedTranslationNode"},{"questionId":"100208","title":"\u65e9\u9910\u9ad8\u5cf0","__typename":"AppliedTranslationNode"},{"questionId":"100209","title":"\u6768\u67f3\u7d6e\u6291\u5236\u5242","__typename":"AppliedTranslationNode"},{"questionId":"100210","title":"\u642c\u5bb6\u6253\u5305","__typename":"AppliedTranslationNode"},{"questionId":"100211","title":" \u671f\u4e2d\u8003\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100212","title":"\u5468\u516d\u5bb5\u591c\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100213","title":"\u51fa\u6e38\u603b\u7ed3","__typename":"AppliedTranslationNode"},{"questionId":"100214","title":"\u9910\u5385\u4f18\u60e0\u5238","__typename":"AppliedTranslationNode"},{"questionId":"100215","title":"\u51fa\u5dee\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100216","title":"\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"100217","title":"\u6700\u62e5\u5835\u7684\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"100218","title":"\u5165\u5b66\u8003\u8bd5\u7b97\u6cd5\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100219","title":"\u5783\u573e\u90ae\u4ef6\u8fc7\u6ee4\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"100220","title":"\u672c\u5468\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"100221","title":"\u4e34\u65f6\u70b9\u9910\u5458","__typename":"AppliedTranslationNode"},{"questionId":"100222","title":"\u5c0f\u7ec4\u8ba8\u8bba","__typename":"AppliedTranslationNode"},{"questionId":"100223","title":"\u91c7\u8d2d\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"100226","title":"\u7b97\u6cd5\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"100228","title":"\u52a8\u7269\u6536\u5bb9\u6240","__typename":"AppliedTranslationNode"},{"questionId":"100229","title":"\u68c0\u67e5\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100230","title":"\u7ffb\u8f6c\u6570\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"100231","title":"\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"100232","title":"\u641c\u7d22\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100233","title":"\u516b\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"100234","title":"\u57fa\u7ad9\u5730\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"100235","title":"\u7f16\u7a0b\u8bed\u8a00\u504f\u597d\u8c03\u67e5","__typename":"AppliedTranslationNode"},{"questionId":"100236","title":"\u964d\u566a\u8033\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100237","title":"\u51fa\u5dee\u8def\u7ebf II","__typename":"AppliedTranslationNode"},{"questionId":"100238","title":"\u4e92\u4fe1\u534f\u5546\u673a\u5236 II","__typename":"AppliedTranslationNode"},{"questionId":"100239","title":"TLV \u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"100240","title":"\u9b54\u672f\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"100241","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100242","title":"\u7a00\u758f\u6570\u7ec4\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"100246","title":"\u5458\u5de5\u8fd0\u52a8\u4f1a","__typename":"AppliedTranslationNode"},{"questionId":"100247","title":"\u65f6\u95f4\u7247\u8f6e\u8f6c\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100248","title":"\u6700\u77ed\u5269\u4f59\u65f6\u95f4\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100249","title":"\u6570\u636e\u590d\u539f","__typename":"AppliedTranslationNode"},{"questionId":"100250","title":"\u8eab\u9ad8\u4f18\u52bf","__typename":"AppliedTranslationNode"},{"questionId":"100251","title":"\u5b9a\u4ef7\u7b56\u7565","__typename":"AppliedTranslationNode"},{"questionId":"100252","title":"\u4e1a\u7ee9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"100253","title":"\u8bfb\u4e66\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100254","title":"\u5956\u91d1\u8ba1\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100255","title":"\u529e\u516c\u5ba4\u996e\u6c34\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100256","title":"\u9ad8\u94c1\u9009\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"100257","title":"\u5730\u94c1\u7968","__typename":"AppliedTranslationNode"},{"questionId":"100258","title":"\u4ea4\u6362\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100259","title":"\u5355\u8bcd\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"100260","title":"\u4ea4\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100261","title":"\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100262","title":"\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100263","title":"SyM \u7684 \ud83d\udd11","__typename":"AppliedTranslationNode"},{"questionId":"100264","title":"\u5206\u82f9\u679c","__typename":"AppliedTranslationNode"},{"questionId":"100265","title":"qqqqqqqqqqqqqqqy \u7684\u70ed\u8eab\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100266","title":"\u5c0f\u80d6\u5b50\u7684\u65e5\u5e38","__typename":"AppliedTranslationNode"},{"questionId":"100267","title":"\u7406\u7425\u73c0\u73e0","__typename":"AppliedTranslationNode"},{"questionId":"100269","title":"\u72fc\u4eba\u6740\u6a21\u62df\u5668","__typename":"AppliedTranslationNode"},{"questionId":"100272","title":"\ud83d\udc2d\u5e74\u5feb\u4e50","__typename":"AppliedTranslationNode"},{"questionId":"100273","title":"\u7528\u4e24\u4e2a\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100274","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100275","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100276","title":"\u4e8c\u7ef4\u6570\u7ec4\u4e2d\u7684\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"100277","title":"\u9752\u86d9\u8df3\u53f0\u9636\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100278","title":"\u65cb\u8f6c\u6570\u7ec4\u7684\u6700\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100279","title":"\u77e9\u9635\u4e2d\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100280","title":"\u66ff\u6362\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"100281","title":"\u673a\u5668\u4eba\u7684\u8fd0\u52a8\u8303\u56f4","__typename":"AppliedTranslationNode"},{"questionId":"100282","title":"\u4ece\u5c3e\u5230\u5934\u6253\u5370\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100283","title":"\u91cd\u5efa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100284","title":"\u526a\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100285","title":"\u526a\u7ef3\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"100286","title":"\u5408\u5e76\u4e24\u4e2a\u6392\u5e8f\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100287","title":"\u6811\u7684\u5b50\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"100288","title":"\u4e8c\u53c9\u6811\u7684\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"100289","title":"\u5bf9\u79f0\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100290","title":"\u8868\u793a\u6570\u503c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100291","title":"\u8c03\u6574\u6570\u7ec4\u987a\u5e8f\u4f7f\u5947\u6570\u4f4d\u4e8e\u5076\u6570\u524d\u9762","__typename":"AppliedTranslationNode"},{"questionId":"100292","title":"\u4e8c\u8fdb\u5236\u4e2d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100293","title":"\u987a\u65f6\u9488\u6253\u5370\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100294","title":"\u94fe\u8868\u4e2d\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100295","title":"\u6570\u503c\u7684\u6574\u6570\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"100296","title":"\u6253\u5370\u4ece1\u5230\u6700\u5927\u7684n\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100297","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"100298","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100299","title":"\u5220\u9664\u94fe\u8868\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100300","title":"\u590d\u6742\u94fe\u8868\u7684\u590d\u5236","__typename":"AppliedTranslationNode"},{"questionId":"100301","title":"\u6700\u5c0f\u7684k\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100302","title":"\u5305\u542bmin\u51fd\u6570\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"100303","title":"\u6570\u636e\u6d41\u4e2d\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100304","title":"\u8fde\u7eed\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100305","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e0e\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100306","title":"\u6808\u7684\u538b\u5165\u3001\u5f39\u51fa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100307","title":"\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100308","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100309","title":"1\uff5en \u6574\u6570\u4e2d 1 \u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100310","title":"\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc7\u4e00\u534a\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100311","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100312","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"100313","title":"\u6570\u5b57\u5e8f\u5217\u4e2d\u67d0\u4e00\u4f4d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100314","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 III","__typename":"AppliedTranslationNode"},{"questionId":"100315","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u540e\u5e8f\u904d\u5386\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100316","title":"\u7b2c\u4e00\u4e2a\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"100317","title":"\u4e8c\u53c9\u6811\u4e2d\u548c\u4e3a\u67d0\u4e00\u503c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100318","title":"\u6570\u7ec4\u4e2d\u7684\u9006\u5e8f\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"100319","title":"\u4e8c\u53c9\u6811\u7684\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100320","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100321","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"100322","title":"\u548c\u4e3as\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100323","title":"\u628a\u6570\u7ec4\u6392\u6210\u6700\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100324","title":"\u548c\u4e3as\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100325","title":"\u628a\u6570\u5b57\u7ffb\u8bd1\u6210\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100326","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u516c\u5171\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100327","title":"\u793c\u7269\u7684\u6700\u5927\u4ef7\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100328","title":"\u7ffb\u8f6c\u5355\u8bcd\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100329","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u6570\u5b57 I","__typename":"AppliedTranslationNode"},{"questionId":"100330","title":"\u5de6\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100331","title":"0\uff5en-1\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100332","title":"\u6700\u957f\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100333","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u7b2ck\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100334","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100335","title":"\u4e0d\u7528\u52a0\u51cf\u4e58\u9664\u505a\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100336","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100337","title":"\u961f\u5217\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100338","title":"\u6784\u5efa\u4e58\u79ef\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100339","title":"n\u4e2a\u9ab0\u5b50\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100340","title":"\u628a\u5b57\u7b26\u4e32\u8f6c\u6362\u6210\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100341","title":"\u6251\u514b\u724c\u4e2d\u7684\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100342","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100343","title":"\u5706\u5708\u4e2d\u6700\u540e\u5269\u4e0b\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100344","title":"\u80a1\u7968\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"100345","title":"\u6c421+2+\u2026+n","__typename":"AppliedTranslationNode"},{"questionId":"100346","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100347","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100348","title":"\u6709\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100349","title":"\u6700\u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100350","title":"\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100351","title":"\u751f\u5b58\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100352","title":"\u8df3\u6c34\u677f","__typename":"AppliedTranslationNode"},{"questionId":"100353","title":"\u5e73\u5206\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"100354","title":"\u6700\u4f73\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100355","title":"\u73e0\u7391\u5999\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100356","title":"\u90e8\u5206\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000001","title":"test-1","__typename":"AppliedTranslationNode"},{"questionId":"1000002","title":"\u627e\u51fa\u9690\u85cf\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000003","title":"\u8fde\u7eed\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000004","title":"\u6a21\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000005","title":"\u6c34\u57df\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"1000006","title":"\u4e00\u6b21\u7f16\u8f91","__typename":"AppliedTranslationNode"},{"questionId":"1000007","title":"\u8fd4\u56de\u5012\u6570\u7b2c k \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000008","title":"\u5206\u5272\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000009","title":"\u6c42\u548c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000010","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000011","title":"\u8ff7\u8def\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000012","title":"\u5408\u5e76\u6392\u5e8f\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000013","title":"\u5cf0\u4e0e\u8c37","__typename":"AppliedTranslationNode"},{"questionId":"1000015","title":"\u6c49\u8bfa\u5854\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000016","title":"\u6392\u5e8f\u77e9\u9635\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"1000017","title":"\u9636\u4e58\u5c3e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000018","title":"\u6574\u6570\u7684\u82f1\u8bed\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"1000019","title":"BiNode","__typename":"AppliedTranslationNode"},{"questionId":"1000020","title":"\u6062\u590d\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1000021","title":"\u6700\u5c0fK\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000022","title":"\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000023","title":"\u6309\u6469\u5e08","__typename":"AppliedTranslationNode"},{"questionId":"1000024","title":"\u591a\u6b21\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"1000025","title":"\u4e0d\u7528\u52a0\u53f7\u7684\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000026","title":"LRU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000027","title":"\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000028","title":"\u8fde\u7eed\u4e2d\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000029","title":"\u76f4\u65b9\u56fe\u7684\u6c34\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000030","title":"\u5355\u8bcd\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1000031","title":"\u5e03\u5c14\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"1000032","title":"\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000033","title":" \u5b57\u6bcd\u4e0e\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000034","title":"2\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000035","title":"\u5a74\u513f\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000036","title":"\u9a6c\u620f\u56e2\u4eba\u5854","__typename":"AppliedTranslationNode"},{"questionId":"1000037","title":"\u7b2c k \u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000038","title":"\u4e3b\u8981\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1000039","title":"\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000040","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000041","title":"\u6570\u5b57\u6d41\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1000042","title":"\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000043","title":"\u6700\u77ed\u8d85\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000044","title":"\u6d88\u5931\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000045","title":"\u6700\u5927\u9ed1\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000046","title":"\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000047","title":"T9\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000048","title":"\u4ea4\u6362\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000049","title":"\u5355\u8bcd\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000050","title":"\u5170\u987f\u8682\u8681","__typename":"AppliedTranslationNode"},{"questionId":"1000051","title":"\u7a00\u758f\u76f8\u4f3c\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000055","title":"\u4e24\u6570\u4e4b\u548c II 3","__typename":"AppliedTranslationNode"},{"questionId":"1000056","title":"\u62ff\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1000057","title":"\u5267\u60c5\u89e6\u53d1\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000058","title":"\u9b54\u672f\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000059","title":"\u5207\u5206\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000060","title":"\u5377\u79ef\u795e\u7ecf\u7f51\u7edc","__typename":"AppliedTranslationNode"},{"questionId":"1000061","title":"\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000062","title":"\u4e8c\u53c9\u6811\u4efb\u52a1\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000063","title":"\u4f20\u9012\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000085","title":"\u6e38\u4e50\u56ed\u7684\u6e38\u89c8\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000086","title":"\u671f\u671b\u4e2a\u6570\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1000087","title":"\u5c0f\u5f20\u5237\u9898\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000088","title":"\u6e38\u4e50\u56ed\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000089","title":"\u4e8c\u53c9\u6811\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000090","title":"\u6700\u5c0f\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000091","title":"\u6700\u5c0f\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000092","title":"\u4f1a\u8bae\u9009\u5740","__typename":"AppliedTranslationNode"},{"questionId":"1000093","title":"\u5bfb\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000095","title":"\u6570\u5b66\u5174\u8da3\u601d\u8003\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000096","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000097","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u524d\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000098","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000099","title":"\u3010\u6807\u7a0b\u6709\u95ee\u9898\u3011\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000100","title":"\u6c42\u4e8c\u7ef4\u6570\u7ec4\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000101","title":"\u6dfb\u52a0\u6700\u5c11\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000102","title":"\u524d\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000103","title":"\u5224\u65ad\u4e8c\u53c9\u6811\u662f\u5426\u662f\u4e00\u4e2a\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000104","title":"\u5c06\u5806\u8f6c\u6362\u4e3a\u4e00\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000105","title":"\u67e5\u627e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000106","title":"\u6811\u4e0a\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1000107","title":"\u4e8c\u53c9\u6811\u4e0a\u4e24\u70b9\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000108","title":"\u5224\u65ad\u8fde\u901a\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000109","title":"\u6700\u5c11\u7684\u64cd\u4f5c\u4f7f\u5c0f\u9547\u5b58\u5728\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1000110","title":"\u6709\u5e8f\u6570\u7ec4\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000111","title":"\u4e8c\u53c9\u67e5\u627e\u6811\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"1000112","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u6700\u540e\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000114","title":"\u5b9e\u73b0\u52a8\u6001\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000115","title":"\u4e58\u79ef\u6700\u5927\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000116","title":"\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1000117","title":"\u6811\u4e0a\u6700\u63a5\u8fd1\u7684\u4e24\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000118","title":"\u7ea6\u745f\u592b\u73af\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000119","title":"\u8ba1\u7b97\u8282\u70b9\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000120","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000121","title":"\u6ed1\u52a8\u7a97\u53e3\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000122","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"1000123","title":"\u5408\u5e76 K \u4e2a\u6700\u5c0f\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000124","title":"\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000125","title":"\u7b80\u5355\u8ba1\u7b97\u5668 V","__typename":"AppliedTranslationNode"},{"questionId":"1000126","title":"\u627e\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570II","__typename":"AppliedTranslationNode"},{"questionId":"1000127","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"1000128","title":"hanhan \u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000129","title":"\u5957\u5708\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000130","title":"\u79cb\u53f6\u6536\u85cf\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000131","title":"\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000132","title":"\u5bfc\u822a\u88c5\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000133","title":"\u5feb\u901f\u516c\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1000134","title":"\u8ffd\u9010\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000135","title":"\u79ef\u5206\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000136","title":"\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000137","title":"\u5927\u6570\u6c42\u4f59","__typename":"AppliedTranslationNode"},{"questionId":"1000138","title":"\u53e4\u8463\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000139","title":"\u901f\u7b97\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000140","title":"\u9ed1\u767d\u65b9\u683c\u753b","__typename":"AppliedTranslationNode"},{"questionId":"1000141","title":"\u6392\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000142","title":"\u7334\u5b50\u6253\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000143","title":"\u5bb6\u65cf\u5173\u7cfb","__typename":"AppliedTranslationNode"},{"questionId":"1000144","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000145","title":"OCR\u8bc6\u522b","__typename":"AppliedTranslationNode"},{"questionId":"1000146","title":"\u65e9\u9910\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000147","title":"\u9ed1\u76d2\u5149\u7ebf\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1000148","title":"\u98de\u8239\u68cb\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000149","title":"\u5206\u5272\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1000150","title":"\u53e4\u8001\u7684\u6e38\u620f\u673a","__typename":"AppliedTranslationNode"},{"questionId":"1000151","title":"01 \u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000152","title":"\u6392\u5217\u5c0f\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1000153","title":"\u82f1\u6587\u5355\u8bcd\u62fc\u5199\u7ea0\u9519\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1000154","title":"\u9b54\u6cd5\u6743\u6756\u5f3a\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1000155","title":"\u706b\u8f66\u7f16\u7ec4\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000156","title":"\u6700\u4fbf\u5b9c\u7684\u673a\u7968","__typename":"AppliedTranslationNode"},{"questionId":"1000157","title":"\u5b85\u7537\u7684\u751f\u6d3b","__typename":"AppliedTranslationNode"},{"questionId":"1000158","title":"\u4ea4\u901a\u8f68\u8ff9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000159","title":"\u7834\u8bd1\u5bc6\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000160","title":"DIST","__typename":"AppliedTranslationNode"},{"questionId":"1000161","title":"Hilbert \u66f2\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000162","title":"\u9879\u76ee\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000163","title":"\u7b97\u5f0f\u8f6c\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1000164","title":"\u5730\u7816\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000166","title":"\u7b80\u5355\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000167","title":"\u591a\u6e90 D \u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000168","title":"\u5de5\u4eba\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000169","title":"\u4e00\u5143\u4e00\u6b21\u65b9\u7a0b\u6c42\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000170","title":"\u5783\u573e\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000171","title":"\u91cd\u590d\u5b57\u7b26\u4e32\u91cd\u547d\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000172","title":"\u5192\u6ce1\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000173","title":"\u627e\u51fa\u6700\u957f\u5b57\u7b26\u4e32\u5e76\u8f93\u51fa","__typename":"AppliedTranslationNode"},{"questionId":"1000174","title":"\u8ba1\u7b97\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000175","title":"\u63a5\u9a7e\u6700\u77ed\u8ddd\u79bb\u7b97\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000176","title":"\u51e0\u4f55\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"1000177","title":"\u5207\u5272\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000178","title":"\u5e8f\u5217\u79fb\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1000179","title":"\u8bf7\u5b9e\u73b0\u51fd\u6570 parseQueryString","__typename":"AppliedTranslationNode"},{"questionId":"1000181","title":"\u8bf7\u5b9e\u73b0\u4e0b\u9762\u7684\u94fe\u5f0f\u8c03\u7528\u51fd\u6570\uff0c\u4ee5\u4f7f\u5176\u80fd\u591f\u5b9e\u73b0\u94fe\u5f0f\u8c03\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1000182","title":"7. \u5316\u5b66\u516c\u5f0f\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000183","title":"3. \u53e4\u751f\u7269\u8840\u7f18\u8fdc\u8fd1\u5224\u5b9a","__typename":"AppliedTranslationNode"},{"questionId":"1000184","title":"10. \u6570\u7ec4\u7ec4\u6210\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000185","title":"16. \u6700\u77ed\u79fb\u52a8\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000186","title":"2. \u53d1\u4e0b\u5348\u8336","__typename":"AppliedTranslationNode"},{"questionId":"1000187","title":"4. \u673a\u5668\u4eba\u8df3\u8dc3\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000188","title":"6. \u590f\u5b63\u7279\u60e0","__typename":"AppliedTranslationNode"},{"questionId":"1000189","title":"\u5c0f\u7f8e\u7684\u7528\u6237\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000190","title":"\u5c0f\u7f8e\u7684\u4ed3\u5e93\u6574\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000191","title":"\u5c0f\u7f8e\u7684\u8dd1\u817f\u4ee3\u8d2d","__typename":"AppliedTranslationNode"},{"questionId":"1000192","title":"\u5c0f\u56e2\u7684\u590d\u5236\u7c98\u8d34","__typename":"AppliedTranslationNode"},{"questionId":"1000193","title":"\u5c0f\u7f8e\u7684\u533a\u57df\u4f1a\u8bae","__typename":"AppliedTranslationNode"},{"questionId":"1000194","title":"\u5c0f\u56e2\u7684\u795e\u79d8\u6697\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000195","title":"\u5c0f\u56e2\u7684\u9009\u8c03\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000196","title":"\u5c0f\u56e2\u65e0\u8def\u53ef\u9003","__typename":"AppliedTranslationNode"},{"questionId":"1000197","title":"\u5c0f\u56e2\u7684\u88c5\u9970\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1000198","title":"\u5c0f\u56e2\u7684\u9ed8\u5951\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000199","title":"\u642d\u914d\u51fa\u552e","__typename":"AppliedTranslationNode"},{"questionId":"1000200","title":"\u5c0f\u7f8e\u7684\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1000201","title":"\u504f\u7231\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000202","title":"\u5c0f\u56e2\u7684 AB \u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000203","title":"\u5341\u5b57\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1000204","title":"\u5b8c\u5168\u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000205","title":"\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000206","title":"5-sum","__typename":"AppliedTranslationNode"},{"questionId":"1000207","title":"\u5e8f\u5217\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000208","title":"\u7f16\u8f91\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"1000209","title":"\u6700\u591a\u7684\u786c\u5e01\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000210","title":"\u6700\u5c11\u7684\u786c\u5e01\u79cd\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000211","title":"\u5b50\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000212","title":"\u5b50\u4e32\u5305\u542b\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000213","title":"\u53d6\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000214","title":"\u6811\u7684\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000215","title":"\u91c7\u8d2d\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1000216","title":"\u4e50\u56e2\u7ad9\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1000217","title":"\u7279\u6b8a\u4e8c\u8fdb\u5236\u8868\u793a\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000218","title":"\u53d8\u6362\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000219","title":"\u6279\u91cf\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1000220","title":"\u7535\u52a8\u8f66\u6e38\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1000221","title":"\u84c4\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"1000222","title":"\u6700\u591a\u724c\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000223","title":"\u5b88\u536b\u57ce\u5821","__typename":"AppliedTranslationNode"},{"questionId":"1000224","title":"\u9b54\u5854\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000225","title":"\u4e0b\u8f7d\u63d2\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"1000226","title":"\u5b8c\u6210\u4e00\u534a\u9898\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000227","title":"\u4e3b\u9898\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000228","title":"\u6574\u6570\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000229","title":"\u5141\u8bb8\u91cd\u590d\u9009\u62e9\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000230","title":"\u524d n \u4e2a\u6570\u5b57\u4e8c\u8fdb\u5236\u4e2d 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000231","title":"\u4e8c\u8fdb\u5236\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000232","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000233","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 ","__typename":"AppliedTranslationNode"},{"questionId":"1000234","title":"\u6ca1\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000235","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217 ","__typename":"AppliedTranslationNode"},{"questionId":"1000236","title":"\u5355\u8bcd\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000237","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000238","title":"\u751f\u6210\u5339\u914d\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000239","title":"\u6570\u7ec4\u4e2d\u548c\u4e3a 0 \u7684\u4e09\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000240","title":"\u5206\u5272\u56de\u6587\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000241","title":"\u590d\u539f IP ","__typename":"AppliedTranslationNode"},{"questionId":"1000242","title":"\u548c\u5927\u4e8e\u7b49\u4e8e target \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000243","title":"\u722c\u697c\u68af\u7684\u6700\u5c11\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1000244","title":"\u4e58\u79ef\u5c0f\u4e8e K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000245","title":"\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000246","title":"\u548c\u4e3a k \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000247","title":"0 \u548c 1 \u4e2a\u6570\u76f8\u540c\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000248","title":"\u5de6\u53f3\u4e24\u8fb9\u5b50\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1000249","title":"\u4e8c\u7ef4\u5b50\u77e9\u9635\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000250","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000251","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000252","title":"\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000253","title":"\u542b\u6709\u6240\u6709\u5b57\u7b26\u7684\u6700\u77ed\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000254","title":"\u6709\u6548\u7684\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000255","title":"\u6700\u591a\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u5f97\u5230\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000256","title":"\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000257","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c n \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000258","title":"\u94fe\u8868\u4e2d\u73af\u7684\u5165\u53e3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000259","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u91cd\u5408\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000260","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000261","title":"\u94fe\u8868\u4e2d\u7684\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1000262","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000263","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000264","title":"\u5c55\u5e73\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000265","title":"\u6392\u5e8f\u7684\u5faa\u73af\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000266","title":"\u73af\u5f62\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000267","title":"\u63d2\u5165\u3001\u5220\u9664\u548c\u968f\u673a\u8bbf\u95ee\u90fd\u662f O(1) \u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000268","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1000269","title":"\u7ffb\u8f6c\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1000270","title":"\u6700\u8fd1\u6700\u5c11\u4f7f\u7528\u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000271","title":"\u6700\u957f\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000272","title":"\u6700\u5c11\u56de\u6587\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"1000273","title":"\u6709\u6548\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000274","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000275","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000276","title":"\u5916\u661f\u8bed\u8a00\u662f\u5426\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000277","title":"\u5b57\u7b26\u4e32\u4ea4\u7ec7","__typename":"AppliedTranslationNode"},{"questionId":"1000278","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000279","title":"\u540e\u7f00\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1000280","title":"\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000281","title":"\u5c0f\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"1000282","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000283","title":"\u76f4\u65b9\u56fe\u6700\u5927\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000284","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1000285","title":"\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000286","title":"\u4e09\u89d2\u5f62\u4e2d\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000287","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000288","title":"\u52a0\u51cf\u7684\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000289","title":"\u6700\u5c11\u7684\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000290","title":"\u6392\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000291","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000292","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000293","title":"\u6700\u8fd1\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000294","title":"\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000295","title":"\u5f80\u5b8c\u5168\u4e8c\u53c9\u6811\u6dfb\u52a0\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000296","title":"\u77e9\u9635\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000297","title":"\u4e8c\u53c9\u6811\u6bcf\u5c42\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000298","title":"\u4e8c\u53c9\u6811\u6700\u5e95\u5c42\u6700\u5de6\u8fb9\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000299","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u4fa7\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000300","title":"\u5355\u8bcd\u6f14\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"1000301","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"1000302","title":"\u5f00\u5bc6\u7801\u9501","__typename":"AppliedTranslationNode"},{"questionId":"1000303","title":"\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000304","title":"\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000305","title":"\u8ba1\u7b97\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000306","title":"\u4ece\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u7684\u8def\u5f84\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000307","title":"\u5411\u4e0b\u7684\u8def\u5f84\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000308","title":"\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000309","title":"\u8282\u70b9\u4e4b\u548c\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000310","title":"\u8bfe\u7a0b\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000311","title":"\u5c55\u5e73\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000312","title":"\u5916\u661f\u6587\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000313","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"1000314","title":"\u91cd\u5efa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000315","title":"\u6240\u6709\u5927\u4e8e\u7b49\u4e8e\u8282\u70b9\u7684\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000316","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000317","title":"\u76f8\u4f3c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000318","title":"\u591a\u4f59\u7684\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1000319","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u4e24\u4e2a\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000320","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000321","title":"\u503c\u548c\u4e0b\u6807\u4e4b\u5dee\u90fd\u5728\u7ed9\u5b9a\u7684\u8303\u56f4\u5185","__typename":"AppliedTranslationNode"},{"questionId":"1000322","title":"\u65e5\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000323","title":"\u6570\u636e\u6d41\u7684\u7b2c K \u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000324","title":"\u51fa\u73b0\u9891\u7387\u6700\u9ad8\u7684 k \u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000325","title":"\u5b9e\u73b0\u524d\u7f00\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000326","title":"\u548c\u6700\u5c0f\u7684 k \u4e2a\u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1000327","title":"\u66ff\u6362\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000328","title":"\u795e\u5947\u7684\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000329","title":"\u6700\u77ed\u7684\u5355\u8bcd\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000330","title":"\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000331","title":"\u6700\u5927\u7684\u5f02\u6216","__typename":"AppliedTranslationNode"},{"questionId":"1000332","title":"\u67e5\u627e\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000333","title":"\u5c71\u5cf0\u6570\u7ec4\u7684\u9876\u90e8","__typename":"AppliedTranslationNode"},{"questionId":"1000334","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000335","title":"\u6309\u6743\u91cd\u751f\u6210\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000336","title":"\u6c42\u5e73\u65b9\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000337","title":"\u72d2\u72d2\u5403\u9999\u8549","__typename":"AppliedTranslationNode"},{"questionId":"1000338","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000339","title":"\u6570\u7ec4\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000340","title":"\u6570\u7ec4\u4e2d\u7684\u7b2c k \u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000341","title":"\u94fe\u8868\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000342","title":"\u5408\u5e76\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000343","title":"\u6240\u6709\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000344","title":"\u542b\u6709 k \u4e2a\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000345","title":"\u8def\u5f84\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000346","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000347","title":"\u8f66\u961f\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000348","title":"\u8f66\u8f86\u5b89\u6392","__typename":"AppliedTranslationNode"},{"questionId":"1000349","title":"\u8def\u5f84\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000350","title":"\u8c01\u6321\u4f4f\u4e86\u6211\u7684\u7ea2\u7eff\u706f","__typename":"AppliedTranslationNode"},{"questionId":"1000351","title":"\u65b0\u589e\u7684\u4e13\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000352","title":"\u6700\u5927\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000353","title":"\u5f55\u53d6\u5206\u6570\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000354","title":"\u8c03\u6574\u7535\u5e73","__typename":"AppliedTranslationNode"},{"questionId":"1000355","title":"\u7b7e\u5230\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000356","title":"\u81ea\u884c\u8f66\u62c9\u529b\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"1000358","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000359","title":"\u73af\u5f62\u95ef\u5173\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000360","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000361","title":"\u5165\u573a\u5b89\u68c0","__typename":"AppliedTranslationNode"},{"questionId":"1000362","title":"\u5f00\u5e55\u5f0f\u7130\u706b","__typename":"AppliedTranslationNode"},{"questionId":"1000363","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000364","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000367","title":"\u5341\u5b57\u8def\u53e3\u7684\u4ea4\u901a","__typename":"AppliedTranslationNode"},{"questionId":"1000368","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000369","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000370","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000371","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000373","title":"\u5fd7\u613f\u8005\u8c03\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000374","title":"\u65e0\u9650\u68cb\u5c40","__typename":"AppliedTranslationNode"},{"questionId":"1000375","title":"\u81ea\u884c\u8f66\u70ab\u6280\u8d5b\u573a","__typename":"AppliedTranslationNode"}]}} -{"data":{"translations":[{"questionId":"1","title":"\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2","title":"\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"3","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"4","title":"\u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"5","title":"\u6700\u957f\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"6","title":"Z \u5b57\u5f62\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"7","title":"\u6574\u6570\u53cd\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"8","title":"\u5b57\u7b26\u4e32\u8f6c\u6362\u6574\u6570 (atoi)","__typename":"AppliedTranslationNode"},{"questionId":"9","title":"\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"10","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"11","title":"\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"12","title":"\u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"13","title":"\u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"14","title":"\u6700\u957f\u516c\u5171\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"15","title":"\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"16","title":"\u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"17","title":"\u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"18","title":"\u56db\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"19","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c N \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"20","title":"\u6709\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"21","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"22","title":"\u62ec\u53f7\u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"23","title":"\u5408\u5e76K\u4e2a\u5347\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"24","title":"\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"25","title":"K \u4e2a\u4e00\u7ec4\u7ffb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"26","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"27","title":"\u79fb\u9664\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"28","title":"\u5b9e\u73b0 strStr()","__typename":"AppliedTranslationNode"},{"questionId":"29","title":"\u4e24\u6570\u76f8\u9664","__typename":"AppliedTranslationNode"},{"questionId":"30","title":"\u4e32\u8054\u6240\u6709\u5355\u8bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"31","title":"\u4e0b\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"32","title":"\u6700\u957f\u6709\u6548\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"33","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"34","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"35","title":"\u641c\u7d22\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"36","title":"\u6709\u6548\u7684\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"37","title":"\u89e3\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"38","title":"\u5916\u89c2\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"39","title":"\u7ec4\u5408\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"40","title":"\u7ec4\u5408\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"41","title":"\u7f3a\u5931\u7684\u7b2c\u4e00\u4e2a\u6b63\u6570","__typename":"AppliedTranslationNode"},{"questionId":"42","title":"\u63a5\u96e8\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"43","title":"\u5b57\u7b26\u4e32\u76f8\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"44","title":"\u901a\u914d\u7b26\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"45","title":"\u8df3\u8dc3\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"46","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"47","title":"\u5168\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"48","title":"\u65cb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"49","title":"\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"50","title":"Pow(x, n)","__typename":"AppliedTranslationNode"},{"questionId":"51","title":"N \u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"52","title":"N\u7687\u540e II","__typename":"AppliedTranslationNode"},{"questionId":"53","title":"\u6700\u5927\u5b50\u5e8f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"54","title":"\u87ba\u65cb\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"55","title":"\u8df3\u8dc3\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"56","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"57","title":"\u63d2\u5165\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"58","title":"\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"59","title":"\u87ba\u65cb\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"60","title":"\u6392\u5217\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"61","title":"\u65cb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"62","title":"\u4e0d\u540c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"63","title":"\u4e0d\u540c\u8def\u5f84 II","__typename":"AppliedTranslationNode"},{"questionId":"64","title":"\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"65","title":"\u6709\u6548\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"66","title":"\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"67","title":"\u4e8c\u8fdb\u5236\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"68","title":"\u6587\u672c\u5de6\u53f3\u5bf9\u9f50","__typename":"AppliedTranslationNode"},{"questionId":"69","title":"Sqrt(x)","__typename":"AppliedTranslationNode"},{"questionId":"70","title":"\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"71","title":"\u7b80\u5316\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"72","title":"\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"73","title":"\u77e9\u9635\u7f6e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"74","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"75","title":"\u989c\u8272\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"76","title":"\u6700\u5c0f\u8986\u76d6\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"77","title":"\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"78","title":"\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"79","title":"\u5355\u8bcd\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"80","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"81","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"82","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"83","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"84","title":"\u67f1\u72b6\u56fe\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"85","title":"\u6700\u5927\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"86","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"87","title":"\u6270\u4e71\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"88","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"89","title":"\u683c\u96f7\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"90","title":"\u5b50\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"91","title":"\u89e3\u7801\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"92","title":"\u53cd\u8f6c\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"93","title":"\u590d\u539f IP \u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"94","title":"\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"95","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"96","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"97","title":"\u4ea4\u9519\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"98","title":"\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"99","title":"\u6062\u590d\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100","title":"\u76f8\u540c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"101","title":"\u5bf9\u79f0\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"102","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"103","title":"\u4e8c\u53c9\u6811\u7684\u952f\u9f7f\u5f62\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"104","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"105","title":"\u4ece\u524d\u5e8f\u4e0e\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"106","title":"\u4ece\u4e2d\u5e8f\u4e0e\u540e\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"107","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"108","title":"\u5c06\u6709\u5e8f\u6570\u7ec4\u8f6c\u6362\u4e3a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"109","title":"\u6709\u5e8f\u94fe\u8868\u8f6c\u6362\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"110","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"111","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"112","title":"\u8def\u5f84\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"113","title":"\u8def\u5f84\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"114","title":"\u4e8c\u53c9\u6811\u5c55\u5f00\u4e3a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"115","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"116","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488","__typename":"AppliedTranslationNode"},{"questionId":"117","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488 II","__typename":"AppliedTranslationNode"},{"questionId":"118","title":"\u6768\u8f89\u4e09\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"119","title":"\u6768\u8f89\u4e09\u89d2 II","__typename":"AppliedTranslationNode"},{"questionId":"120","title":"\u4e09\u89d2\u5f62\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"121","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a","__typename":"AppliedTranslationNode"},{"questionId":"122","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"123","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a III","__typename":"AppliedTranslationNode"},{"questionId":"124","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u5927\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"125","title":"\u9a8c\u8bc1\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"126","title":"\u5355\u8bcd\u63a5\u9f99 II","__typename":"AppliedTranslationNode"},{"questionId":"127","title":"\u5355\u8bcd\u63a5\u9f99","__typename":"AppliedTranslationNode"},{"questionId":"128","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"129","title":"\u6c42\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"130","title":"\u88ab\u56f4\u7ed5\u7684\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"131","title":"\u5206\u5272\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"132","title":"\u5206\u5272\u56de\u6587\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"133","title":"\u514b\u9686\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"134","title":"\u52a0\u6cb9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"135","title":"\u5206\u53d1\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"136","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"137","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 II","__typename":"AppliedTranslationNode"},{"questionId":"138","title":"\u590d\u5236\u5e26\u968f\u673a\u6307\u9488\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"139","title":"\u5355\u8bcd\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"140","title":"\u5355\u8bcd\u62c6\u5206 II","__typename":"AppliedTranslationNode"},{"questionId":"141","title":"\u73af\u5f62\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"142","title":"\u73af\u5f62\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"143","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"144","title":"\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"145","title":"\u4e8c\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"146","title":"LRU \u7f13\u5b58\u673a\u5236","__typename":"AppliedTranslationNode"},{"questionId":"147","title":"\u5bf9\u94fe\u8868\u8fdb\u884c\u63d2\u5165\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"148","title":"\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"149","title":"\u76f4\u7ebf\u4e0a\u6700\u591a\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"150","title":"\u9006\u6ce2\u5170\u8868\u8fbe\u5f0f\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"151","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"152","title":"\u4e58\u79ef\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"153","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"154","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"155","title":"\u6700\u5c0f\u6808","__typename":"AppliedTranslationNode"},{"questionId":"156","title":"\u4e0a\u4e0b\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"157","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"158","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26 II","__typename":"AppliedTranslationNode"},{"questionId":"159","title":"\u81f3\u591a\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"160","title":"\u76f8\u4ea4\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"161","title":"\u76f8\u9694\u4e3a 1 \u7684\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"162","title":"\u5bfb\u627e\u5cf0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"163","title":"\u7f3a\u5931\u7684\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"164","title":"\u6700\u5927\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"165","title":"\u6bd4\u8f83\u7248\u672c\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"166","title":"\u5206\u6570\u5230\u5c0f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"167","title":"\u4e24\u6570\u4e4b\u548c II - \u8f93\u5165\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"168","title":"Excel\u8868\u5217\u540d\u79f0","__typename":"AppliedTranslationNode"},{"questionId":"169","title":"\u591a\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"170","title":"\u4e24\u6570\u4e4b\u548c III - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"171","title":"Excel \u8868\u5217\u5e8f\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"172","title":"\u9636\u4e58\u540e\u7684\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"173","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"174","title":"\u5730\u4e0b\u57ce\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"175","title":"\u7ec4\u5408\u4e24\u4e2a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"176","title":"\u7b2c\u4e8c\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"177","title":"\u7b2cN\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"178","title":"\u5206\u6570\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"179","title":"\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"180","title":"\u8fde\u7eed\u51fa\u73b0\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"181","title":"\u8d85\u8fc7\u7ecf\u7406\u6536\u5165\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"182","title":"\u67e5\u627e\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"183","title":"\u4ece\u4e0d\u8ba2\u8d2d\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"184","title":"\u90e8\u95e8\u5de5\u8d44\u6700\u9ad8\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"185","title":"\u90e8\u95e8\u5de5\u8d44\u524d\u4e09\u9ad8\u7684\u6240\u6709\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"186","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd II","__typename":"AppliedTranslationNode"},{"questionId":"187","title":"\u91cd\u590d\u7684DNA\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"188","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a IV","__typename":"AppliedTranslationNode"},{"questionId":"189","title":"\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"190","title":"\u98a0\u5012\u4e8c\u8fdb\u5236\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"191","title":"\u4f4d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"192","title":"\u7edf\u8ba1\u8bcd\u9891","__typename":"AppliedTranslationNode"},{"questionId":"193","title":"\u6709\u6548\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"194","title":"\u8f6c\u7f6e\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"195","title":"\u7b2c\u5341\u884c","__typename":"AppliedTranslationNode"},{"questionId":"196","title":"\u5220\u9664\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"197","title":"\u4e0a\u5347\u7684\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"198","title":"\u6253\u5bb6\u52ab\u820d","__typename":"AppliedTranslationNode"},{"questionId":"199","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"200","title":"\u5c9b\u5c7f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"201","title":"\u6570\u5b57\u8303\u56f4\u6309\u4f4d\u4e0e","__typename":"AppliedTranslationNode"},{"questionId":"202","title":"\u5feb\u4e50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"203","title":"\u79fb\u9664\u94fe\u8868\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"204","title":"\u8ba1\u6570\u8d28\u6570","__typename":"AppliedTranslationNode"},{"questionId":"205","title":"\u540c\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"206","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"207","title":"\u8bfe\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"208","title":"\u5b9e\u73b0 Trie (\u524d\u7f00\u6811)","__typename":"AppliedTranslationNode"},{"questionId":"209","title":"\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"210","title":"\u8bfe\u7a0b\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"211","title":"\u6dfb\u52a0\u4e0e\u641c\u7d22\u5355\u8bcd - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"212","title":"\u5355\u8bcd\u641c\u7d22 II","__typename":"AppliedTranslationNode"},{"questionId":"213","title":"\u6253\u5bb6\u52ab\u820d II","__typename":"AppliedTranslationNode"},{"questionId":"214","title":"\u6700\u77ed\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"215","title":"\u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"216","title":"\u7ec4\u5408\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"217","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"218","title":"\u5929\u9645\u7ebf\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"219","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"220","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"221","title":"\u6700\u5927\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"222","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"223","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"224","title":"\u57fa\u672c\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"225","title":"\u7528\u961f\u5217\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"226","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"227","title":"\u57fa\u672c\u8ba1\u7b97\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"228","title":"\u6c47\u603b\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"229","title":"\u6c42\u4f17\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"230","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"231","title":"2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"232","title":"\u7528\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"233","title":"\u6570\u5b57 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"234","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"235","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"236","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"237","title":"\u5220\u9664\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"238","title":"\u9664\u81ea\u8eab\u4ee5\u5916\u6570\u7ec4\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"239","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"240","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"241","title":"\u4e3a\u8fd0\u7b97\u8868\u8fbe\u5f0f\u8bbe\u8ba1\u4f18\u5148\u7ea7","__typename":"AppliedTranslationNode"},{"questionId":"242","title":"\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"243","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"244","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"245","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb III","__typename":"AppliedTranslationNode"},{"questionId":"246","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"247","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"248","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"249","title":"\u79fb\u4f4d\u5b57\u7b26\u4e32\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"250","title":"\u7edf\u8ba1\u540c\u503c\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"251","title":"\u5c55\u5f00\u4e8c\u7ef4\u5411\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"252","title":"\u4f1a\u8bae\u5ba4","__typename":"AppliedTranslationNode"},{"questionId":"253","title":"\u4f1a\u8bae\u5ba4 II","__typename":"AppliedTranslationNode"},{"questionId":"254","title":"\u56e0\u5b50\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"255","title":"\u9a8c\u8bc1\u524d\u5e8f\u904d\u5386\u5e8f\u5217\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"256","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"257","title":"\u4e8c\u53c9\u6811\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"258","title":"\u5404\u4f4d\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"259","title":"\u8f83\u5c0f\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"260","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 III","__typename":"AppliedTranslationNode"},{"questionId":"261","title":"\u4ee5\u56fe\u5224\u6811","__typename":"AppliedTranslationNode"},{"questionId":"262","title":"\u884c\u7a0b\u548c\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"263","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"264","title":"\u4e11\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"265","title":"\u7c89\u5237\u623f\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"266","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"267","title":"\u56de\u6587\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"268","title":"\u4e22\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"269","title":"\u706b\u661f\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"270","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c","__typename":"AppliedTranslationNode"},{"questionId":"271","title":"\u5b57\u7b26\u4e32\u7684\u7f16\u7801\u4e0e\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"272","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"273","title":"\u6574\u6570\u8f6c\u6362\u82f1\u6587\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"274","title":"H \u6307\u6570","__typename":"AppliedTranslationNode"},{"questionId":"275","title":"H \u6307\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"276","title":"\u6805\u680f\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"277","title":"\u641c\u5bfb\u540d\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"278","title":"\u7b2c\u4e00\u4e2a\u9519\u8bef\u7684\u7248\u672c","__typename":"AppliedTranslationNode"},{"questionId":"279","title":"\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"280","title":"\u6446\u52a8\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"281","title":"\u952f\u9f7f\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"282","title":"\u7ed9\u8868\u8fbe\u5f0f\u6dfb\u52a0\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"283","title":"\u79fb\u52a8\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"284","title":"\u9876\u7aef\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"285","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"286","title":"\u5899\u4e0e\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"287","title":"\u5bfb\u627e\u91cd\u590d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"288","title":"\u5355\u8bcd\u7684\u552f\u4e00\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"289","title":"\u751f\u547d\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"290","title":"\u5355\u8bcd\u89c4\u5f8b","__typename":"AppliedTranslationNode"},{"questionId":"291","title":"\u5355\u8bcd\u89c4\u5f8b II","__typename":"AppliedTranslationNode"},{"questionId":"292","title":"Nim \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"293","title":"\u7ffb\u8f6c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"294","title":"\u7ffb\u8f6c\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"295","title":"\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"296","title":"\u6700\u4f73\u7684\u78b0\u5934\u5730\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"297","title":"\u4e8c\u53c9\u6811\u7684\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"298","title":"\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"299","title":"\u731c\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"300","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"301","title":"\u5220\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"302","title":"\u5305\u542b\u5168\u90e8\u9ed1\u8272\u50cf\u7d20\u7684\u6700\u5c0f\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"303","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"304","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"305","title":"\u5c9b\u5c7f\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"306","title":"\u7d2f\u52a0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"307","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u53ef\u4fee\u6539","__typename":"AppliedTranslationNode"},{"questionId":"308","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"309","title":"\u6700\u4f73\u4e70\u5356\u80a1\u7968\u65f6\u673a\u542b\u51b7\u51bb\u671f","__typename":"AppliedTranslationNode"},{"questionId":"310","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"311","title":"\u7a00\u758f\u77e9\u9635\u7684\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"312","title":"\u6233\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"313","title":"\u8d85\u7ea7\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"314","title":"\u4e8c\u53c9\u6811\u7684\u5782\u76f4\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"315","title":"\u8ba1\u7b97\u53f3\u4fa7\u5c0f\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"316","title":"\u53bb\u9664\u91cd\u590d\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"317","title":"\u79bb\u5efa\u7b51\u7269\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"318","title":"\u6700\u5927\u5355\u8bcd\u957f\u5ea6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"319","title":"\u706f\u6ce1\u5f00\u5173","__typename":"AppliedTranslationNode"},{"questionId":"320","title":"\u5217\u4e3e\u5355\u8bcd\u7684\u5168\u90e8\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"321","title":"\u62fc\u63a5\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"322","title":"\u96f6\u94b1\u5151\u6362","__typename":"AppliedTranslationNode"},{"questionId":"323","title":"\u65e0\u5411\u56fe\u4e2d\u8fde\u901a\u5206\u91cf\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"324","title":"\u6446\u52a8\u6392\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"325","title":"\u548c\u7b49\u4e8e k \u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"326","title":"3\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"327","title":"\u533a\u95f4\u548c\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"328","title":"\u5947\u5076\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"329","title":"\u77e9\u9635\u4e2d\u7684\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"330","title":"\u6309\u8981\u6c42\u8865\u9f50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"331","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"332","title":"\u91cd\u65b0\u5b89\u6392\u884c\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"333","title":"\u6700\u5927 BST \u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"334","title":"\u9012\u589e\u7684\u4e09\u5143\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"335","title":"\u8def\u5f84\u4ea4\u53c9","__typename":"AppliedTranslationNode"},{"questionId":"336","title":"\u56de\u6587\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"337","title":"\u6253\u5bb6\u52ab\u820d III","__typename":"AppliedTranslationNode"},{"questionId":"338","title":"\u6bd4\u7279\u4f4d\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"339","title":"\u5d4c\u5957\u5217\u8868\u6743\u91cd\u548c","__typename":"AppliedTranslationNode"},{"questionId":"340","title":"\u81f3\u591a\u5305\u542b K \u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"341","title":"\u6241\u5e73\u5316\u5d4c\u5957\u5217\u8868\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"342","title":"4\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"343","title":"\u6574\u6570\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"344","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"345","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"346","title":"\u6570\u636e\u6d41\u4e2d\u7684\u79fb\u52a8\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"347","title":"\u524d K \u4e2a\u9ad8\u9891\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"348","title":"\u8bbe\u8ba1\u4e95\u5b57\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"349","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"350","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"351","title":"\u5b89\u5353\u7cfb\u7edf\u624b\u52bf\u89e3\u9501","__typename":"AppliedTranslationNode"},{"questionId":"352","title":"\u5c06\u6570\u636e\u6d41\u53d8\u4e3a\u591a\u4e2a\u4e0d\u76f8\u4ea4\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"353","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"354","title":"\u4fc4\u7f57\u65af\u5957\u5a03\u4fe1\u5c01\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"355","title":"\u8bbe\u8ba1\u63a8\u7279","__typename":"AppliedTranslationNode"},{"questionId":"356","title":"\u76f4\u7ebf\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"357","title":"\u8ba1\u7b97\u5404\u4e2a\u4f4d\u6570\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"358","title":"K \u8ddd\u79bb\u95f4\u9694\u91cd\u6392\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"359","title":"\u65e5\u5fd7\u901f\u7387\u9650\u5236\u5668","__typename":"AppliedTranslationNode"},{"questionId":"360","title":"\u6709\u5e8f\u8f6c\u5316\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"361","title":"\u8f70\u70b8\u654c\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"362","title":"\u6572\u51fb\u8ba1\u6570\u5668","__typename":"AppliedTranslationNode"},{"questionId":"363","title":"\u77e9\u5f62\u533a\u57df\u4e0d\u8d85\u8fc7 K \u7684\u6700\u5927\u6570\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"364","title":"\u52a0\u6743\u5d4c\u5957\u5e8f\u5217\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"365","title":"\u6c34\u58f6\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"366","title":"\u5bfb\u627e\u4e8c\u53c9\u6811\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"367","title":"\u6709\u6548\u7684\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"368","title":"\u6700\u5927\u6574\u9664\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"369","title":"\u7ed9\u5355\u94fe\u8868\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"370","title":"\u533a\u95f4\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"371","title":"\u4e24\u6574\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"372","title":"\u8d85\u7ea7\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"373","title":"\u67e5\u627e\u548c\u6700\u5c0f\u7684K\u5bf9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"374","title":"\u731c\u6570\u5b57\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"375","title":"\u731c\u6570\u5b57\u5927\u5c0f II","__typename":"AppliedTranslationNode"},{"questionId":"376","title":"\u6446\u52a8\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"377","title":"\u7ec4\u5408\u603b\u548c \u2163","__typename":"AppliedTranslationNode"},{"questionId":"378","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"379","title":"\u7535\u8bdd\u76ee\u5f55\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"380","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"381","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20 - \u5141\u8bb8\u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"382","title":"\u94fe\u8868\u968f\u673a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"383","title":"\u8d4e\u91d1\u4fe1","__typename":"AppliedTranslationNode"},{"questionId":"384","title":"\u6253\u4e71\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"385","title":"\u8ff7\u4f60\u8bed\u6cd5\u5206\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"386","title":"\u5b57\u5178\u5e8f\u6392\u6570","__typename":"AppliedTranslationNode"},{"questionId":"387","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c\u4e00\u4e2a\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"388","title":"\u6587\u4ef6\u7684\u6700\u957f\u7edd\u5bf9\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"389","title":"\u627e\u4e0d\u540c","__typename":"AppliedTranslationNode"},{"questionId":"390","title":"\u6d88\u9664\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"391","title":"\u5b8c\u7f8e\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"392","title":"\u5224\u65ad\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"393","title":"UTF-8 \u7f16\u7801\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"394","title":"\u5b57\u7b26\u4e32\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"395","title":"\u81f3\u5c11\u6709 K \u4e2a\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"396","title":"\u65cb\u8f6c\u51fd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"397","title":"\u6574\u6570\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"398","title":"\u968f\u673a\u6570\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"399","title":"\u9664\u6cd5\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"400","title":"\u7b2c N \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"401","title":"\u4e8c\u8fdb\u5236\u624b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"402","title":"\u79fb\u6389 K \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"403","title":"\u9752\u86d9\u8fc7\u6cb3","__typename":"AppliedTranslationNode"},{"questionId":"404","title":"\u5de6\u53f6\u5b50\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"405","title":"\u6570\u5b57\u8f6c\u6362\u4e3a\u5341\u516d\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"406","title":"\u6839\u636e\u8eab\u9ad8\u91cd\u5efa\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"407","title":"\u63a5\u96e8\u6c34 II","__typename":"AppliedTranslationNode"},{"questionId":"408","title":"\u6709\u6548\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"409","title":"\u6700\u957f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"410","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"411","title":"\u6700\u77ed\u72ec\u5360\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"412","title":"Fizz Buzz","__typename":"AppliedTranslationNode"},{"questionId":"413","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"414","title":"\u7b2c\u4e09\u5927\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"415","title":"\u5b57\u7b26\u4e32\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"416","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"417","title":"\u592a\u5e73\u6d0b\u5927\u897f\u6d0b\u6c34\u6d41\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"418","title":"\u5c4f\u5e55\u53ef\u663e\u793a\u53e5\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"419","title":"\u7532\u677f\u4e0a\u7684\u6218\u8230","__typename":"AppliedTranslationNode"},{"questionId":"420","title":"\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668","__typename":"AppliedTranslationNode"},{"questionId":"421","title":"\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"422","title":"\u6709\u6548\u7684\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"423","title":"\u4ece\u82f1\u6587\u4e2d\u91cd\u5efa\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"424","title":"\u66ff\u6362\u540e\u7684\u6700\u957f\u91cd\u590d\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"425","title":"\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"432","title":"\u5168 O(1) \u7684\u6570\u636e\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"433","title":"\u6700\u5c0f\u57fa\u56e0\u53d8\u5316","__typename":"AppliedTranslationNode"},{"questionId":"434","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"435","title":"\u65e0\u91cd\u53e0\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"436","title":"\u5bfb\u627e\u53f3\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"437","title":"\u8def\u5f84\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"438","title":"\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"439","title":"\u4e09\u5143\u8868\u8fbe\u5f0f\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"440","title":"\u5b57\u5178\u5e8f\u7684\u7b2cK\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"441","title":"\u6392\u5217\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"442","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"443","title":"\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"444","title":"\u5e8f\u5217\u91cd\u5efa","__typename":"AppliedTranslationNode"},{"questionId":"445","title":"\u4e24\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"446","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206 II - \u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"447","title":"\u56de\u65cb\u9556\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"448","title":"\u627e\u5230\u6240\u6709\u6570\u7ec4\u4e2d\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"449","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"450","title":"\u5220\u9664\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"451","title":"\u6839\u636e\u5b57\u7b26\u51fa\u73b0\u9891\u7387\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"452","title":"\u7528\u6700\u5c11\u6570\u91cf\u7684\u7bad\u5f15\u7206\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"453","title":"\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"454","title":"\u56db\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"455","title":"\u5206\u53d1\u997c\u5e72","__typename":"AppliedTranslationNode"},{"questionId":"456","title":"132 \u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"457","title":"\u73af\u5f62\u6570\u7ec4\u662f\u5426\u5b58\u5728\u5faa\u73af","__typename":"AppliedTranslationNode"},{"questionId":"458","title":"\u53ef\u601c\u7684\u5c0f\u732a","__typename":"AppliedTranslationNode"},{"questionId":"459","title":"\u91cd\u590d\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"460","title":"LFU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"461","title":"\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"462","title":"\u6700\u5c11\u79fb\u52a8\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49 II","__typename":"AppliedTranslationNode"},{"questionId":"463","title":"\u5c9b\u5c7f\u7684\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"464","title":"\u6211\u80fd\u8d62\u5417","__typename":"AppliedTranslationNode"},{"questionId":"465","title":"\u6700\u4f18\u8d26\u5355\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"466","title":"\u7edf\u8ba1\u91cd\u590d\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"467","title":"\u73af\u7ed5\u5b57\u7b26\u4e32\u4e2d\u552f\u4e00\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"468","title":"\u9a8c\u8bc1IP\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"469","title":"\u51f8\u591a\u8fb9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"471","title":"\u7f16\u7801\u6700\u77ed\u957f\u5ea6\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"472","title":"\u8fde\u63a5\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"473","title":"\u706b\u67f4\u62fc\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"474","title":"\u4e00\u548c\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"475","title":"\u4f9b\u6696\u5668","__typename":"AppliedTranslationNode"},{"questionId":"476","title":"\u6570\u5b57\u7684\u8865\u6570","__typename":"AppliedTranslationNode"},{"questionId":"477","title":"\u6c49\u660e\u8ddd\u79bb\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"479","title":"\u6700\u5927\u56de\u6587\u6570\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"480","title":"\u6ed1\u52a8\u7a97\u53e3\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"481","title":"\u795e\u5947\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"482","title":"\u5bc6\u94a5\u683c\u5f0f\u5316","__typename":"AppliedTranslationNode"},{"questionId":"483","title":"\u6700\u5c0f\u597d\u8fdb\u5236","__typename":"AppliedTranslationNode"},{"questionId":"484","title":"\u5bfb\u627e\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"485","title":"\u6700\u5927\u8fde\u7eed 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"486","title":"\u9884\u6d4b\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"487","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"488","title":"\u7956\u739b\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"489","title":"\u7b2c K \u6761\u6700\u5c0f\u6307\u4ee4","__typename":"AppliedTranslationNode"},{"questionId":"490","title":"\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"491","title":"\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"492","title":"\u6784\u9020\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"493","title":"\u7ffb\u8f6c\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"494","title":"\u76ee\u6807\u548c","__typename":"AppliedTranslationNode"},{"questionId":"495","title":"\u63d0\u83ab\u653b\u51fb","__typename":"AppliedTranslationNode"},{"questionId":"496","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"498","title":"\u5bf9\u89d2\u7ebf\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"499","title":"\u8ff7\u5bab III","__typename":"AppliedTranslationNode"},{"questionId":"500","title":"\u952e\u76d8\u884c","__typename":"AppliedTranslationNode"},{"questionId":"501","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4f17\u6570","__typename":"AppliedTranslationNode"},{"questionId":"502","title":"IPO","__typename":"AppliedTranslationNode"},{"questionId":"503","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"504","title":"\u4e03\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"505","title":"\u8ff7\u5bab II","__typename":"AppliedTranslationNode"},{"questionId":"506","title":"\u76f8\u5bf9\u540d\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"507","title":"\u5b8c\u7f8e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"508","title":"\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b50\u6811\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"509","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7 II","__typename":"AppliedTranslationNode"},{"questionId":"511","title":"\u4ece\u59cb\u70b9\u5230\u7ec8\u70b9\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"513","title":"\u627e\u6811\u5de6\u4e0b\u89d2\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"514","title":"\u81ea\u7531\u4e4b\u8def","__typename":"AppliedTranslationNode"},{"questionId":"515","title":"\u5728\u6bcf\u4e2a\u6811\u884c\u4e2d\u627e\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"516","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"517","title":"\u8d85\u7ea7\u6d17\u8863\u673a","__typename":"AppliedTranslationNode"},{"questionId":"518","title":"\u96f6\u94b1\u5151\u6362 II","__typename":"AppliedTranslationNode"},{"questionId":"520","title":"\u68c0\u6d4b\u5927\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"521","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 \u2160","__typename":"AppliedTranslationNode"},{"questionId":"522","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"523","title":"\u8fde\u7eed\u7684\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"524","title":"\u901a\u8fc7\u5220\u9664\u5b57\u6bcd\u5339\u914d\u5230\u5b57\u5178\u91cc\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"525","title":"\u8fde\u7eed\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"526","title":"\u4f18\u7f8e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"527","title":"\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"528","title":"\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"529","title":"\u626b\u96f7\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"530","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"531","title":"\u5b64\u72ec\u50cf\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"532","title":"\u6570\u7ec4\u4e2d\u7684 k-diff \u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"533","title":"\u5b64\u72ec\u50cf\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"535","title":"TinyURL \u7684\u52a0\u5bc6\u4e0e\u89e3\u5bc6","__typename":"AppliedTranslationNode"},{"questionId":"536","title":"\u4ece\u5b57\u7b26\u4e32\u751f\u6210\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"537","title":"\u590d\u6570\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"538","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"539","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"540","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u5355\u4e00\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"541","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"542","title":"01 \u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"543","title":"\u4e8c\u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"544","title":"\u8f93\u51fa\u6bd4\u8d5b\u5339\u914d\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"545","title":"\u4e8c\u53c9\u6811\u7684\u8fb9\u754c","__typename":"AppliedTranslationNode"},{"questionId":"546","title":"\u79fb\u9664\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"547","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"548","title":"\u5c06\u6570\u7ec4\u5206\u5272\u6210\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"549","title":"\u4e8c\u53c9\u6811\u4e2d\u6700\u957f\u7684\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"550","title":"\u83b7\u53d6\u98df\u7269\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"551","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 I","__typename":"AppliedTranslationNode"},{"questionId":"552","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"553","title":"\u6700\u4f18\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"554","title":"\u7816\u5899","__typename":"AppliedTranslationNode"},{"questionId":"555","title":"\u5206\u5272\u8fde\u63a5\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"556","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"557","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd III","__typename":"AppliedTranslationNode"},{"questionId":"560","title":"\u548c\u4e3a K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"561","title":"\u6570\u7ec4\u62c6\u5206 I","__typename":"AppliedTranslationNode"},{"questionId":"562","title":"\u77e9\u9635\u4e2d\u6700\u957f\u7684\u8fde\u7eed1\u7ebf\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"563","title":"\u4e8c\u53c9\u6811\u7684\u5761\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"564","title":"\u5bfb\u627e\u6700\u8fd1\u7684\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"565","title":"\u6570\u7ec4\u5d4c\u5957","__typename":"AppliedTranslationNode"},{"questionId":"566","title":"\u91cd\u5851\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"567","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"568","title":"\u6700\u5927\u4f11\u5047\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"569","title":"\u5458\u5de5\u85aa\u6c34\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"570","title":"\u81f3\u5c11\u67095\u540d\u76f4\u63a5\u4e0b\u5c5e\u7684\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"571","title":"\u7ed9\u5b9a\u6570\u5b57\u7684\u9891\u7387\u67e5\u8be2\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"572","title":"\u53e6\u4e00\u68f5\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"573","title":"\u677e\u9f20\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"574","title":"\u5f53\u9009\u8005","__typename":"AppliedTranslationNode"},{"questionId":"575","title":"\u5206\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"576","title":"\u51fa\u754c\u7684\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"577","title":"\u5458\u5de5\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"578","title":"\u67e5\u8be2\u56de\u7b54\u7387\u6700\u9ad8\u7684\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"579","title":"\u67e5\u8be2\u5458\u5de5\u7684\u7d2f\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"580","title":"\u7edf\u8ba1\u5404\u4e13\u4e1a\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"581","title":"\u6700\u77ed\u65e0\u5e8f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"582","title":"\u6740\u6389\u8fdb\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"583","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u5220\u9664\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"584","title":"\u5bfb\u627e\u7528\u6237\u63a8\u8350\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"585","title":"2016\u5e74\u7684\u6295\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"586","title":"\u8ba2\u5355\u6700\u591a\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"587","title":"\u5b89\u88c5\u6805\u680f","__typename":"AppliedTranslationNode"},{"questionId":"588","title":"\u8bbe\u8ba1\u5185\u5b58\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"591","title":"\u6807\u7b7e\u9a8c\u8bc1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"592","title":"\u5206\u6570\u52a0\u51cf\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"593","title":"\u6709\u6548\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"594","title":"\u6700\u957f\u548c\u8c10\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"595","title":"\u5927\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"596","title":"\u8d85\u8fc75\u540d\u5b66\u751f\u7684\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"597","title":"\u597d\u53cb\u7533\u8bf7 I\uff1a\u603b\u4f53\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"598","title":"\u8303\u56f4\u6c42\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"599","title":"\u4e24\u4e2a\u5217\u8868\u7684\u6700\u5c0f\u7d22\u5f15\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"600","title":"\u4e0d\u542b\u8fde\u7eed1\u7684\u975e\u8d1f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"601","title":"\u4f53\u80b2\u9986\u7684\u4eba\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"602","title":"\u597d\u53cb\u7533\u8bf7 II \uff1a\u8c01\u6709\u6700\u591a\u7684\u597d\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"603","title":"\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"604","title":"\u8fed\u4ee3\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"605","title":"\u79cd\u82b1\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"606","title":"\u6839\u636e\u4e8c\u53c9\u6811\u521b\u5efa\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"607","title":"\u9500\u552e\u5458","__typename":"AppliedTranslationNode"},{"questionId":"608","title":"\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"609","title":"\u5728\u7cfb\u7edf\u4e2d\u67e5\u627e\u91cd\u590d\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"610","title":"\u5224\u65ad\u4e09\u89d2\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"611","title":"\u6709\u6548\u4e09\u89d2\u5f62\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"612","title":"\u5e73\u9762\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"613","title":"\u76f4\u7ebf\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"614","title":"\u4e8c\u7ea7\u5173\u6ce8\u8005","__typename":"AppliedTranslationNode"},{"questionId":"615","title":"\u5e73\u5747\u5de5\u8d44\uff1a\u90e8\u95e8\u4e0e\u516c\u53f8\u6bd4\u8f83","__typename":"AppliedTranslationNode"},{"questionId":"616","title":"\u7ed9\u5b57\u7b26\u4e32\u6dfb\u52a0\u52a0\u7c97\u6807\u7b7e","__typename":"AppliedTranslationNode"},{"questionId":"617","title":"\u5408\u5e76\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"618","title":"\u5b66\u751f\u5730\u7406\u4fe1\u606f\u62a5\u544a","__typename":"AppliedTranslationNode"},{"questionId":"619","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"620","title":"\u6709\u8da3\u7684\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"621","title":"\u4efb\u52a1\u8c03\u5ea6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"623","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u589e\u52a0\u4e00\u884c","__typename":"AppliedTranslationNode"},{"questionId":"624","title":"\u6570\u7ec4\u5217\u8868\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"625","title":"\u6700\u5c0f\u56e0\u5f0f\u5206\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"626","title":"\u6362\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"627","title":"\u53d8\u66f4\u6027\u522b","__typename":"AppliedTranslationNode"},{"questionId":"628","title":"\u4e09\u4e2a\u6570\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"629","title":"K\u4e2a\u9006\u5e8f\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"630","title":"\u8bfe\u7a0b\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"631","title":"\u8bbe\u8ba1 Excel \u6c42\u548c\u516c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"632","title":"\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"633","title":"\u5e73\u65b9\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"634","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u9519\u4f4d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"635","title":"\u8bbe\u8ba1\u65e5\u5fd7\u5b58\u50a8\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"636","title":"\u51fd\u6570\u7684\u72ec\u5360\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"637","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"638","title":"\u5927\u793c\u5305","__typename":"AppliedTranslationNode"},{"questionId":"639","title":"\u89e3\u7801\u65b9\u6cd5 II","__typename":"AppliedTranslationNode"},{"questionId":"640","title":"\u6c42\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"642","title":"\u8bbe\u8ba1\u641c\u7d22\u81ea\u52a8\u8865\u5168\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"643","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 I","__typename":"AppliedTranslationNode"},{"questionId":"644","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"645","title":"\u9519\u8bef\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"646","title":"\u6700\u957f\u6570\u5bf9\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"647","title":"\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"648","title":"\u5355\u8bcd\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"649","title":"Dota2 \u53c2\u8bae\u9662","__typename":"AppliedTranslationNode"},{"questionId":"650","title":"\u53ea\u6709\u4e24\u4e2a\u952e\u7684\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"651","title":"4\u952e\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"652","title":"\u5bfb\u627e\u91cd\u590d\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"653","title":"\u4e24\u6570\u4e4b\u548c IV - \u8f93\u5165 BST","__typename":"AppliedTranslationNode"},{"questionId":"654","title":"\u6700\u5927\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"655","title":"\u8f93\u51fa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"656","title":"\u91d1\u5e01\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"657","title":"\u673a\u5668\u4eba\u80fd\u5426\u8fd4\u56de\u539f\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"658","title":"\u627e\u5230 K \u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"659","title":"\u5206\u5272\u6570\u7ec4\u4e3a\u8fde\u7eed\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"660","title":"\u79fb\u9664 9","__typename":"AppliedTranslationNode"},{"questionId":"661","title":"\u56fe\u7247\u5e73\u6ed1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"662","title":"\u4e8c\u53c9\u6811\u6700\u5927\u5bbd\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"663","title":"\u5747\u5300\u6811\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"664","title":"\u5947\u602a\u7684\u6253\u5370\u673a","__typename":"AppliedTranslationNode"},{"questionId":"665","title":"\u975e\u9012\u51cf\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"666","title":"\u8def\u5f84\u603b\u548c IV","__typename":"AppliedTranslationNode"},{"questionId":"667","title":"\u4f18\u7f8e\u7684\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"668","title":"\u4e58\u6cd5\u8868\u4e2d\u7b2ck\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"669","title":"\u4fee\u526a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"670","title":"\u6700\u5927\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"671","title":"\u4e8c\u53c9\u6811\u4e2d\u7b2c\u4e8c\u5c0f\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"672","title":"\u706f\u6ce1\u5f00\u5173 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"673","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"674","title":"\u6700\u957f\u8fde\u7eed\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"675","title":"\u4e3a\u9ad8\u5c14\u592b\u6bd4\u8d5b\u780d\u6811","__typename":"AppliedTranslationNode"},{"questionId":"676","title":"\u5b9e\u73b0\u4e00\u4e2a\u9b54\u6cd5\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"677","title":"\u952e\u503c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"678","title":"\u6709\u6548\u7684\u62ec\u53f7\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"679","title":"24 \u70b9\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"680","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"681","title":"\u6700\u8fd1\u65f6\u523b","__typename":"AppliedTranslationNode"},{"questionId":"682","title":"\u68d2\u7403\u6bd4\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"683","title":"K \u4e2a\u5173\u95ed\u7684\u706f\u6ce1","__typename":"AppliedTranslationNode"},{"questionId":"684","title":"\u5197\u4f59\u8fde\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"685","title":"\u5197\u4f59\u8fde\u63a5 II","__typename":"AppliedTranslationNode"},{"questionId":"686","title":"\u91cd\u590d\u53e0\u52a0\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"687","title":"\u6700\u957f\u540c\u503c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"688","title":"\u201c\u9a6c\u201d\u5728\u68cb\u76d8\u4e0a\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"689","title":"\u4e09\u4e2a\u65e0\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"690","title":"\u5458\u5de5\u7684\u91cd\u8981\u6027","__typename":"AppliedTranslationNode"},{"questionId":"691","title":"\u8d34\u7eb8\u62fc\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"692","title":"\u524dK\u4e2a\u9ad8\u9891\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"693","title":"\u4ea4\u66ff\u4f4d\u4e8c\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"694","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"695","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"696","title":"\u8ba1\u6570\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"697","title":"\u6570\u7ec4\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"698","title":"\u5212\u5206\u4e3ak\u4e2a\u76f8\u7b49\u7684\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"699","title":"\u6389\u843d\u7684\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"711","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"712","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5c0fASCII\u5220\u9664\u548c","__typename":"AppliedTranslationNode"},{"questionId":"713","title":"\u4e58\u79ef\u5c0f\u4e8eK\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"714","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u624b\u7eed\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"715","title":"Range \u6a21\u5757","__typename":"AppliedTranslationNode"},{"questionId":"716","title":"\u6700\u5927\u6808","__typename":"AppliedTranslationNode"},{"questionId":"717","title":"1\u6bd4\u7279\u4e0e2\u6bd4\u7279\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"718","title":"\u6700\u957f\u91cd\u590d\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"719","title":"\u627e\u51fa\u7b2c k \u5c0f\u7684\u8ddd\u79bb\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"720","title":"\u8bcd\u5178\u4e2d\u6700\u957f\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"721","title":"\u8d26\u6237\u5408\u5e76","__typename":"AppliedTranslationNode"},{"questionId":"722","title":"\u5220\u9664\u6ce8\u91ca","__typename":"AppliedTranslationNode"},{"questionId":"723","title":"\u7c89\u788e\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"724","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u4e0b\u6807","__typename":"AppliedTranslationNode"},{"questionId":"725","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"726","title":"\u539f\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"727","title":"\u6700\u5c0f\u7a97\u53e3\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"728","title":"\u81ea\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"729","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 I","__typename":"AppliedTranslationNode"},{"questionId":"730","title":"\u7edf\u8ba1\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"731","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"732","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"733","title":"\u56fe\u50cf\u6e32\u67d3","__typename":"AppliedTranslationNode"},{"questionId":"734","title":"\u53e5\u5b50\u76f8\u4f3c\u6027","__typename":"AppliedTranslationNode"},{"questionId":"735","title":"\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"736","title":"Lisp \u8bed\u6cd5\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"737","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 II","__typename":"AppliedTranslationNode"},{"questionId":"738","title":"\u5355\u8c03\u9012\u589e\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"739","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"740","title":"\u5220\u9664\u5e76\u83b7\u5f97\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"741","title":"\u6458\u6a31\u6843","__typename":"AppliedTranslationNode"},{"questionId":"742","title":"\u8f6c\u6362\u6210\u5c0f\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"743","title":"\u4e8c\u53c9\u6811\u6700\u8fd1\u7684\u53f6\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"744","title":"\u7f51\u7edc\u5ef6\u8fdf\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"745","title":"\u5bfb\u627e\u6bd4\u76ee\u6807\u5b57\u6bcd\u5927\u7684\u6700\u5c0f\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"746","title":"\u524d\u7f00\u548c\u540e\u7f00\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"747","title":"\u4f7f\u7528\u6700\u5c0f\u82b1\u8d39\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"748","title":"\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"749","title":"\u6700\u77ed\u8865\u5168\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"750","title":"\u9694\u79bb\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"751","title":"\u89d2\u77e9\u5f62\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"752","title":"IP \u5230 CIDR","__typename":"AppliedTranslationNode"},{"questionId":"753","title":"\u6253\u5f00\u8f6c\u76d8\u9501","__typename":"AppliedTranslationNode"},{"questionId":"754","title":"\u7834\u89e3\u4fdd\u9669\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"755","title":"\u5230\u8fbe\u7ec8\u70b9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"756","title":"\u5012\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"757","title":"\u91d1\u5b57\u5854\u8f6c\u6362\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"758","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u5316\u4e3a\u6392\u5e8f\u7684\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"759","title":"\u8bbe\u7f6e\u4ea4\u96c6\u5927\u5c0f\u81f3\u5c11\u4e3a2","__typename":"AppliedTranslationNode"},{"questionId":"760","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u52a0\u7c97\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"761","title":"\u5458\u5de5\u7a7a\u95f2\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"762","title":"\u627e\u51fa\u53d8\u4f4d\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"763","title":"\u7279\u6b8a\u7684\u4e8c\u8fdb\u5236\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"764","title":"N \u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"765","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"766","title":"\u6241\u5e73\u5316\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"767","title":"\u4e8c\u8fdb\u5236\u8868\u793a\u4e2d\u8d28\u6570\u4e2a\u8ba1\u7b97\u7f6e\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"768","title":"\u5212\u5206\u5b57\u6bcd\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"769","title":"\u6700\u5927\u52a0\u53f7\u6807\u5fd7","__typename":"AppliedTranslationNode"},{"questionId":"770","title":"\u60c5\u4fa3\u7275\u624b","__typename":"AppliedTranslationNode"},{"questionId":"771","title":"\u5c06 N \u53c9\u6811\u7f16\u7801\u4e3a\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"772","title":"\u5efa\u7acb\u56db\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"773","title":"\u56db\u53c9\u6811\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"774","title":"N \u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"775","title":"N \u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"776","title":"N \u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"777","title":"\u6258\u666e\u5229\u8328\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"778","title":"\u91cd\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"779","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757 II","__typename":"AppliedTranslationNode"},{"questionId":"780","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757","__typename":"AppliedTranslationNode"},{"questionId":"781","title":"\u57fa\u672c\u8ba1\u7b97\u5668 IV","__typename":"AppliedTranslationNode"},{"questionId":"782","title":"\u5b9d\u77f3\u4e0e\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"783","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"784","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u63d2\u5165\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"785","title":"\u57fa\u672c\u8ba1\u7b97\u5668 III","__typename":"AppliedTranslationNode"},{"questionId":"786","title":"\u641c\u7d22\u957f\u5ea6\u672a\u77e5\u7684\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"787","title":"\u6ed1\u52a8\u8c1c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"788","title":"\u6700\u5c0f\u5316\u53bb\u52a0\u6cb9\u7ad9\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"789","title":"\u6570\u636e\u6d41\u4e2d\u7684\u7b2c K \u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"790","title":"\u5168\u5c40\u5012\u7f6e\u4e0e\u5c40\u90e8\u5012\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"791","title":"\u62c6\u5206\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"792","title":"\u4e8c\u5206\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"793","title":"\u5728LR\u5b57\u7b26\u4e32\u4e2d\u4ea4\u6362\u76f8\u90bb\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"794","title":"\u6c34\u4f4d\u4e0a\u5347\u7684\u6cf3\u6c60\u4e2d\u6e38\u6cf3","__typename":"AppliedTranslationNode"},{"questionId":"795","title":"\u7b2cK\u4e2a\u8bed\u6cd5\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"796","title":"\u5230\u8fbe\u7ec8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"797","title":"\u68ee\u6797\u4e2d\u7684\u5154\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"798","title":"\u53d8\u4e3a\u68cb\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"799","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8282\u70b9\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"800","title":"\u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"801","title":"\u5224\u65ad\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"802","title":"\u7b2c K \u4e2a\u6700\u5c0f\u7684\u7d20\u6570\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"803","title":"K \u7ad9\u4e2d\u8f6c\u5185\u6700\u4fbf\u5b9c\u7684\u822a\u73ed","__typename":"AppliedTranslationNode"},{"questionId":"804","title":"\u65cb\u8f6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"805","title":"\u9003\u8131\u963b\u788d\u8005","__typename":"AppliedTranslationNode"},{"questionId":"806","title":"\u591a\u7c73\u8bfa\u548c\u6258\u7c73\u8bfa\u5e73\u94fa","__typename":"AppliedTranslationNode"},{"questionId":"807","title":"\u81ea\u5b9a\u4e49\u5b57\u7b26\u4e32\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"808","title":"\u5339\u914d\u5b50\u5e8f\u5217\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"809","title":"\u9636\u4e58\u51fd\u6570\u540e K \u4e2a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"810","title":"\u6709\u6548\u7684\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"811","title":"\u533a\u95f4\u5b50\u6570\u7ec4\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"812","title":"\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"813","title":"\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"814","title":"\u5f97\u5206\u6700\u9ad8\u7684\u6700\u5c0f\u8f6e\u8c03","__typename":"AppliedTranslationNode"},{"questionId":"815","title":"\u9999\u69df\u5854","__typename":"AppliedTranslationNode"},{"questionId":"816","title":"\u8bbe\u8ba1\u54c8\u5e0c\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"817","title":"\u8bbe\u8ba1\u54c8\u5e0c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"818","title":"\u76f8\u4f3c RGB \u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"819","title":"\u4f7f\u5e8f\u5217\u9012\u589e\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"820","title":"\u627e\u5230\u6700\u7ec8\u7684\u5b89\u5168\u72b6\u6001","__typename":"AppliedTranslationNode"},{"questionId":"821","title":"\u6253\u7816\u5757","__typename":"AppliedTranslationNode"},{"questionId":"822","title":"\u552f\u4e00\u6469\u5c14\u65af\u5bc6\u7801\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"823","title":"\u6570\u7ec4\u7684\u5747\u503c\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"824","title":"\u5199\u5b57\u7b26\u4e32\u9700\u8981\u7684\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"825","title":"\u4fdd\u6301\u57ce\u5e02\u5929\u9645\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"826","title":"\u5206\u6c64","__typename":"AppliedTranslationNode"},{"questionId":"827","title":"\u60c5\u611f\u4e30\u5bcc\u7684\u6587\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"828","title":"\u9ed1\u677f\u5f02\u6216\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"829","title":"\u5b50\u57df\u540d\u8bbf\u95ee\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"830","title":"\u6700\u5927\u4e09\u89d2\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"831","title":"\u6700\u5927\u5e73\u5747\u503c\u548c\u7684\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"832","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"833","title":"\u516c\u4ea4\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"834","title":"\u6a21\u7cca\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"835","title":"\u94fe\u8868\u7ec4\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"836","title":"\u8d5b\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"837","title":"\u6700\u5e38\u89c1\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"838","title":"\u8bbe\u8ba1\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"839","title":"\u5355\u8bcd\u7684\u538b\u7f29\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"841","title":"\u5b57\u7b26\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"842","title":"\u7ffb\u8f6c\u5361\u7247\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"843","title":"\u5e26\u56e0\u5b50\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"850","title":"\u5faa\u73af\u6709\u5e8f\u5217\u8868\u7684\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"851","title":"\u5c71\u7f8a\u62c9\u4e01\u6587","__typename":"AppliedTranslationNode"},{"questionId":"852","title":"\u9002\u9f84\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"853","title":"\u5b89\u6392\u5de5\u4f5c\u4ee5\u8fbe\u5230\u6700\u5927\u6536\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"854","title":"\u6700\u5927\u4eba\u5de5\u5c9b","__typename":"AppliedTranslationNode"},{"questionId":"855","title":"\u7edf\u8ba1\u5b50\u4e32\u4e2d\u7684\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"856","title":"\u8fde\u7eed\u6574\u6570\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"857","title":"\u8f83\u5927\u5206\u7ec4\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"858","title":"\u9690\u85cf\u4e2a\u4eba\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"859","title":"\u8bbe\u8ba1\u5faa\u73af\u53cc\u7aef\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"860","title":"\u8bbe\u8ba1\u5faa\u73af\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"861","title":"\u7ffb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"862","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u67e5\u627e\u4e0e\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"863","title":"\u6811\u4e2d\u8ddd\u79bb\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"864","title":"\u56fe\u50cf\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"865","title":"\u626b\u5730\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"866","title":"\u77e9\u5f62\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"867","title":"\u65b021\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"868","title":"\u63a8\u591a\u7c73\u8bfa","__typename":"AppliedTranslationNode"},{"questionId":"869","title":"\u76f8\u4f3c\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"870","title":"\u77e9\u9635\u4e2d\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"871","title":"\u94a5\u5319\u548c\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"872","title":"\u5c06\u6570\u7ec4\u62c6\u5206\u6210\u6590\u6ce2\u90a3\u5951\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"873","title":"\u731c\u731c\u8fd9\u4e2a\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"874","title":"\u6bd4\u8f83\u542b\u9000\u683c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"875","title":"\u6570\u7ec4\u4e2d\u7684\u6700\u957f\u5c71\u8109","__typename":"AppliedTranslationNode"},{"questionId":"876","title":"\u4e00\u624b\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"877","title":"\u8bbf\u95ee\u6240\u6709\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"878","title":"\u5b57\u6bcd\u79fb\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"879","title":"\u5230\u6700\u8fd1\u7684\u4eba\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"880","title":"\u77e9\u5f62\u9762\u79ef II","__typename":"AppliedTranslationNode"},{"questionId":"881","title":"\u55a7\u95f9\u548c\u5bcc\u6709","__typename":"AppliedTranslationNode"},{"questionId":"882","title":"\u5c71\u8109\u6570\u7ec4\u7684\u5cf0\u9876\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"883","title":"\u8f66\u961f","__typename":"AppliedTranslationNode"},{"questionId":"884","title":"\u76f8\u4f3c\u5ea6\u4e3a K \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"885","title":"\u8003\u573a\u5c31\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"886","title":"\u62ec\u53f7\u7684\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"887","title":"\u96c7\u4f63 K \u540d\u5de5\u4eba\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"888","title":"\u955c\u9762\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"889","title":"\u4eb2\u5bc6\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"890","title":"\u67e0\u6aac\u6c34\u627e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"891","title":"\u7ffb\u8f6c\u77e9\u9635\u540e\u7684\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"892","title":"\u548c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"893","title":"\u4e8c\u53c9\u6811\u4e2d\u6240\u6709\u8ddd\u79bb\u4e3a K \u7684\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"894","title":"\u9ed1\u540d\u5355\u4e2d\u7684\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"895","title":"\u83b7\u53d6\u6240\u6709\u94a5\u5319\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"896","title":"\u5177\u6709\u6240\u6709\u6700\u6df1\u8282\u70b9\u7684\u6700\u5c0f\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"897","title":"\u56de\u6587\u7d20\u6570","__typename":"AppliedTranslationNode"},{"questionId":"898","title":"\u8f6c\u7f6e\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"899","title":"\u4e8c\u8fdb\u5236\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"900","title":"\u91cd\u65b0\u6392\u5e8f\u5f97\u5230 2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"901","title":"\u4f18\u52bf\u6d17\u724c","__typename":"AppliedTranslationNode"},{"questionId":"902","title":"\u6700\u4f4e\u52a0\u6cb9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"903","title":"\u7528 Rand7() \u5b9e\u73b0 Rand10()","__typename":"AppliedTranslationNode"},{"questionId":"904","title":"\u53f6\u5b50\u76f8\u4f3c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"905","title":"\u6700\u957f\u7684\u6590\u6ce2\u90a3\u5951\u5b50\u5e8f\u5217\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"906","title":"\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"907","title":"\u7231\u5403\u9999\u8549\u7684\u73c2\u73c2","__typename":"AppliedTranslationNode"},{"questionId":"908","title":"\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"909","title":"\u77f3\u5b50\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"910","title":"\u7b2c N \u4e2a\u795e\u5947\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"911","title":"\u76c8\u5229\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"912","title":"\u6309\u6743\u91cd\u968f\u673a\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"913","title":"\u968f\u673a\u7ffb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"914","title":"\u975e\u91cd\u53e0\u77e9\u5f62\u4e2d\u7684\u968f\u673a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"915","title":"\u5728\u5706\u5185\u968f\u673a\u751f\u6210\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"916","title":"\u7d22\u5f15\u5904\u7684\u89e3\u7801\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"917","title":"\u6551\u751f\u8247","__typename":"AppliedTranslationNode"},{"questionId":"918","title":"\u7ec6\u5206\u56fe\u4e2d\u7684\u53ef\u5230\u8fbe\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"919","title":"\u4e09\u7ef4\u5f62\u4f53\u6295\u5f71\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"920","title":"\u4e24\u53e5\u8bdd\u4e2d\u7684\u4e0d\u5e38\u89c1\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"921","title":"\u87ba\u65cb\u77e9\u9635 III","__typename":"AppliedTranslationNode"},{"questionId":"922","title":"\u53ef\u80fd\u7684\u4e8c\u5206\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"923","title":"\u9e21\u86cb\u6389\u843d","__typename":"AppliedTranslationNode"},{"questionId":"924","title":"\u516c\u5e73\u7684\u7cd6\u679c\u68d2\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"925","title":"\u6839\u636e\u524d\u5e8f\u548c\u540e\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"926","title":"\u67e5\u627e\u548c\u66ff\u6362\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"927","title":"\u5b50\u5e8f\u5217\u5bbd\u5ea6\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"928","title":"\u4e09\u7ef4\u5f62\u4f53\u7684\u8868\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"929","title":"\u7279\u6b8a\u7b49\u4ef7\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"930","title":"\u6240\u6709\u53ef\u80fd\u7684\u6ee1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"931","title":"\u6700\u5927\u9891\u7387\u6808","__typename":"AppliedTranslationNode"},{"questionId":"932","title":"\u5355\u8c03\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"933","title":"\u9012\u589e\u987a\u5e8f\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"934","title":"\u5b50\u6570\u7ec4\u6309\u4f4d\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"935","title":"\u6709\u5e8f\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"936","title":"RLE \u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"937","title":"\u80a1\u7968\u4ef7\u683c\u8de8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"938","title":"\u6700\u5927\u4e3a N \u7684\u6570\u5b57\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"939","title":"DI \u5e8f\u5217\u7684\u6709\u6548\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"940","title":"\u6c34\u679c\u6210\u7bee","__typename":"AppliedTranslationNode"},{"questionId":"941","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"942","title":"\u8d85\u7ea7\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"943","title":"\u5b50\u6570\u7ec4\u7684\u6700\u5c0f\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"944","title":"\u6700\u5c0f\u5dee\u503c I","__typename":"AppliedTranslationNode"},{"questionId":"945","title":"\u86c7\u68af\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"946","title":"\u6700\u5c0f\u5dee\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"947","title":"\u5728\u7ebf\u9009\u4e3e","__typename":"AppliedTranslationNode"},{"questionId":"948","title":"\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"949","title":"\u732b\u548c\u8001\u9f20","__typename":"AppliedTranslationNode"},{"questionId":"950","title":"\u5361\u724c\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"951","title":"\u5206\u5272\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"952","title":"\u5355\u8bcd\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"953","title":"\u4ec5\u4ec5\u53cd\u8f6c\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"954","title":"\u73af\u5f62\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"955","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u63d2\u5165\u5668","__typename":"AppliedTranslationNode"},{"questionId":"956","title":"\u64ad\u653e\u5217\u8868\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"957","title":"\u4f7f\u62ec\u53f7\u6709\u6548\u7684\u6700\u5c11\u6dfb\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"958","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"959","title":"\u4e09\u6570\u4e4b\u548c\u7684\u591a\u79cd\u53ef\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"960","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad","__typename":"AppliedTranslationNode"},{"questionId":"961","title":"\u957f\u6309\u952e\u5165","__typename":"AppliedTranslationNode"},{"questionId":"962","title":"\u5c06\u5b57\u7b26\u4e32\u7ffb\u8f6c\u5230\u5355\u8c03\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"963","title":"\u4e09\u7b49\u5206","__typename":"AppliedTranslationNode"},{"questionId":"964","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad II","__typename":"AppliedTranslationNode"},{"questionId":"965","title":"\u72ec\u7279\u7684\u7535\u5b50\u90ae\u4ef6\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"966","title":"\u548c\u76f8\u540c\u7684\u4e8c\u5143\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"967","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"968","title":"\u6f02\u4eae\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"969","title":"\u6700\u8fd1\u7684\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"971","title":"\u6700\u77ed\u7684\u6865","__typename":"AppliedTranslationNode"},{"questionId":"972","title":"\u9a91\u58eb\u62e8\u53f7\u5668","__typename":"AppliedTranslationNode"},{"questionId":"973","title":"\u6233\u5370\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"974","title":"\u91cd\u65b0\u6392\u5217\u65e5\u5fd7\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"975","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u8303\u56f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"976","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"977","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"978","title":"\u6709\u6548\u7684\u5c71\u8109\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"979","title":"\u589e\u51cf\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"980","title":"\u6700\u77ed\u8d85\u7ea7\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"981","title":"\u5220\u5217\u9020\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"982","title":"\u4f7f\u6570\u7ec4\u552f\u4e00\u7684\u6700\u5c0f\u589e\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"983","title":"\u9a8c\u8bc1\u6808\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"984","title":"\u79fb\u9664\u6700\u591a\u7684\u540c\u884c\u6216\u540c\u5217\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"985","title":"\u4ee4\u724c\u653e\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"986","title":"\u7ed9\u5b9a\u6570\u5b57\u80fd\u7ec4\u6210\u7684\u6700\u5927\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"987","title":"\u6309\u9012\u589e\u987a\u5e8f\u663e\u793a\u5361\u724c","__typename":"AppliedTranslationNode"},{"questionId":"988","title":"\u7ffb\u8f6c\u7b49\u4ef7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"989","title":"\u6309\u516c\u56e0\u6570\u8ba1\u7b97\u6700\u5927\u7ec4\u4ef6\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"990","title":"\u9a8c\u8bc1\u5916\u661f\u8bed\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"991","title":"\u4e8c\u500d\u6570\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"992","title":"\u5220\u5217\u9020\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"993","title":"\u6700\u9ad8\u7684\u5e7f\u544a\u724c","__typename":"AppliedTranslationNode"},{"questionId":"994","title":"N \u5929\u540e\u7684\u7262\u623f","__typename":"AppliedTranslationNode"},{"questionId":"998","title":"\u4e8c\u53c9\u6811\u7684\u5b8c\u5168\u6027\u68c0\u9a8c","__typename":"AppliedTranslationNode"},{"questionId":"999","title":"\u7531\u659c\u6760\u5212\u5206\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1000","title":"\u5220\u5217\u9020\u5e8f III","__typename":"AppliedTranslationNode"},{"questionId":"1001","title":"\u91cd\u590d N \u6b21\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1002","title":"\u6700\u5927\u5bbd\u5ea6\u5761","__typename":"AppliedTranslationNode"},{"questionId":"1003","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62 II","__typename":"AppliedTranslationNode"},{"questionId":"1004","title":"\u8868\u793a\u6570\u5b57\u7684\u6700\u5c11\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1005","title":"\u5355\u503c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1006","title":"\u5143\u97f3\u62fc\u5199\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1007","title":"\u8fde\u7eed\u5dee\u76f8\u540c\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1008","title":"\u76d1\u63a7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1009","title":"\u714e\u997c\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1010","title":"\u5f3a\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1011","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811\u4ee5\u5339\u914d\u5148\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1012","title":"\u76f8\u7b49\u7684\u6709\u7406\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1013","title":"\u6590\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1014","title":"\u6700\u63a5\u8fd1\u539f\u70b9\u7684 K \u4e2a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1016","title":"\u548c\u53ef\u88ab K \u6574\u9664\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1017","title":"\u5947\u5076\u8df3","__typename":"AppliedTranslationNode"},{"questionId":"1018","title":"\u4e09\u89d2\u5f62\u7684\u6700\u5927\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1019","title":"\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1020","title":"\u6700\u957f\u6e4d\u6d41\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1021","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u5206\u914d\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1022","title":"\u4e0d\u540c\u8def\u5f84 III","__typename":"AppliedTranslationNode"},{"questionId":"1023","title":"\u57fa\u4e8e\u65f6\u95f4\u7684\u952e\u503c\u5b58\u50a8","__typename":"AppliedTranslationNode"},{"questionId":"1024","title":"\u6309\u4f4d\u4e0e\u4e3a\u96f6\u7684\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1025","title":"\u6700\u4f4e\u7968\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1026","title":"\u4e0d\u542b AAA \u6216 BBB \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1027","title":"\u67e5\u8be2\u540e\u7684\u5076\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1028","title":"\u533a\u95f4\u5217\u8868\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1029","title":"\u4e8c\u53c9\u6811\u7684\u5782\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1030","title":"\u4ece\u53f6\u7ed3\u70b9\u5f00\u59cb\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1031","title":"\u6570\u7ec4\u5f62\u5f0f\u7684\u6574\u6570\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1032","title":"\u7b49\u5f0f\u65b9\u7a0b\u7684\u53ef\u6ee1\u8db3\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1033","title":"\u574f\u4e86\u7684\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1034","title":"K \u4e2a\u4e0d\u540c\u6574\u6570\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1035","title":"\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1036","title":"\u8150\u70c2\u7684\u6a58\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1037","title":"K \u8fde\u7eed\u4f4d\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1038","title":"\u6b63\u65b9\u5f62\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1039","title":"\u627e\u5230\u5c0f\u9547\u7684\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1040","title":"\u6700\u5927\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"1041","title":"\u53ef\u4ee5\u88ab\u4e00\u6b65\u6355\u83b7\u7684\u68cb\u5b50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1042","title":"\u5408\u5e76\u77f3\u5934\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1043","title":"\u7f51\u683c\u7167\u660e","__typename":"AppliedTranslationNode"},{"questionId":"1044","title":"\u67e5\u627e\u5171\u7528\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1045","title":"\u68c0\u67e5\u66ff\u6362\u540e\u7684\u8bcd\u662f\u5426\u6709\u6548","__typename":"AppliedTranslationNode"},{"questionId":"1046","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1047","title":"K \u6b21\u53d6\u53cd\u540e\u6700\u5927\u5316\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1048","title":"\u7b28\u9636\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"1049","title":"\u884c\u76f8\u7b49\u7684\u6700\u5c11\u591a\u7c73\u8bfa\u65cb\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"1050","title":"\u524d\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1051","title":"\u5f62\u6210\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1052","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1053","title":"\u6700\u5c0f\u5316\u820d\u5165\u8bef\u5dee\u4ee5\u6ee1\u8db3\u76ee\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1054","title":"\u5341\u8fdb\u5236\u6574\u6570\u7684\u53cd\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1055","title":"\u603b\u6301\u7eed\u65f6\u95f4\u53ef\u88ab 60 \u6574\u9664\u7684\u6b4c\u66f2","__typename":"AppliedTranslationNode"},{"questionId":"1056","title":"\u5728 D \u5929\u5185\u9001\u8fbe\u5305\u88f9\u7684\u80fd\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1057","title":"\u81f3\u5c11\u6709 1 \u4f4d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1058","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5217\u6700\u5c0f\u7684\u7b49\u6548\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1059","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7f3a\u5931\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1060","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1061","title":"\u6709\u6548\u5b50\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1062","title":"\u5c06\u6570\u7ec4\u5206\u6210\u548c\u76f8\u7b49\u7684\u4e09\u4e2a\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1063","title":"\u6700\u4f73\u89c2\u5149\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1064","title":"\u53ef\u88ab K \u6574\u9664\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1065","title":"\u5b50\u4e32\u80fd\u8868\u793a\u4ece 1 \u5230 N \u6570\u5b57\u7684\u4e8c\u8fdb\u5236\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1066","title":"\u4e0d\u52a8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1067","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d II","__typename":"AppliedTranslationNode"},{"questionId":"1068","title":"\u8303\u56f4\u5185\u7684\u6570\u5b57\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1069","title":"\u6613\u6df7\u6dc6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1070","title":"\u8d1f\u4e8c\u8fdb\u5236\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1071","title":"\u53ef\u88ab 5 \u6574\u9664\u7684\u4e8c\u8fdb\u5236\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1072","title":"\u94fe\u8868\u4e2d\u7684\u4e0b\u4e00\u4e2a\u66f4\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1073","title":"\u98de\u5730\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1074","title":"\u524d\u4e94\u79d1\u7684\u5747\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1075","title":"\u5b57\u7b26\u4e32\u7684\u7d22\u5f15\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1076","title":"\u82b1\u62ec\u53f7\u5c55\u5f00","__typename":"AppliedTranslationNode"},{"questionId":"1077","title":"\u6613\u6df7\u6dc6\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"1078","title":"\u5220\u9664\u6700\u5916\u5c42\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1079","title":"\u4ece\u6839\u5230\u53f6\u7684\u4e8c\u8fdb\u5236\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1080","title":"\u9a7c\u5cf0\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1081","title":"\u89c6\u9891\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1082","title":"\u6700\u5c0f\u5143\u7d20\u5404\u6570\u4f4d\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1083","title":"\u5c0f\u4e8e K \u7684\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1084","title":"\u957f\u5ea6\u4e3a K \u7684\u65e0\u91cd\u590d\u5b57\u7b26\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1085","title":"\u5f7c\u6b64\u719f\u8bc6\u7684\u6700\u65e9\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1086","title":"\u9664\u6570\u535a\u5f08","__typename":"AppliedTranslationNode"},{"questionId":"1087","title":"\u6700\u957f\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1088","title":"\u4e00\u6708\u6709\u591a\u5c11\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1089","title":"\u5220\u53bb\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3","__typename":"AppliedTranslationNode"},{"questionId":"1090","title":"\u963f\u59c6\u65af\u7279\u6717\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1091","title":"\u5b50\u6811\u7684\u6700\u5927\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1092","title":"\u8282\u70b9\u4e0e\u5176\u7956\u5148\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1093","title":"\u4ece\u5148\u5e8f\u904d\u5386\u8fd8\u539f\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1094","title":"\u8ddd\u79bb\u987a\u5e8f\u6392\u5217\u77e9\u9635\u5355\u5143\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1095","title":"\u4e24\u5730\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1096","title":"\u4e24\u4e2a\u975e\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1097","title":"\u5b57\u7b26\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1098","title":"\u6700\u5927\u552f\u4e00\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1099","title":"\u5f97\u5206\u6700\u9ad8\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1100","title":"\u6700\u4f4e\u6210\u672c\u8054\u901a\u6240\u6709\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1101","title":"\u5e73\u884c\u8bfe\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1102","title":"\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u5728\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1103","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed","__typename":"AppliedTranslationNode"},{"questionId":"1104","title":"\u8fb9\u6846\u7740\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1105","title":"\u4e0d\u76f8\u4ea4\u7684\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1106","title":"\u9003\u79bb\u5927\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1107","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1","__typename":"AppliedTranslationNode"},{"questionId":"1108","title":"\u7528\u6237\u7f51\u7ad9\u8bbf\u95ee\u884c\u4e3a\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1110","title":"\u516c\u8def\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1111","title":"\u591a\u8fb9\u5f62\u4e09\u89d2\u5256\u5206\u7684\u6700\u4f4e\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1112","title":"\u62fc\u5199\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1113","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed II","__typename":"AppliedTranslationNode"},{"questionId":"1114","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1115","title":"\u6709\u6548\u7684\u56de\u65cb\u9556","__typename":"AppliedTranslationNode"},{"questionId":"1116","title":"\u6700\u5927\u5c42\u5185\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1117","title":"\u5730\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1118","title":"\u5c06\u6570\u7ec4\u5206\u6210\u51e0\u4e2a\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1119","title":"\u56f0\u4e8e\u73af\u4e2d\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1120","title":"\u4e0d\u90bb\u63a5\u690d\u82b1","__typename":"AppliedTranslationNode"},{"questionId":"1121","title":"\u5206\u9694\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1122","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1123","title":"\u5355\u884c\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1124","title":"\u5b57\u7b26\u4e32\u8f6c\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1125","title":"\u8bbe\u8ba1\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1126","title":"\u8fde\u63a5\u68d2\u6750\u7684\u6700\u4f4e\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1127","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1128","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"1129","title":"\u6700\u957f\u5b57\u7b26\u4e32\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"1130","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"1131","title":"\u7edf\u8ba1\u53ea\u542b\u5355\u4e00\u5b57\u6bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1132","title":"\u524d\u540e\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1133","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5728\u6700\u540e\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1134","title":"\u4e0e\u76ee\u6807\u989c\u8272\u95f4\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1135","title":"\u4e70\u4e0b\u6240\u6709\u4ea7\u54c1\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1136","title":"\u5408\u4f5c\u8fc7\u81f3\u5c11\u4e09\u6b21\u7684\u6f14\u5458\u548c\u5bfc\u6f14","__typename":"AppliedTranslationNode"},{"questionId":"1137","title":"\u9ad8\u5ea6\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1138","title":"\u7231\u751f\u6c14\u7684\u4e66\u5e97\u8001\u677f","__typename":"AppliedTranslationNode"},{"questionId":"1139","title":"\u4ea4\u6362\u4e00\u6b21\u7684\u5148\u524d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1140","title":"\u8ddd\u79bb\u76f8\u7b49\u7684\u6761\u5f62\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1141","title":"\u6700\u591a\u53ef\u4ee5\u4e70\u5230\u7684\u82f9\u679c\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1142","title":"\u8fdb\u51fb\u7684\u9a91\u58eb","__typename":"AppliedTranslationNode"},{"questionId":"1143","title":"\u627e\u51fa\u6240\u6709\u884c\u4e2d\u6700\u5c0f\u516c\u5171\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1144","title":"\u6c34\u8d44\u6e90\u5206\u914d\u4f18\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1145","title":"\u5143\u7d20\u548c\u4e3a\u76ee\u6807\u503c\u7684\u5b50\u77e9\u9635\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1146","title":"\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1147","title":"\u6309\u5217\u7ffb\u8f6c\u5f97\u5230\u6700\u5927\u503c\u7b49\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1148","title":"\u8d1f\u4e8c\u8fdb\u5236\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1149","title":"\u4e09\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1150","title":"\u67e5\u627e\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1151","title":"\u6b65\u8fdb\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1152","title":"\u77e9\u9635\u4e2d 1 \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1153","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1154","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1155","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1156","title":"Bigram \u5206\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1157","title":"\u6839\u5230\u53f6\u8def\u5f84\u4e0a\u7684\u4e0d\u8db3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1159","title":"\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1160","title":"\u6d3b\u5b57\u5370\u5237","__typename":"AppliedTranslationNode"},{"questionId":"1161","title":"\u9879\u76ee\u5458\u5de5 I","__typename":"AppliedTranslationNode"},{"questionId":"1162","title":"\u9879\u76ee\u5458\u5de5II","__typename":"AppliedTranslationNode"},{"questionId":"1163","title":"\u9879\u76ee\u5458\u5de5 III","__typename":"AppliedTranslationNode"},{"questionId":"1164","title":"\u7b49\u5dee\u6570\u5217\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1165","title":"\u5b89\u6392\u4f1a\u8bae\u65e5\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1166","title":"\u629b\u63b7\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1167","title":"\u5efa\u9020\u8857\u533a\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1168","title":"\u590d\u5199\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1169","title":"\u53d7\u6807\u7b7e\u5f71\u54cd\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1170","title":"\u6700\u77ed\u516c\u5171\u8d85\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1171","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1172","title":"\u9500\u552e\u5206\u6790 I ","__typename":"AppliedTranslationNode"},{"questionId":"1173","title":"\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1174","title":"\u9500\u552e\u5206\u6790III","__typename":"AppliedTranslationNode"},{"questionId":"1175","title":"\u6570\u7ec4\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1176","title":"\u529b\u6263\u6392\u884c\u699c","__typename":"AppliedTranslationNode"},{"questionId":"1177","title":"\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1178","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1179","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1180","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1181","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1182","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 IV","__typename":"AppliedTranslationNode"},{"questionId":"1183","title":"\u5927\u6837\u672c\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1184","title":"\u62fc\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"1185","title":"\u5c71\u8109\u6570\u7ec4\u4e2d\u67e5\u627e\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1186","title":"H2O \u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"1187","title":"\u4ea4\u66ff\u6253\u5370FooBar","__typename":"AppliedTranslationNode"},{"questionId":"1188","title":"\u82b1\u62ec\u53f7\u5c55\u5f00 II","__typename":"AppliedTranslationNode"},{"questionId":"1189","title":"\u52a0\u5bc6\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1190","title":"\u6700\u5c0f\u516c\u5171\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1191","title":"\u8fd1\u4e49\u8bcd\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1192","title":"\u5206\u4eab\u5de7\u514b\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1193","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 V","__typename":"AppliedTranslationNode"},{"questionId":"1194","title":"\u4e8c\u53c9\u6811\u5bfb\u8def","__typename":"AppliedTranslationNode"},{"questionId":"1195","title":"\u5206\u7cd6\u679c II","__typename":"AppliedTranslationNode"},{"questionId":"1196","title":"\u586b\u5145\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1197","title":"\u89e3\u6790\u5e03\u5c14\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1198","title":"\u5c0f\u4f17\u4e66\u7c4d","__typename":"AppliedTranslationNode"},{"questionId":"1199","title":"\u5341\u516d\u8fdb\u5236\u9b54\u672f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1200","title":"\u5220\u9664\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1201","title":"\u5220\u9664\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1202","title":"\u5220\u9664\u56de\u6587\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1203","title":"\u6309\u5e8f\u6253\u5370","__typename":"AppliedTranslationNode"},{"questionId":"1204","title":"\u6bcf\u65e5\u65b0\u7528\u6237\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1205","title":"IP \u5730\u5740\u65e0\u6548\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1206","title":"\u822a\u73ed\u9884\u8ba2\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1207","title":"\u5220\u70b9\u6210\u6797","__typename":"AppliedTranslationNode"},{"questionId":"1208","title":"\u6709\u6548\u62ec\u53f7\u7684\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1209","title":"\u8bbe\u8ba1\u6709\u9650\u963b\u585e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1210","title":"\u5220\u9664\u67d0\u4e9b\u5143\u7d20\u540e\u7684\u6570\u7ec4\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1211","title":"\u5b57\u6bcd\u7ec4\u5408\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1212","title":"\u987a\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1213","title":"\u4e0d\u76f8\u4ea4\u7684\u63e1\u624b","__typename":"AppliedTranslationNode"},{"questionId":"1214","title":"\u6bcf\u4f4d\u5b66\u751f\u7684\u6700\u9ad8\u6210\u7ee9","__typename":"AppliedTranslationNode"},{"questionId":"1215","title":"\u62a5\u544a\u7684\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1216","title":"\u6253\u5370\u96f6\u4e0e\u5947\u5076\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1217","title":"\u6570\u7ec4\u7684\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1218","title":"\u6700\u6df1\u53f6\u8282\u70b9\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1219","title":"\u8868\u73b0\u826f\u597d\u7684\u6700\u957f\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1220","title":"\u6700\u5c0f\u7684\u5fc5\u8981\u56e2\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1221","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc725%\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1222","title":"\u5220\u9664\u88ab\u8986\u76d6\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1223","title":"\u5e26\u9608\u503c\u7684\u56fe\u8fde\u901a\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1224","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"1225","title":"\u67e5\u8be2\u6d3b\u8dc3\u4e1a\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1226","title":"\u7528\u6237\u8d2d\u4e70\u5e73\u53f0","__typename":"AppliedTranslationNode"},{"questionId":"1227","title":"\u7b49\u4ef7\u591a\u7c73\u8bfa\u9aa8\u724c\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1228","title":"\u53f6\u503c\u7684\u6700\u5c0f\u4ee3\u4ef7\u751f\u6210\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1229","title":"\u989c\u8272\u4ea4\u66ff\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1230","title":"\u7edd\u5bf9\u503c\u8868\u8fbe\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1231","title":"\u5c06\u6bcf\u4e2a\u5143\u7d20\u66ff\u6362\u4e3a\u53f3\u4fa7\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1232","title":"\u8f6c\u53d8\u6570\u7ec4\u540e\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1233","title":"\u77e9\u5f62\u5185\u8239\u53ea\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1234","title":"\u6700\u5927\u5f97\u5206\u7684\u8def\u5f84\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1236","title":"\u7b2c N \u4e2a\u6cf0\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1237","title":"\u62a5\u544a\u7684\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"1238","title":"\u5b57\u6bcd\u677f\u4e0a\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1239","title":"\u6700\u5927\u7684\u4ee5 1 \u4e3a\u8fb9\u754c\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1240","title":"\u77f3\u5b50\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"1241","title":"\u89e3\u538b\u7f29\u7f16\u7801\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1242","title":"\u77e9\u9635\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1243","title":"\u7956\u7236\u8282\u70b9\u503c\u4e3a\u5076\u6570\u7684\u8282\u70b9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1244","title":"\u4e0d\u540c\u7684\u5faa\u73af\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1245","title":"\u67e5\u8be2\u8fd130\u5929\u6d3b\u8dc3\u7528\u6237\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1246","title":"\u8fc7\u53bb30\u5929\u7684\u7528\u6237\u6d3b\u52a8 II","__typename":"AppliedTranslationNode"},{"questionId":"1247","title":"\u9012\u51cf\u5143\u7d20\u4f7f\u6570\u7ec4\u5448\u952f\u9f7f\u72b6","__typename":"AppliedTranslationNode"},{"questionId":"1248","title":"\u4e8c\u53c9\u6811\u7740\u8272\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1249","title":"\u5feb\u7167\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1250","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1251","title":"\u6bb5\u5f0f\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1252","title":"\u7834\u574f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1253","title":"\u5c06\u77e9\u9635\u6309\u5bf9\u89d2\u7ebf\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1254","title":"\u5c42\u6570\u6700\u6df1\u53f6\u5b50\u8282\u70b9\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1255","title":"\u7ffb\u8f6c\u5b50\u6570\u7ec4\u5f97\u5230\u6700\u5927\u7684\u6570\u7ec4\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1256","title":"\u6570\u7ec4\u5e8f\u53f7\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1257","title":"\u77e9\u9635\u8f6c\u6362\u540e\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1258","title":"\u6587\u7ae0\u6d4f\u89c8 I","__typename":"AppliedTranslationNode"},{"questionId":"1259","title":"\u6587\u7ae0\u6d4f\u89c8 II","__typename":"AppliedTranslationNode"},{"questionId":"1260","title":"\u4e00\u5e74\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1261","title":"\u5355\u5b57\u7b26\u91cd\u590d\u5b50\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1262","title":"\u5b50\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1263","title":"\u63b7\u9ab0\u5b50\u7684N\u79cd\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1264","title":"\u53ef\u4ee5\u8f93\u5165\u7684\u6700\u5927\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1267","title":"\u4ece\u94fe\u8868\u4e2d\u5220\u53bb\u603b\u548c\u503c\u4e3a\u96f6\u7684\u8fde\u7eed\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1268","title":"\u5e02\u573a\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1269","title":"\u5e02\u573a\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1270","title":"\u9910\u76d8\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1271","title":"\u7f51\u7edc\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1272","title":"\u67e5\u8be2\u65e0\u6548\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1273","title":"\u6bd4\u8f83\u5b57\u7b26\u4e32\u6700\u5c0f\u5b57\u6bcd\u51fa\u73b0\u9891\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"1274","title":"\u65e5\u671f\u4e4b\u95f4\u9694\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1275","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1276","title":"\u6700\u63a5\u8fd1\u7684\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1277","title":"\u5f62\u6210\u4e09\u7684\u6700\u5927\u500d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1278","title":"\u6307\u5b9a\u65e5\u671f\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1279","title":"\u8d28\u6570\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1280","title":"\u5065\u8eab\u8ba1\u5212\u8bc4\u4f30","__typename":"AppliedTranslationNode"},{"questionId":"1281","title":"\u6784\u5efa\u56de\u6587\u4e32\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"1282","title":"\u731c\u5b57\u8c1c","__typename":"AppliedTranslationNode"},{"questionId":"1283","title":"\u8f6c\u53d8\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1284","title":"\u56db\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1285","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u53d8\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"1286","title":"\u5e26\u9650\u5236\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1287","title":"\u516c\u4ea4\u7ad9\u95f4\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1288","title":"\u5220\u9664\u4e00\u6b21\u5f97\u5230\u5b50\u6570\u7ec4\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1289","title":"\u4e00\u5468\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1290","title":"\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1291","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 I","__typename":"AppliedTranslationNode"},{"questionId":"1292","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 II","__typename":"AppliedTranslationNode"},{"questionId":"1293","title":"\u5b58\u5728\u8fde\u7eed\u4e09\u4e2a\u5947\u6570\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1295","title":"\u6536\u96c6\u8db3\u591f\u82f9\u679c\u7684\u6700\u5c0f\u82b1\u56ed\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1296","title":"\u6811\u8282\u70b9\u7684\u7b2c K \u4e2a\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1297","title":"\u201c\u6c14\u7403\u201d \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1298","title":"\u53cd\u8f6c\u6bcf\u5bf9\u62ec\u53f7\u95f4\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1299","title":"K \u6b21\u4e32\u8054\u540e\u6700\u5927\u5b50\u6570\u7ec4\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1300","title":"\u67e5\u627e\u96c6\u7fa4\u5185\u7684\u300c\u5173\u952e\u8fde\u63a5\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1301","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u90e8\u95e8\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1302","title":"\u5220\u9664\u5b57\u7b26\u4f7f\u5b57\u7b26\u4e32\u53d8\u597d","__typename":"AppliedTranslationNode"},{"questionId":"1304","title":"\u6700\u957f\u5feb\u4e50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1305","title":"\u961f\u5217\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1306","title":"\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1307","title":"\u4e11\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1308","title":"\u4ea4\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1309","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1311","title":"\u6700\u5927\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1313","title":"\u7edf\u8ba1\u4e3a\u8681\u7fa4\u6784\u7b51\u623f\u95f4\u7684\u4e0d\u540c\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1316","title":"\u4ea4\u66ff\u6253\u5370\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1317","title":"\u6bcf\u6708\u4ea4\u6613 I","__typename":"AppliedTranslationNode"},{"questionId":"1318","title":"\u9526\u6807\u8d5b\u4f18\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1319","title":"\u72ec\u4e00\u65e0\u4e8c\u7684\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1320","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"1321","title":"\u5c3d\u53ef\u80fd\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1322","title":"\u7a7f\u8fc7\u8ff7\u5bab\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1324","title":"\u7403\u4f1a\u843d\u4f55\u5904","__typename":"AppliedTranslationNode"},{"questionId":"1325","title":"\u6982\u7387\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1326","title":"\u5411\u4e0b\u53d6\u6574\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1327","title":"\u6700\u540e\u4e00\u4e2a\u80fd\u8fdb\u5165\u7535\u68af\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1328","title":"\u6bcf\u6708\u4ea4\u6613II","__typename":"AppliedTranslationNode"},{"questionId":"1329","title":"\u73a9\u7b79\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1330","title":"\u6700\u957f\u5b9a\u5dee\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1331","title":"\u9ec4\u91d1\u77ff\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"1332","title":"\u7edf\u8ba1\u5143\u97f3\u5b57\u6bcd\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1336","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1337","title":"\u8bbe\u8ba1\u8df3\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1338","title":"\u67e5\u8be2\u7ed3\u679c\u7684\u8d28\u91cf\u548c\u5360\u6bd4","__typename":"AppliedTranslationNode"},{"questionId":"1339","title":"\u67e5\u8be2\u7403\u961f\u79ef\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1340","title":"\u54f2\u5b66\u5bb6\u8fdb\u9910","__typename":"AppliedTranslationNode"},{"questionId":"1341","title":"\u5206\u5272\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1342","title":"\u53ef\u4ee5\u653b\u51fb\u56fd\u738b\u7684\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"1343","title":"\u63b7\u9ab0\u5b50\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"1344","title":"\u6700\u5927\u76f8\u7b49\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1345","title":"\u5b57\u7b26\u4e32\u7684\u5de6\u53f3\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1349","title":"\u7f00\u70b9\u6210\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1350","title":"\u5220\u9664\u5b50\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"1351","title":"\u66ff\u6362\u5b50\u4e32\u5f97\u5230\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1352","title":"\u89c4\u5212\u517c\u804c\u5de5\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1357","title":"\u62a5\u544a\u7cfb\u7edf\u72b6\u6001\u7684\u8fde\u7eed\u65e5\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1358","title":"\u627e\u51fa\u7ed9\u5b9a\u65b9\u7a0b\u7684\u6b63\u6574\u6570\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"1359","title":"\u5faa\u73af\u7801\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1360","title":"\u4e32\u8054\u5b57\u7b26\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1361","title":"\u94fa\u74f7\u7816","__typename":"AppliedTranslationNode"},{"questionId":"1362","title":"\u98de\u673a\u5ea7\u4f4d\u5206\u914d\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1364","title":"\u540c\u79ef\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1366","title":"\u7b2c\u4e00\u4e2a\u552f\u4e00\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1367","title":"\u5806\u53e0\u957f\u65b9\u4f53\u7684\u6700\u5927\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1368","title":"\u591a\u7ebf\u7a0b\u7f51\u9875\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1369","title":"\u4ea4\u6362\u5b57\u7b26\u4f7f\u5f97\u5b57\u7b26\u4e32\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"1370","title":"\u7edf\u8ba1\u300c\u4f18\u7f8e\u5b50\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1371","title":"\u79fb\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1372","title":"\u68c0\u67e5\u300c\u597d\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1374","title":"\u81f3\u5c11\u6709\u4e00\u4e2a 1 \u7684\u6700\u5de6\u7aef\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1377","title":"\u6bcf\u4e2a\u5e16\u5b50\u7684\u8bc4\u8bba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1378","title":"\u5947\u6570\u503c\u5355\u5143\u683c\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1379","title":"\u91cd\u6784 2 \u884c\u4e8c\u8fdb\u5236\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1380","title":"\u7edf\u8ba1\u5c01\u95ed\u5c9b\u5c7f\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1381","title":"\u5f97\u5206\u6700\u9ad8\u7684\u5355\u8bcd\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1384","title":"\u627e\u51fa\u9002\u5e94\u5c4f\u5e55\u7684\u6700\u5927\u5b57\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1386","title":"\u4e8c\u7ef4\u7f51\u683c\u8fc1\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1387","title":"\u5728\u53d7\u6c61\u67d3\u7684\u4e8c\u53c9\u6811\u4e2d\u67e5\u627e\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1388","title":"\u53ef\u88ab\u4e09\u6574\u9664\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1389","title":"\u63a8\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1390","title":"\u5e73\u5747\u552e\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1391","title":"\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1395","title":"\u8bbf\u95ee\u6240\u6709\u70b9\u7684\u6700\u5c0f\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1396","title":"\u7edf\u8ba1\u53c2\u4e0e\u901a\u4fe1\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1397","title":"\u641c\u7d22\u63a8\u8350\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1398","title":"\u505c\u5728\u539f\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1399","title":"\u9875\u9762\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1400","title":"\u627e\u51fa\u4e95\u5b57\u68cb\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1401","title":"\u4e0d\u6d6a\u8d39\u539f\u6599\u7684\u6c49\u5821\u5236\u4f5c\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1402","title":"\u7edf\u8ba1\u5168\u4e3a 1 \u7684\u6b63\u65b9\u5f62\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1403","title":"\u5206\u5272\u56de\u6587\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1404","title":"\u9006\u5e8f\u6253\u5370\u4e0d\u53ef\u53d8\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1405","title":"\u5411\u516c\u53f8CEO\u6c47\u62a5\u5de5\u4f5c\u7684\u6240\u6709\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1406","title":"\u6574\u6570\u7684\u5404\u4f4d\u79ef\u548c\u4e4b\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1407","title":"\u7528\u6237\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1408","title":"\u4f7f\u7ed3\u679c\u4e0d\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c0f\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1409","title":"\u8f6c\u5316\u4e3a\u5168\u96f6\u77e9\u9635\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1410","title":"\u7ea2\u7eff\u706f\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1411","title":"\u4e8c\u8fdb\u5236\u94fe\u8868\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1413","title":"\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u6b63\u65b9\u5f62\u7684\u6700\u5927\u8fb9\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1414","title":"\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1415","title":"\u5b66\u751f\u4eec\u53c2\u52a0\u5404\u79d1\u6d4b\u8bd5\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1420","title":"\u627e\u5230\u8fde\u7eed\u533a\u95f4\u7684\u5f00\u59cb\u548c\u7ed3\u675f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1421","title":"\u7edf\u8ba1\u4f4d\u6570\u4e3a\u5076\u6570\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1422","title":"\u5212\u5206\u6570\u7ec4\u4e3a\u8fde\u7eed\u6570\u5b57\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1423","title":"\u5b50\u4e32\u7684\u6700\u5927\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1424","title":"\u4f60\u80fd\u4ece\u76d2\u5b50\u91cc\u83b7\u5f97\u7684\u6700\u5927\u7cd6\u679c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1425","title":"\u4e0d\u540c\u56fd\u5bb6\u7684\u5929\u6c14\u7c7b\u578b","__typename":"AppliedTranslationNode"},{"questionId":"1426","title":"\u548c\u4e3a\u96f6\u7684N\u4e2a\u552f\u4e00\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1427","title":"\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u6240\u6709\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1428","title":"\u8df3\u8dc3\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1429","title":"\u53e3\u7b97\u96be\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1432","title":"\u5224\u65ad\u7ed9\u5b9a\u7684\u5e8f\u5217\u662f\u5426\u662f\u4e8c\u53c9\u6811\u4ece\u6839\u5230\u53f6\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1434","title":"\u89e3\u7801\u5b57\u6bcd\u5230\u6574\u6570\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1435","title":"\u5b50\u6570\u7ec4\u5f02\u6216\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1436","title":"\u83b7\u53d6\u4f60\u597d\u53cb\u5df2\u89c2\u770b\u7684\u89c6\u9891","__typename":"AppliedTranslationNode"},{"questionId":"1437","title":"\u8ba9\u5b57\u7b26\u4e32\u6210\u4e3a\u56de\u6587\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1438","title":"\u6c42\u56e2\u961f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1439","title":"\u4e0d\u540c\u6027\u522b\u6bcf\u65e5\u5206\u6570\u603b\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1440","title":"\u5c06\u6574\u6570\u8f6c\u6362\u4e3a\u4e24\u4e2a\u65e0\u96f6\u6574\u6570\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1441","title":"\u6216\u8fd0\u7b97\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1442","title":"\u8fde\u901a\u7f51\u7edc\u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1443","title":"\u4e8c\u6307\u8f93\u5165\u7684\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1444","title":"\u5c06\u6570\u5b57\u53d8\u6210 0 \u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1445","title":"\u5927\u5c0f\u4e3a K \u4e14\u5e73\u5747\u503c\u5927\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1446","title":"\u65f6\u949f\u6307\u9488\u7684\u5939\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"1447","title":"\u8df3\u8dc3\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1448","title":"6 \u548c 9 \u7ec4\u6210\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1449","title":"\u7ad6\u76f4\u6253\u5370\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1450","title":"\u5220\u9664\u7ed9\u5b9a\u503c\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1451","title":"\u704c\u6e89\u82b1\u56ed\u7684\u6700\u5c11\u6c34\u9f99\u5934\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1452","title":"\u9910\u9986\u8425\u4e1a\u989d\u53d8\u5316\u589e\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1453","title":"\u5e7f\u544a\u6548\u679c","__typename":"AppliedTranslationNode"},{"questionId":"1454","title":"\u5220\u9664\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1455","title":"\u9910\u5385\u8fc7\u6ee4\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1456","title":"\u9608\u503c\u8ddd\u79bb\u5185\u90bb\u5c45\u6700\u5c11\u7684\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1457","title":"\u5de5\u4f5c\u8ba1\u5212\u7684\u6700\u4f4e\u96be\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1458","title":"\u6839\u636e\u6570\u5b57\u4e8c\u8fdb\u5236\u4e0b 1 \u7684\u6570\u76ee\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1459","title":"\u6bcf\u9694 n \u4e2a\u987e\u5ba2\u6253\u6298","__typename":"AppliedTranslationNode"},{"questionId":"1460","title":"\u5305\u542b\u6240\u6709\u4e09\u79cd\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1461","title":"\u6709\u6548\u7684\u5feb\u9012\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1462","title":"\u5217\u51fa\u6307\u5b9a\u65f6\u95f4\u6bb5\u5185\u6240\u6709\u7684\u4e0b\u5355\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1463","title":"\u77e9\u9635\u4e2d\u6218\u6597\u529b\u6700\u5f31\u7684 K \u884c","__typename":"AppliedTranslationNode"},{"questionId":"1464","title":"\u6570\u7ec4\u5927\u5c0f\u51cf\u534a","__typename":"AppliedTranslationNode"},{"questionId":"1465","title":"\u5206\u88c2\u4e8c\u53c9\u6811\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1466","title":"\u8df3\u8dc3\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1467","title":"\u6bcf\u6b21\u8bbf\u95ee\u7684\u4ea4\u6613\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1468","title":"\u68c0\u67e5\u6574\u6570\u53ca\u5176\u4e24\u500d\u6570\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1469","title":"\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1470","title":"\u63a8\u6587\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1471","title":"\u53c2\u52a0\u8003\u8bd5\u7684\u6700\u5927\u5b66\u751f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1472","title":"\u4e0a\u5347\u4e0b\u964d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1473","title":"\u6bcf\u4e2a\u5143\u97f3\u5305\u542b\u5076\u6570\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1474","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u957f\u4ea4\u9519\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1475","title":"\u4e8c\u53c9\u641c\u7d22\u5b50\u6811\u7684\u6700\u5927\u952e\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1476","title":"\u7edf\u8ba1\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u8d1f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1477","title":"\u6700\u540e K \u4e2a\u6570\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1478","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1479","title":"\u591a\u6b21\u6c42\u548c\u6784\u9020\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1480","title":"\u7535\u5f71\u8bc4\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1481","title":"\u9662\u7cfb\u65e0\u6548\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1482","title":"\u6709\u591a\u5c11\u5c0f\u4e8e\u5f53\u524d\u6570\u5b57\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1483","title":"\u901a\u8fc7\u6295\u7968\u5bf9\u56e2\u961f\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1484","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1485","title":"\u4f7f\u7f51\u683c\u56fe\u81f3\u5c11\u6709\u4e00\u6761\u6709\u6548\u8def\u5f84\u7684\u6700\u5c0f\u4ee3\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1486","title":"\u4e24\u4e2a\u6570\u7ec4\u95f4\u7684\u8ddd\u79bb\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1487","title":"\u5b89\u6392\u7535\u5f71\u9662\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1488","title":"\u5c06\u6574\u6570\u6309\u6743\u91cd\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1489","title":"3n \u5757\u62ab\u8428","__typename":"AppliedTranslationNode"},{"questionId":"1490","title":"\u751f\u6210\u6bcf\u79cd\u5b57\u7b26\u90fd\u662f\u5947\u6570\u4e2a\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1491","title":"\u706f\u6ce1\u5f00\u5173 III","__typename":"AppliedTranslationNode"},{"questionId":"1492","title":"\u901a\u77e5\u6240\u6709\u5458\u5de5\u6240\u9700\u7684\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1493","title":"T \u79d2\u540e\u9752\u86d9\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1494","title":"\u6d3b\u52a8\u53c2\u4e0e\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1495","title":"\u987e\u5ba2\u7684\u53ef\u4fe1\u8054\u7cfb\u4eba\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1496","title":"\u77e9\u9635\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1497","title":"\u8bbe\u8ba1\u4e00\u4e2a\u652f\u6301\u589e\u91cf\u64cd\u4f5c\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1498","title":"\u627e\u51fa\u514b\u9686\u4e8c\u53c9\u6811\u4e2d\u7684\u76f8\u540c\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1499","title":"\u6700\u5927\u7684\u56e2\u961f\u8868\u73b0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1500","title":"\u7edf\u8ba1\u6700\u5927\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1501","title":"\u5706\u548c\u77e9\u5f62\u662f\u5426\u6709\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"1502","title":"\u6784\u9020 K \u4e2a\u56de\u6587\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1503","title":"\u505a\u83dc\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1504","title":"\u83b7\u53d6\u6700\u8fd1\u7b2c\u4e8c\u6b21\u7684\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1505","title":"\u6309\u65e2\u5b9a\u987a\u5e8f\u521b\u5efa\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1507","title":"\u68c0\u67e5\u7f51\u683c\u4e2d\u662f\u5426\u5b58\u5728\u6709\u6548\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1508","title":"\u6700\u957f\u5feb\u4e50\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1509","title":"\u4f7f\u7528\u552f\u4e00\u6807\u8bc6\u7801\u66ff\u6362\u5458\u5de5ID","__typename":"AppliedTranslationNode"},{"questionId":"1510","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1511","title":"\u7edf\u8ba1\u4f5c\u6218\u5355\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1512","title":"\u8bbe\u8ba1\u5730\u94c1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1513","title":"\u627e\u5230\u6240\u6709\u597d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1514","title":"\u9010\u6b65\u6c42\u548c\u5f97\u5230\u6b63\u6570\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1515","title":"\u548c\u4e3a K \u7684\u6700\u5c11\u6590\u6ce2\u90a3\u5951\u6570\u5b57\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1516","title":"\u957f\u5ea6\u4e3a n \u7684\u5f00\u5fc3\u5b57\u7b26\u4e32\u4e2d\u5b57\u5178\u5e8f\u7b2c k \u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1517","title":"\u6062\u590d\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1518","title":"\u6309\u5e74\u5ea6\u5217\u51fa\u9500\u552e\u603b\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1519","title":"\u975e\u9012\u589e\u987a\u5e8f\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1520","title":"\u5c06\u4e8c\u8fdb\u5236\u8868\u793a\u51cf\u5230 1 \u7684\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1522","title":"\u77f3\u5b50\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1523","title":"\u80a1\u7968\u7684\u8d44\u672c\u635f\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"1524","title":"\u6570\u7ec4\u4e2d\u7684\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1525","title":"\u67e5\u8be2\u5e26\u952e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1526","title":"HTML \u5b9e\u4f53\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1527","title":"\u7ed9 N x 3 \u7f51\u683c\u56fe\u6d82\u8272\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1528","title":"\u62e5\u6709\u6700\u591a\u7cd6\u679c\u7684\u5b69\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1529","title":"\u6539\u53d8\u4e00\u4e2a\u6574\u6570\u80fd\u5f97\u5230\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1530","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u6253\u7834\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1531","title":"\u6bcf\u4e2a\u4eba\u6234\u4e0d\u540c\u5e3d\u5b50\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1532","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1533","title":"\u70b9\u83dc\u5c55\u793a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1534","title":"\u6570\u9752\u86d9","__typename":"AppliedTranslationNode"},{"questionId":"1535","title":"\u751f\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1536","title":"\u8d2d\u4e70\u4e86\u4ea7\u54c1 A \u548c\u4ea7\u54c1 B \u5374\u6ca1\u6709\u8d2d\u4e70\u4ea7\u54c1 C \u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1537","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1538","title":"\u53ef\u83b7\u5f97\u7684\u6700\u5927\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1539","title":"\u5bf9\u89d2\u7ebf\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"1541","title":"\u6392\u540d\u9760\u524d\u7684\u65c5\u884c\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1542","title":"\u8fde\u7eed\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1543","title":"\u6700\u7b80\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1544","title":"\u7edf\u8ba1\u4e8c\u53c9\u6811\u4e2d\u597d\u8282\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1545","title":"\u6570\u4f4d\u6210\u672c\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1546","title":"\u67e5\u627e\u6210\u7ee9\u5904\u4e8e\u4e2d\u6e38\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1547","title":"\u65c5\u884c\u7ec8\u70b9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"1548","title":"\u662f\u5426\u6240\u6709 1 \u90fd\u81f3\u5c11\u76f8\u9694 k \u4e2a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1549","title":"\u7edd\u5bf9\u5dee\u4e0d\u8d85\u8fc7\u9650\u5236\u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1550","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u7b2c k \u4e2a\u6700\u5c0f\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1551","title":"\u51c0\u73b0\u503c\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1552","title":"\u7528\u6808\u64cd\u4f5c\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1553","title":"\u5f62\u6210\u4e24\u4e2a\u5f02\u6216\u76f8\u7b49\u6570\u7ec4\u7684\u4e09\u5143\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1554","title":"\u6536\u96c6\u6811\u4e0a\u6240\u6709\u82f9\u679c\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1555","title":"\u5207\u62ab\u8428\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1556","title":"\u901a\u8fc7\u7ffb\u8f6c\u5b50\u6570\u7ec4\u4f7f\u4e24\u4e2a\u6570\u7ec4\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1557","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u5305\u542b\u6240\u6709\u957f\u5ea6\u4e3a K \u7684\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1558","title":"\u8bfe\u7a0b\u8868 IV","__typename":"AppliedTranslationNode"},{"questionId":"1559","title":"\u6458\u6a31\u6843 II","__typename":"AppliedTranslationNode"},{"questionId":"1560","title":"\u5728\u65e2\u5b9a\u65f6\u95f4\u505a\u4f5c\u4e1a\u7684\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1561","title":"\u91cd\u65b0\u6392\u5217\u53e5\u5b50\u4e2d\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1562","title":"\u6536\u85cf\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1563","title":"\u5706\u5f62\u9776\u5185\u7684\u6700\u5927\u98de\u9556\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1564","title":"\u5236\u4f5c\u4f1a\u8bdd\u67f1\u72b6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1565","title":"\u8ba1\u7b97\u5e03\u5c14\u8868\u8fbe\u5f0f\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1566","title":"\u68c0\u67e5\u5355\u8bcd\u662f\u5426\u4e3a\u53e5\u4e2d\u5176\u4ed6\u5355\u8bcd\u7684\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1567","title":"\u5b9a\u957f\u5b50\u4e32\u4e2d\u5143\u97f3\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1568","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u4f2a\u56de\u6587\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1569","title":"\u4e24\u4e2a\u5b50\u5e8f\u5217\u7684\u6700\u5927\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1570","title":"\u5546\u54c1\u6298\u6263\u540e\u7684\u6700\u7ec8\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1571","title":"\u5b89\u6392\u90ae\u7b52","__typename":"AppliedTranslationNode"},{"questionId":"1572","title":"\u5b50\u77e9\u5f62\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1573","title":"\u627e\u4e24\u4e2a\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1574","title":"\u6570\u7ec4\u4e2d\u4e24\u5143\u7d20\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1575","title":"\u5207\u5272\u540e\u9762\u79ef\u6700\u5927\u7684\u86cb\u7cd5","__typename":"AppliedTranslationNode"},{"questionId":"1576","title":"\u91cd\u65b0\u89c4\u5212\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1577","title":"\u4e24\u4e2a\u76d2\u5b50\u4e2d\u7403\u7684\u989c\u8272\u6570\u76f8\u540c\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1578","title":"\u82f9\u679c\u548c\u6854\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1579","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1580","title":"\u91cd\u65b0\u6392\u5217\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1581","title":"\u6570\u7ec4\u4e2d\u7684 k \u4e2a\u6700\u5f3a\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1582","title":"\u8bbe\u8ba1\u6d4f\u89c8\u5668\u5386\u53f2\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1583","title":"\u7c89\u5237\u623f\u5b50 III","__typename":"AppliedTranslationNode"},{"questionId":"1584","title":"\u53bb\u6389\u6700\u4f4e\u5de5\u8d44\u548c\u6700\u9ad8\u5de5\u8d44\u540e\u7684\u5de5\u8d44\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1585","title":"n \u7684\u7b2c k \u4e2a\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1586","title":"\u5220\u6389\u4e00\u4e2a\u5143\u7d20\u4ee5\u540e\u5168\u4e3a 1 \u7684\u6700\u957f\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1587","title":"\u5e76\u884c\u8bfe\u7a0b II","__typename":"AppliedTranslationNode"},{"questionId":"1603","title":"\u4e00\u7ef4\u6570\u7ec4\u7684\u52a8\u6001\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1604","title":"\u4e0d\u540c\u6574\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1605","title":"\u5236\u4f5c m \u675f\u82b1\u6240\u9700\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1607","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1608","title":"\u8ba1\u7b97\u7a0e\u540e\u5de5\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"1609","title":"\u5bfb\u627e\u6240\u6709\u7684\u72ec\u751f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1610","title":"\u6570\u7ec4\u5f02\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1611","title":"\u4fdd\u8bc1\u6587\u4ef6\u540d\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"1612","title":"\u907f\u514d\u6d2a\u6c34\u6cdb\u6ee5","__typename":"AppliedTranslationNode"},{"questionId":"1613","title":"\u627e\u5230\u6700\u5c0f\u751f\u6210\u6811\u91cc\u7684\u5173\u952e\u8fb9\u548c\u4f2a\u5173\u952e\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1615","title":"\u5b50\u6570\u7ec4\u548c\u6392\u5e8f\u540e\u7684\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1616","title":"\u4e09\u6b21\u64cd\u4f5c\u540e\u6700\u5927\u503c\u4e0e\u6700\u5c0f\u503c\u7684\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1617","title":"\u77f3\u5b50\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1618","title":"\u5220\u9664\u94fe\u8868 M \u4e2a\u8282\u70b9\u4e4b\u540e\u7684 N \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1619","title":"\u5224\u65ad\u8def\u5f84\u662f\u5426\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1620","title":"\u68c0\u67e5\u6570\u7ec4\u5bf9\u662f\u5426\u53ef\u4ee5\u88ab k \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1621","title":"\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1622","title":"\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1623","title":"\u5468\u5185\u6bcf\u5929\u7684\u9500\u552e\u60c5\u51b5","__typename":"AppliedTranslationNode"},{"questionId":"1624","title":"\u514b\u9686\u542b\u968f\u673a\u6307\u9488\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1625","title":"\u6309\u65e5\u671f\u5206\u7ec4\u9500\u552e\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1626","title":"\u5224\u65ad\u80fd\u5426\u5f62\u6210\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1627","title":"\u6240\u6709\u8682\u8681\u6389\u4e0b\u6765\u524d\u7684\u6700\u540e\u4e00\u523b","__typename":"AppliedTranslationNode"},{"questionId":"1628","title":"\u7edf\u8ba1\u5168 1 \u5b50\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1629","title":"\u6700\u591a K \u6b21\u4ea4\u6362\u76f8\u90bb\u6570\u4f4d\u540e\u5f97\u5230\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1630","title":"\u5728\u533a\u95f4\u8303\u56f4\u5185\u7edf\u8ba1\u5947\u6570\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1631","title":"\u548c\u4e3a\u5947\u6570\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1632","title":"\u5b57\u7b26\u4e32\u7684\u597d\u5206\u5272\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1633","title":"\u5f62\u6210\u76ee\u6807\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6700\u5c11\u589e\u52a0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1634","title":"\u514b\u9686 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1635","title":"\u597d\u6570\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1636","title":"\u4ec5\u542b 1 \u7684\u5b50\u4e32\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1637","title":"\u538b\u7f29\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"1638","title":"\u670d\u52a1\u4e2d\u5fc3\u7684\u6700\u4f73\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1639","title":"\u4e0a\u6708\u64ad\u653e\u7684\u513f\u7ae5\u9002\u5b9c\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"1640","title":"\u8bbe\u8ba1\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1641","title":"\u53ef\u4ee5\u653e\u5fc3\u6295\u8d44\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1642","title":"\u6362\u9152\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1643","title":"\u5b50\u6811\u4e2d\u6807\u7b7e\u76f8\u540c\u7684\u8282\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1644","title":"\u6700\u591a\u7684\u4e0d\u91cd\u53e0\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1645","title":"\u627e\u5230\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u51fd\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1646","title":"\u7b2c k \u4e2a\u7f3a\u5931\u7684\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1647","title":"K \u6b21\u64cd\u4f5c\u8f6c\u53d8\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1648","title":"\u5e73\u8861\u62ec\u53f7\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1649","title":"\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u975e\u7a7a\u5b50\u6570\u7ec4\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1650","title":"\u627e\u5230 N \u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1651","title":"\u91cd\u65b0\u6392\u5217\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1652","title":"\u706f\u6ce1\u5f00\u5173 IV","__typename":"AppliedTranslationNode"},{"questionId":"1653","title":"\u597d\u53f6\u5b50\u8282\u70b9\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1654","title":"\u6d88\u8d39\u8005\u4e0b\u5355\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1655","title":"\u79fb\u52a8 N \u53c9\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1656","title":"\u7edf\u8ba1\u597d\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1657","title":"\u627e\u51fa\u6570\u7ec4\u6e38\u620f\u7684\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1658","title":"\u6392\u5e03\u4e8c\u8fdb\u5236\u7f51\u683c\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1659","title":"\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1660","title":"\u5343\u4f4d\u5206\u9694\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1661","title":"\u53ef\u4ee5\u5230\u8fbe\u6240\u6709\u70b9\u7684\u6700\u5c11\u70b9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1662","title":"\u5f97\u5230\u76ee\u6807\u6570\u7ec4\u7684\u6700\u5c11\u51fd\u6570\u8c03\u7528\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1663","title":"\u4e8c\u7ef4\u7f51\u683c\u56fe\u4e2d\u63a2\u6d4b\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1664","title":"\u67e5\u627e\u62e5\u6709\u6709\u6548\u90ae\u7bb1\u7684\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1665","title":"N \u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1666","title":"\u6574\u7406\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1667","title":"\u627e\u51fa\u7b2c N \u4e2a\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c K \u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1668","title":"\u627e\u51fa\u6700\u957f\u7684\u8d85\u8d5e\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1669","title":"\u5207\u68cd\u5b50\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1670","title":"\u60a3\u67d0\u79cd\u75be\u75c5\u7684\u60a3\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1671","title":"\u6700\u8fd1\u7684\u4e09\u7b14\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1672","title":"\u627e\u5230\u6700\u5927\u6574\u6570\u7684\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"1674","title":"\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1675","title":"\u4e24\u7403\u4e4b\u95f4\u7684\u78c1\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1676","title":"\u5403\u6389 N \u4e2a\u6a58\u5b50\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1677","title":"\u77e9\u9635\u5bf9\u89d2\u7ebf\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1678","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1679","title":"\u5220\u9664\u6700\u77ed\u7684\u5b50\u6570\u7ec4\u4f7f\u5269\u4f59\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1680","title":"\u7edf\u8ba1\u6240\u6709\u53ef\u884c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1681","title":"\u627e\u51fa\u9690\u85cf\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1682","title":"\u5706\u5f62\u8d5b\u9053\u4e0a\u7ecf\u8fc7\u6b21\u6570\u6700\u591a\u7684\u6247\u533a","__typename":"AppliedTranslationNode"},{"questionId":"1683","title":"\u4f60\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1684","title":"\u67e5\u627e\u5927\u5c0f\u4e3a M \u7684\u6700\u65b0\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1685","title":"\u77f3\u5b50\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1686","title":"\u4ea7\u54c1\u540d\u79f0\u683c\u5f0f\u4fee\u590d","__typename":"AppliedTranslationNode"},{"questionId":"1687","title":"\u56fe\u4e2d\u6700\u76f8\u4f3c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1688","title":"\u6bcf\u4ef6\u5546\u54c1\u7684\u6700\u65b0\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1689","title":"\u91cd\u590d\u81f3\u5c11 K \u6b21\u4e14\u957f\u5ea6\u4e3a M \u7684\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1690","title":"\u4e58\u79ef\u4e3a\u6b63\u6570\u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1691","title":"\u4f7f\u9646\u5730\u5206\u79bb\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1692","title":"\u5c06\u5b50\u6570\u7ec4\u91cd\u65b0\u6392\u5e8f\u5f97\u5230\u540c\u4e00\u4e2a\u4e8c\u53c9\u67e5\u627e\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1693","title":"\u6240\u6709\u5947\u6570\u957f\u5ea6\u5b50\u6570\u7ec4\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1694","title":"\u4f7f\u6570\u7ec4\u548c\u80fd\u88ab P \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1695","title":"\u6240\u6709\u6392\u5217\u4e2d\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1696","title":"\u5947\u602a\u7684\u6253\u5370\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"1697","title":"\u53ea\u6709\u4e00\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1698","title":"\u66ff\u6362\u6240\u6709\u7684\u95ee\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1699","title":"\u6570\u7684\u5e73\u65b9\u7b49\u4e8e\u4e24\u6570\u4e58\u79ef\u7684\u65b9\u6cd5\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1700","title":"\u907f\u514d\u91cd\u590d\u5b57\u6bcd\u7684\u6700\u5c0f\u5220\u9664\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1701","title":"\u4fdd\u8bc1\u56fe\u53ef\u5b8c\u5168\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1702","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981","__typename":"AppliedTranslationNode"},{"questionId":"1703","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc I","__typename":"AppliedTranslationNode"},{"questionId":"1704","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u7279\u6b8a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1705","title":"\u7edf\u8ba1\u4e0d\u5f00\u5fc3\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"1706","title":"\u8fde\u63a5\u6240\u6709\u70b9\u7684\u6700\u5c0f\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1707","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u901a\u8fc7\u6392\u5e8f\u5b50\u5b57\u7b26\u4e32\u5f97\u5230\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1708","title":"\u8bbe\u8ba1\u505c\u8f66\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1709","title":"\u8b66\u544a\u4e00\u5c0f\u65f6\u5185\u4f7f\u7528\u76f8\u540c\u5458\u5de5\u5361\u5927\u4e8e\u7b49\u4e8e\u4e09\u6b21\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1710","title":"\u627e\u5230\u5904\u7406\u6700\u591a\u8bf7\u6c42\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1711","title":"\u7ed9\u5b9a\u884c\u548c\u5217\u7684\u548c\u6c42\u53ef\u884c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1712","title":"\u6309\u6708\u7edf\u8ba1\u8ba2\u5355\u6570\u4e0e\u987e\u5ba2\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1713","title":"\u4e24\u4e2a\u7a00\u758f\u5411\u91cf\u7684\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1714","title":"\u91cd\u65b0\u6392\u5217\u5355\u8bcd\u95f4\u7684\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1715","title":"\u62c6\u5206\u5b57\u7b26\u4e32\u4f7f\u552f\u4e00\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee\u6700\u5927","__typename":"AppliedTranslationNode"},{"questionId":"1716","title":"\u77e9\u9635\u7684\u6700\u5927\u975e\u8d1f\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1717","title":"\u8fde\u901a\u4e24\u7ec4\u70b9\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1718","title":"\u4ed3\u5e93\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1719","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc II","__typename":"AppliedTranslationNode"},{"questionId":"1720","title":"\u6587\u4ef6\u5939\u64cd\u4f5c\u65e5\u5fd7\u641c\u96c6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1721","title":"\u7ecf\u8425\u6469\u5929\u8f6e\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"1722","title":"\u7687\u4f4d\u7ee7\u627f\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1723","title":"\u6700\u591a\u53ef\u8fbe\u6210\u7684\u6362\u697c\u8bf7\u6c42\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1724","title":"\u8fdb\u5e97\u5374\u672a\u8fdb\u884c\u8fc7\u4ea4\u6613\u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1725","title":"\u5927\u5c0f\u4e3a K \u7684\u4e0d\u91cd\u53e0\u7ebf\u6bb5\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1726","title":"\u7f51\u7edc\u4fe1\u53f7\u6700\u597d\u7684\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1727","title":"\u732b\u548c\u8001\u9f20 II","__typename":"AppliedTranslationNode"},{"questionId":"1728","title":"\u5947\u5999\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1729","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"1730","title":"\u7279\u6b8a\u6570\u7ec4\u7684\u7279\u5f81\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1731","title":"\u5947\u5076\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1732","title":"\u4f7f\u6574\u6570\u53d8\u4e3a 0 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1733","title":"\u53ef\u89c1\u70b9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1734","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981 II","__typename":"AppliedTranslationNode"},{"questionId":"1735","title":"\u6bcf\u4f4d\u987e\u5ba2\u6700\u7ecf\u5e38\u8ba2\u8d2d\u7684\u5546\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1736","title":"\u6839\u636e\u4e2d\u7f00\u8868\u8fbe\u5f0f\u6784\u9020\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1737","title":"\u62ec\u53f7\u7684\u6700\u5927\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1738","title":"\u6700\u5927\u7f51\u7edc\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1739","title":"\u5206\u5272\u4e24\u4e2a\u5b57\u7b26\u4e32\u5f97\u5230\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1740","title":"\u7edf\u8ba1\u5b50\u6811\u4e2d\u57ce\u5e02\u4e4b\u95f4\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1741","title":"\u6309\u7167\u9891\u7387\u5c06\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1742","title":"\u4e24\u70b9\u4e4b\u95f4\u4e0d\u5305\u542b\u4efb\u4f55\u70b9\u7684\u6700\u5bbd\u5782\u76f4\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1743","title":"\u7edf\u8ba1\u53ea\u5dee\u4e00\u4e2a\u5b57\u7b26\u7684\u5b50\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1744","title":"\u901a\u8fc7\u7ed9\u5b9a\u8bcd\u5178\u6784\u9020\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1745","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u6700\u8fd1\u7684\u53f3\u4fa7\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1746","title":"\u4e24\u4e2a\u76f8\u540c\u5b57\u7b26\u4e4b\u95f4\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1747","title":"\u6267\u884c\u64cd\u4f5c\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1748","title":"\u65e0\u77db\u76fe\u7684\u6700\u4f73\u7403\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1749","title":"\u6ca1\u6709\u5356\u51fa\u7684\u5356\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1750","title":"\u68c0\u67e5\u4e24\u68f5\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811\u662f\u5426\u7b49\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1751","title":"\u6309\u952e\u6301\u7eed\u65f6\u95f4\u6700\u957f\u7684\u952e","__typename":"AppliedTranslationNode"},{"questionId":"1752","title":"\u7b49\u5dee\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1753","title":"\u6700\u5c0f\u4f53\u529b\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1755","title":"\u62c6\u70b8\u5f39","__typename":"AppliedTranslationNode"},{"questionId":"1756","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1757","title":"\u5230\u5bb6\u7684\u6700\u5c11\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1758","title":"\u5206\u914d\u91cd\u590d\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1759","title":"\u627e\u5230\u9057\u5931\u7684ID","__typename":"AppliedTranslationNode"},{"questionId":"1760","title":"\u80fd\u5426\u8fde\u63a5\u5f62\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1761","title":"\u7edf\u8ba1\u5b57\u5178\u5e8f\u5143\u97f3\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1762","title":"\u53ef\u4ee5\u5230\u8fbe\u7684\u6700\u8fdc\u5efa\u7b51","__typename":"AppliedTranslationNode"},{"questionId":"1763","title":"\u4e09\u4eba\u56fd\u5bb6\u4ee3\u8868\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1764","title":"\u6700\u5927\u91cd\u590d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1765","title":"\u5408\u5e76\u4e24\u4e2a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1766","title":"\u5f97\u5230\u5c71\u5f62\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1767","title":"\u8bbe\u8ba1\u524d\u4e2d\u540e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1768","title":"\u8bbe\u8ba1\u5e26\u89e3\u6790\u51fd\u6570\u7684\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1769","title":"\u83b7\u53d6\u751f\u6210\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1770","title":"\u5b57\u7b26\u9891\u6b21\u552f\u4e00\u7684\u6700\u5c0f\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1771","title":"\u9500\u552e\u4ef7\u503c\u51cf\u5c11\u7684\u989c\u8272\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1772","title":"\u901a\u8fc7\u6307\u4ee4\u521b\u5efa\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1773","title":"\u5404\u8d5b\u4e8b\u7684\u7528\u6237\u6ce8\u518c\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1774","title":"\u6c42\u4e24\u4e2a\u591a\u9879\u5f0f\u94fe\u8868\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1775","title":"\u8bbe\u8ba1\u6709\u5e8f\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1776","title":"\u5c06 x \u51cf\u5230 0 \u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1777","title":"\u786e\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u63a5\u8fd1","__typename":"AppliedTranslationNode"},{"questionId":"1778","title":"\u6700\u5927\u5316\u7f51\u683c\u5e78\u798f\u611f","__typename":"AppliedTranslationNode"},{"questionId":"1779","title":"Hopper \u516c\u53f8\u67e5\u8be2 I","__typename":"AppliedTranslationNode"},{"questionId":"1780","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 II","__typename":"AppliedTranslationNode"},{"questionId":"1781","title":"\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u6570\u7ec4\u662f\u5426\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1782","title":"\u5177\u6709\u7ed9\u5b9a\u6570\u503c\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1783","title":"\u751f\u6210\u5e73\u8861\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1784","title":"\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u521d\u59cb\u80fd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1786","title":"\u7edf\u8ba1\u4e00\u81f4\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1787","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u5dee\u7edd\u5bf9\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1788","title":"\u77f3\u5b50\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1789","title":"\u4ece\u4ed3\u5e93\u5230\u7801\u5934\u8fd0\u8f93\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1790","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 III","__typename":"AppliedTranslationNode"},{"questionId":"1791","title":"\u6700\u5bcc\u6709\u5ba2\u6237\u7684\u8d44\u4ea7\u603b\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1792","title":"\u627e\u51fa\u6700\u5177\u7ade\u4e89\u529b\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1793","title":"\u4f7f\u6570\u7ec4\u4e92\u8865\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1794","title":"\u6570\u7ec4\u7684\u6700\u5c0f\u504f\u79fb\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1796","title":"\u7ea0\u6b63\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1797","title":"\u8bbe\u8ba1 Goal \u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1798","title":"K \u548c\u6570\u5bf9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1799","title":"\u6700\u5c0f\u4e0d\u517c\u5bb9\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1800","title":"\u8fde\u63a5\u8fde\u7eed\u4e8c\u8fdb\u5236\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1801","title":"\u6bcf\u53f0\u673a\u5668\u7684\u8fdb\u7a0b\u5e73\u5747\u8fd0\u884c\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1802","title":"\u65e0\u6cd5\u5403\u5348\u9910\u7684\u5b66\u751f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1803","title":"\u5e73\u5747\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1804","title":"\u4fee\u6539\u540e\u7684\u6700\u5927\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1805","title":"\u5f97\u5230\u8fde\u7eed K \u4e2a 1 \u7684\u6700\u5c11\u76f8\u90bb\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1806","title":"\u6bd4\u8d5b\u4e2d\u7684\u914d\u5bf9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1807","title":"\u5341-\u4e8c\u8fdb\u5236\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1808","title":"\u77f3\u5b50\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"1809","title":"\u6570\u7ec4\u4e2d\u7279\u6b8a\u7b49\u95f4\u8ddd\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1810","title":"\u6539\u53d8\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1811","title":"\u4fee\u590d\u8868\u4e2d\u7684\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1812","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1813","title":"\u5220\u9664\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1814","title":"\u8df3\u8dc3\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1815","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1816","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 IV","__typename":"AppliedTranslationNode"},{"questionId":"1817","title":"\u8ba1\u7b97\u529b\u6263\u94f6\u884c\u7684\u94b1","__typename":"AppliedTranslationNode"},{"questionId":"1818","title":"\u5220\u9664\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1819","title":"\u6784\u5efa\u5b57\u5178\u5e8f\u6700\u5927\u7684\u53ef\u884c\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1820","title":"\u91cd\u6784\u4e00\u68f5\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1821","title":"\u53d1\u7968\u4e2d\u7684\u4ea7\u54c1\u91d1\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1822","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"1823","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u7684\u4e24\u534a\u662f\u5426\u76f8\u4f3c","__typename":"AppliedTranslationNode"},{"questionId":"1824","title":"\u5403\u82f9\u679c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1825","title":"\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1826","title":"\u4e0e\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1827","title":"\u65e0\u6548\u7684\u63a8\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1828","title":"\u8ba1\u7b97\u5206\u914d\u7cd6\u679c\u7684\u4e0d\u540c\u65b9\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1829","title":"\u5361\u8f66\u4e0a\u7684\u6700\u5927\u5355\u5143\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1830","title":"\u5927\u9910\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1831","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e09\u4e2a\u5b50\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1832","title":"\u5f97\u5230\u5b50\u5e8f\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1833","title":"\u627e\u5230\u6700\u9ad8\u6d77\u62d4","__typename":"AppliedTranslationNode"},{"questionId":"1834","title":"\u9700\u8981\u6559\u8bed\u8a00\u7684\u6700\u5c11\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1835","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1836","title":"\u751f\u6210\u4e58\u79ef\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1837","title":"\u6bcf\u5929\u7684\u9886\u5bfc\u548c\u5408\u4f19\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1838","title":"\u5b57\u7b26\u4e32\u7684\u4e0d\u540c\u5b50\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1839","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1840","title":"\u6267\u884c\u4ea4\u6362\u64cd\u4f5c\u540e\u7684\u6700\u5c0f\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1842","title":"\u4e24\u4eba\u4e4b\u95f4\u7684\u901a\u8bdd\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1843","title":"\u53ef\u4ee5\u5f62\u6210\u6700\u5927\u6b63\u65b9\u5f62\u7684\u77e9\u5f62\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1844","title":"\u76d2\u5b50\u4e2d\u5c0f\u7403\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1845","title":"\u91cd\u65b0\u6392\u5217\u540e\u7684\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1847","title":"\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1848","title":"\u552f\u4e00\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1849","title":"\u4efb\u610f\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u503c\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1850","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e24\u7aef\u76f8\u540c\u5b57\u7b26\u540e\u7684\u6700\u77ed\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1851","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee II","__typename":"AppliedTranslationNode"},{"questionId":"1852","title":"\u8bbf\u95ee\u65e5\u671f\u4e4b\u95f4\u6700\u5927\u7684\u7a7a\u6863\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1858","title":"\u66ff\u6362\u9690\u85cf\u6570\u5b57\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1859","title":"\u6ee1\u8db3\u4e09\u6761\u4ef6\u4e4b\u4e00\u9700\u6539\u53d8\u7684\u6700\u5c11\u5b57\u7b26\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1860","title":"\u627e\u51fa\u7b2c K \u5927\u7684\u5f02\u6216\u5750\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1861","title":"\u653e\u7f6e\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1862","title":"\u82f9\u679c\u548c\u6a58\u5b50\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1865","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728 II","__typename":"AppliedTranslationNode"},{"questionId":"1866","title":"\u4ece\u76f8\u90bb\u5143\u7d20\u5bf9\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1871","title":"\u56de\u6587\u4e32\u5206\u5272 IV","__typename":"AppliedTranslationNode"},{"questionId":"1872","title":"\u4f60\u80fd\u5728\u4f60\u6700\u559c\u6b22\u7684\u90a3\u5929\u5403\u5230\u4f60\u6700\u559c\u6b22\u7684\u7cd6\u679c\u5417\uff1f","__typename":"AppliedTranslationNode"},{"questionId":"1873","title":"\u6700\u957f\u7684\u7f8e\u597d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1874","title":"\u901a\u8fc7\u8fde\u63a5\u53e6\u4e00\u4e2a\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u5f97\u5230\u4e00\u4e2a\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1875","title":"\u4e92\u8d28\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1876","title":"\u5730\u56fe\u4e2d\u7684\u6700\u9ad8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1877","title":"\u6c42\u5173\u6ce8\u8005\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1878","title":"\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u7ecf\u6392\u5e8f\u548c\u8f6e\u8f6c\u5f97\u5230","__typename":"AppliedTranslationNode"},{"questionId":"1879","title":"\u79fb\u9664\u77f3\u5b50\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1880","title":"\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5927\u7684\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1881","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1882","title":"\u6bcf\u4f4d\u7ecf\u7406\u7684\u4e0b\u5c5e\u5458\u5de5\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1883","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1884","title":"\u751f\u6210\u4ea4\u66ff\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1885","title":"\u7edf\u8ba1\u540c\u6784\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1886","title":"\u888b\u5b50\u91cc\u6700\u5c11\u6570\u76ee\u7684\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1887","title":"\u4e00\u4e2a\u56fe\u4e2d\u8fde\u901a\u4e09\u5143\u7ec4\u7684\u6700\u5c0f\u5ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1888","title":"\u627e\u5230\u6700\u8fd1\u7684\u6709\u76f8\u540c X \u6216 Y \u5750\u6807\u7684\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1889","title":"\u5224\u65ad\u4e00\u4e2a\u6570\u5b57\u662f\u5426\u53ef\u4ee5\u8868\u793a\u6210\u4e09\u7684\u5e42\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1890","title":"\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u7f8e\u4e3d\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1891","title":"\u7edf\u8ba1\u70b9\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1892","title":"\u67e5\u627e\u6bcf\u4e2a\u5458\u5de5\u82b1\u8d39\u7684\u603b\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1893","title":"\u7ecf\u8fc7\u4e00\u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1894","title":"\u4ea4\u66ff\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1895","title":"\u79fb\u52a8\u6240\u6709\u7403\u5230\u6bcf\u4e2a\u76d2\u5b50\u6240\u9700\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1896","title":"\u6267\u884c\u4e58\u6cd5\u8fd0\u7b97\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1897","title":"\u7531\u5b50\u5e8f\u5217\u6784\u9020\u7684\u6700\u957f\u56de\u6587\u4e32\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1898","title":"\u5e94\u8be5\u88ab\u7981\u6b62\u7684Leetflex\u8d26\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1899","title":"\u7edf\u8ba1\u5339\u914d\u68c0\u7d22\u89c4\u5219\u7684\u7269\u54c1\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1900","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u4ef7\u683c\u7684\u751c\u70b9\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1901","title":"\u901a\u8fc7\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1902","title":"\u8f66\u961f II","__typename":"AppliedTranslationNode"},{"questionId":"1903","title":"\u8bbe\u8ba1\u6700\u8fd1\u4f7f\u7528\uff08MRU\uff09\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1904","title":"\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e8c\u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1905","title":"\u8bbe\u8ba1\u4e00\u4e2a\u9a8c\u8bc1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1906","title":"N \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1907","title":"\u7edf\u8ba1\u5f02\u6216\u503c\u5728\u8303\u56f4\u5185\u7684\u6570\u5bf9\u6709\u591a\u5c11","__typename":"AppliedTranslationNode"},{"questionId":"1908","title":"\u53ef\u56de\u6536\u4e14\u4f4e\u8102\u7684\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1909","title":"\u80fd\u770b\u5230\u6d77\u666f\u7684\u5efa\u7b51\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1910","title":"\u68c0\u67e5\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1911","title":"\u6784\u6210\u7279\u5b9a\u548c\u9700\u8981\u6dfb\u52a0\u7684\u6700\u5c11\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1912","title":"\u4ece\u7b2c\u4e00\u4e2a\u8282\u70b9\u51fa\u53d1\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684\u53d7\u9650\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1913","title":"\u4f7f\u6240\u6709\u533a\u95f4\u7684\u5f02\u6216\u7ed3\u679c\u4e3a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1914","title":"\u5bfb\u627e\u6ca1\u6709\u88ab\u6267\u884c\u7684\u4efb\u52a1\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1915","title":"\u4ec5\u6267\u884c\u4e00\u6b21\u5b57\u7b26\u4e32\u4ea4\u6362\u80fd\u5426\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1916","title":"\u627e\u51fa\u661f\u578b\u56fe\u7684\u4e2d\u5fc3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1917","title":"\u6700\u5927\u5e73\u5747\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1918","title":"\u597d\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1919","title":"\u6309\u53d7\u6b22\u8fce\u7a0b\u5ea6\u6392\u5217\u529f\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"1920","title":"\u5224\u65ad\u56fd\u9645\u8c61\u68cb\u68cb\u76d8\u4e2d\u4e00\u4e2a\u683c\u5b50\u7684\u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1923","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 III","__typename":"AppliedTranslationNode"},{"questionId":"1924","title":"\u5f97\u5230\u65b0\u9c9c\u751c\u751c\u5708\u7684\u6700\u591a\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1925","title":"\u7edf\u8ba1\u4e00\u4e2a\u6570\u7ec4\u4e2d\u597d\u5bf9\u5b50\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1926","title":"\u6bcf\u5bb6\u5546\u5e97\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1927","title":"\u6700\u5927\u5347\u5e8f\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1928","title":"\u79ef\u538b\u8ba2\u5355\u4e2d\u7684\u8ba2\u5355\u603b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1929","title":"\u6709\u754c\u6570\u7ec4\u4e2d\u6307\u5b9a\u4e0b\u6807\u5904\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1930","title":"\u4f60\u80fd\u6784\u9020\u51fa\u8fde\u7eed\u503c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1931","title":"\u672a\u77e5\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1932","title":"\u5927\u6ee1\u8d2f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1933","title":"\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1934","title":"\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u62ec\u53f7\u5185\u5bb9","__typename":"AppliedTranslationNode"},{"questionId":"1935","title":"\u8fd8\u539f\u6392\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b65\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1936","title":"\u597d\u56e0\u5b50\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1937","title":"\u6700\u5927\u5316\u82b1\u56ed\u7684\u7f8e\u89c2\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1938","title":"\u6700\u5c11\u64cd\u4f5c\u4f7f\u6570\u7ec4\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1939","title":"\u7edf\u8ba1\u4e00\u4e2a\u5706\u4e2d\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1940","title":"\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1941","title":"\u4f7f\u5b57\u7b26\u4e32\u6709\u5e8f\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1942","title":"\u5458\u5de5\u7684\u76f4\u5c5e\u90e8\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"1943","title":"\u7edf\u8ba1\u8ddd\u79bb\u6700\u5c0f\u7684\u5b50\u4e32\u5bf9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1944","title":"\u622a\u65ad\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1945","title":"\u67e5\u627e\u7528\u6237\u6d3b\u8dc3\u5206\u949f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1946","title":"\u7edd\u5bf9\u5dee\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1947","title":"\u5e8f\u5217\u4e2d\u4e0d\u540c\u6700\u5927\u516c\u7ea6\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1948","title":"\u6bcf\u4e2a\u4ea7\u54c1\u5728\u4e0d\u540c\u5546\u5e97\u7684\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1949","title":"\u5b9e\u73b0 Trie \uff08\u524d\u7f00\u6811\uff09 II","__typename":"AppliedTranslationNode"},{"questionId":"1950","title":"\u6570\u7ec4\u5143\u7d20\u79ef\u7684\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1951","title":"\u627e\u51fa\u6e38\u620f\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1952","title":"\u6700\u5c11\u4fa7\u8df3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1953","title":"\u6c42\u51fa MK \u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1954","title":"\u5c06\u6240\u6709\u6570\u5b57\u7528\u5b57\u7b26\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1955","title":"\u5ea7\u4f4d\u9884\u7ea6\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1956","title":"\u51cf\u5c0f\u548c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\u540e\u7684\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1957","title":"\u6700\u8fd1\u7684\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1958","title":"\u6ca1\u6709\u5e7f\u544a\u7684\u5267\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1959","title":"\u9690\u85cf\u7f51\u683c\u4e0b\u7684\u6700\u5c0f\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1960","title":"\u5224\u65ad\u53e5\u5b50\u662f\u5426\u4e3a\u5168\u5b57\u6bcd\u53e5","__typename":"AppliedTranslationNode"},{"questionId":"1961","title":"\u96ea\u7cd5\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1962","title":"\u5355\u7ebf\u7a0b CPU","__typename":"AppliedTranslationNode"},{"questionId":"1963","title":"\u6240\u6709\u6570\u5bf9\u6309\u4f4d\u4e0e\u7ed3\u679c\u7684\u5f02\u6216\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1964","title":"\u5bfb\u627e\u9762\u8bd5\u5019\u9009\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1965","title":"K \u8fdb\u5236\u8868\u793a\u4e0b\u7684\u5404\u4f4d\u6570\u5b57\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1966","title":"\u6700\u9ad8\u9891\u5143\u7d20\u7684\u9891\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1967","title":"\u6240\u6709\u5143\u97f3\u6309\u987a\u5e8f\u6392\u5e03\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1968","title":"\u6700\u9ad8\u5efa\u7b51\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1969","title":"\u6700\u591a\u9080\u8bf7\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1970","title":"\u5c06\u53e5\u5b50\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1971","title":"\u589e\u957f\u7684\u5185\u5b58\u6cc4\u9732","__typename":"AppliedTranslationNode"},{"questionId":"1972","title":"\u65cb\u8f6c\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1974","title":"\u5bfb\u627e\u4eca\u5e74\u5177\u6709\u6b63\u6536\u5165\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1975","title":"\u5230\u76ee\u6807\u5143\u7d20\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1976","title":"\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u9012\u51cf\u7684\u8fde\u7eed\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1977","title":"\u5305\u542b\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1978","title":"\u90bb\u4f4d\u4ea4\u6362\u7684\u6700\u5c0f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1980","title":"\u6709\u7f3a\u9677\u7684\u4f20\u611f\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1981","title":"\u6bcf\u5929\u7684\u6700\u5927\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1982","title":"\u4ece\u672a\u6392\u5e8f\u7684\u94fe\u8868\u4e2d\u79fb\u9664\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1983","title":"\u4eba\u53e3\u6700\u591a\u7684\u5e74\u4efd","__typename":"AppliedTranslationNode"},{"questionId":"1984","title":"\u4e0b\u6807\u5bf9\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1985","title":"\u5b50\u6570\u7ec4\u6700\u5c0f\u4e58\u79ef\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1986","title":"\u6709\u5411\u56fe\u4e2d\u6700\u5927\u989c\u8272\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1987","title":"\u957f\u5ea6\u4e3a\u4e09\u4e14\u5404\u5b57\u7b26\u4e0d\u540c\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1988","title":"\u6570\u7ec4\u4e2d\u6700\u5927\u6570\u5bf9\u548c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1989","title":"\u4e24\u4e2a\u6570\u7ec4\u6700\u5c0f\u7684\u5f02\u6216\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1990","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u4e09\u4e2a\u83f1\u5f62\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1991","title":"\u8054\u8d5b\u4fe1\u606f\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1993","title":"\u627e\u51fa\u6240\u6709\u5b50\u96c6\u7684\u5f02\u6216\u603b\u548c\u518d\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1994","title":"\u6784\u6210\u4ea4\u66ff\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1995","title":"\u627e\u51fa\u548c\u4e3a\u6307\u5b9a\u503c\u7684\u4e0b\u6807\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1996","title":"\u6070\u6709 K \u6839\u6728\u68cd\u53ef\u4ee5\u770b\u5230\u7684\u6392\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1997","title":"\u4e0b\u4e2a\u7531\u76f8\u540c\u6570\u5b57\u6784\u6210\u7684\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1999","title":"\u54ea\u79cd\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u66f4\u957f","__typename":"AppliedTranslationNode"},{"questionId":"2000","title":"\u51c6\u65f6\u5230\u8fbe\u7684\u5217\u8f66\u6700\u5c0f\u65f6\u901f","__typename":"AppliedTranslationNode"},{"questionId":"2001","title":"\u8df3\u8dc3\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"2002","title":"\u77f3\u5b50\u6e38\u620f VIII","__typename":"AppliedTranslationNode"},{"questionId":"2003","title":"\u6bcf\u4e2a\u5b50\u6570\u7ec4\u7684\u6570\u5b57\u79cd\u7c7b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2004","title":"\u8f6c\u6362\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"2005","title":"\u68c0\u67e5\u662f\u5426\u533a\u57df\u5185\u6240\u6709\u6574\u6570\u90fd\u88ab\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"2006","title":"\u627e\u5230\u9700\u8981\u8865\u5145\u7c89\u7b14\u7684\u5b66\u751f\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2008","title":"\u53cd\u8f6c\u8868\u8fbe\u5f0f\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2009","title":"\u5305\u542b\u6240\u6709\u524d\u7f00\u7684\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"2010","title":"\u68c0\u67e5\u67d0\u5355\u8bcd\u662f\u5426\u7b49\u4e8e\u4e24\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2011","title":"\u63d2\u5165\u540e\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2012","title":"\u4f7f\u7528\u670d\u52a1\u5668\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"2013","title":"\u51c6\u65f6\u62b5\u8fbe\u4f1a\u8bae\u73b0\u573a\u7684\u6700\u5c0f\u8df3\u8fc7\u4f11\u606f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2015","title":"\u5224\u65ad\u77e9\u9635\u7ecf\u8f6e\u8f6c\u540e\u662f\u5426\u4e00\u81f4","__typename":"AppliedTranslationNode"},{"questionId":"2016","title":"\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49\u7684\u51cf\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2017","title":"\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u7b26\u4ea4\u66ff\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2018","title":"\u88c5\u5305\u88f9\u7684\u6700\u5c0f\u6d6a\u8d39\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2019","title":"\u4e24\u4e2a\u884c\u7a0b\u7f16\u7801\u6570\u7ec4\u7684\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2020","title":"\u5220\u9664\u4e00\u4e2a\u5143\u7d20\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"2021","title":"\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u51fa\u73b0\u7684\u7ed9\u5b9a\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2022","title":"\u6700\u5927\u5b50\u5e8f\u5217\u4ea4\u66ff\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2023","title":"\u8bbe\u8ba1\u7535\u5f71\u79df\u501f\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"2024","title":"\u8ba1\u7b97\u7279\u6b8a\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"2025","title":"\u91cd\u65b0\u5206\u914d\u5b57\u7b26\u4f7f\u6240\u6709\u5b57\u7b26\u4e32\u90fd\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"2026","title":"\u5408\u5e76\u82e5\u5e72\u4e09\u5143\u7ec4\u4ee5\u5f62\u6210\u76ee\u6807\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2027","title":"\u53ef\u79fb\u9664\u5b57\u7b26\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2028","title":"\u6700\u4f73\u8fd0\u52a8\u5458\u7684\u6bd4\u62fc\u56de\u5408","__typename":"AppliedTranslationNode"},{"questionId":"2029","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u6700\u5c0f\u4e58\u79ef\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2031","title":"\u9e21\u86cb\u6389\u843d-\u4e24\u679a\u9e21\u86cb","__typename":"AppliedTranslationNode"},{"questionId":"2032","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6700\u5927\u5947\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2033","title":"\u4f60\u5b8c\u6210\u7684\u5b8c\u6574\u5bf9\u5c40\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2034","title":"\u67e5\u8be2\u5dee\u7edd\u5bf9\u503c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2035","title":"\u7edf\u8ba1\u5b50\u5c9b\u5c7f","__typename":"AppliedTranslationNode"},{"questionId":"2037","title":"\u7edf\u8ba1\u5e73\u65b9\u548c\u4e09\u5143\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2038","title":"\u8ff7\u5bab\u4e2d\u79bb\u5165\u53e3\u6700\u8fd1\u7684\u51fa\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"2039","title":"\u6c42\u548c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2040","title":"\u89c4\u5b9a\u65f6\u95f4\u5185\u5230\u8fbe\u7ec8\u70b9\u7684\u6700\u5c0f\u82b1\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"2041","title":"2020\u5e74\u6700\u540e\u4e00\u6b21\u767b\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"2042","title":"\u4e24\u4e2a\u6570\u5bf9\u4e4b\u95f4\u7684\u6700\u5927\u4e58\u79ef\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2043","title":"\u5faa\u73af\u8f6e\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"2044","title":"\u6700\u7f8e\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2045","title":"\u5272\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"2046","title":"\u9875\u9762\u63a8\u8350\u2161","__typename":"AppliedTranslationNode"},{"questionId":"2047","title":"\u627e\u51fa\u9876\u5cf0\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"2048","title":"\u57fa\u4e8e\u6392\u5217\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2049","title":"\u6d88\u706d\u602a\u7269\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2050","title":"\u7edf\u8ba1\u597d\u6570\u5b57\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2051","title":"\u6700\u957f\u516c\u5171\u5b50\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"2053","title":"\u68c0\u67e5\u662f\u5426\u6240\u6709\u5b57\u7b26\u51fa\u73b0\u6b21\u6570\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"2054","title":"\u6700\u5c0f\u672a\u88ab\u5360\u636e\u6905\u5b50\u7684\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2055","title":"\u63cf\u8ff0\u7ed8\u753b\u7ed3\u679c","__typename":"AppliedTranslationNode"},{"questionId":"2057","title":"\u6309\u5206\u7c7b\u7edf\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"2058","title":"\u6570\u7ec4\u4e32\u8054","__typename":"AppliedTranslationNode"},{"questionId":"2059","title":"\u957f\u5ea6\u4e3a 3 \u7684\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2060","title":"\u5408\u5e76\u591a\u68f5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"2061","title":"\u7528\u4e09\u79cd\u4e0d\u540c\u989c\u8272\u4e3a\u7f51\u683c\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"2062","title":"Nim \u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"2064","title":"\u5174\u8da3\u76f8\u540c\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"2066","title":"\u65b0\u589e\u7684\u6700\u5c11\u53f0\u9636\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2067","title":"\u6263\u5206\u540e\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"2068","title":"\u67e5\u8be2\u6700\u5927\u57fa\u56e0\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2069","title":"\u7b2c K \u5c0f\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2070","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u5206\u89e3\u4e3a\u503c\u5747\u7b49\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2071","title":"\u6392\u5e8f\u6570\u7ec4\u4e4b\u95f4\u7684\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2072","title":"\u6240\u6709\u5b50\u6570\u7ec4\u6700\u5c0f\u503c\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2073","title":"\u611f\u67d3 K \u79cd\u75c5\u6bd2\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2076","title":"\u5b57\u7b26\u4e32\u8f6c\u5316\u540e\u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2077","title":"\u5b50\u5b57\u7b26\u4e32\u7a81\u53d8\u540e\u53ef\u80fd\u5f97\u5230\u7684\u6700\u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2078","title":"\u6700\u5927\u517c\u5bb9\u6027\u8bc4\u5206\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2079","title":"\u5220\u9664\u7cfb\u7edf\u4e2d\u7684\u91cd\u590d\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"2080","title":"\u68c0\u67e5\u64cd\u4f5c\u662f\u5426\u5408\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"2081","title":"K \u6b21\u8c03\u6574\u6570\u7ec4\u5927\u5c0f\u6d6a\u8d39\u7684\u6700\u5c0f\u603b\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2083","title":"\u4e09\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2084","title":"\u4f60\u53ef\u4ee5\u5de5\u4f5c\u7684\u6700\u5927\u5468\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2085","title":"\u6784\u9020\u5143\u7d20\u4e0d\u7b49\u4e8e\u4e24\u76f8\u90bb\u5143\u7d20\u5e73\u5747\u503c\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2086","title":"\u7edf\u8ba1\u7279\u6b8a\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2088","title":"\u4f7f\u7528\u7279\u6b8a\u6253\u5b57\u673a\u952e\u5165\u5355\u8bcd\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2089","title":"\u6700\u5927\u65b9\u9635\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2090","title":"\u5230\u8fbe\u76ee\u7684\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2091","title":"\u5212\u5206\u6570\u5b57\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2093","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u4e3a\u6570\u7ec4\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2094","title":"\u79fb\u9664\u77f3\u5b50\u4f7f\u603b\u6570\u6700\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"2095","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2096","title":"\u627e\u51fa\u5230\u6bcf\u4e2a\u4f4d\u7f6e\u4e3a\u6b62\u6700\u957f\u7684\u6709\u6548\u969c\u788d\u8d5b\u8dd1\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"2098","title":"\u67e5\u8be2\u5177\u6709\u6700\u591a\u5171\u540c\u5173\u6ce8\u8005\u7684\u6240\u6709\u4e24\u4e24\u7ed3\u5bf9\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2099","title":"\u4f5c\u4e3a\u5b50\u5b57\u7b26\u4e32\u51fa\u73b0\u5728\u5355\u8bcd\u4e2d\u7684\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2100","title":"\u6570\u7ec4\u5143\u7d20\u7684\u6700\u5c0f\u975e\u96f6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2101","title":"\u4f60\u80fd\u7a7f\u8fc7\u77e9\u9635\u7684\u6700\u540e\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2102","title":"\u627e\u5230\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"2103","title":"\u627e\u5230\u6240\u6709\u7684\u519c\u573a\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2104","title":"\u6811\u4e0a\u7684\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"2105","title":"\u597d\u5b50\u96c6\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2106","title":"\u627e\u51fa\u6570\u7ec4\u7684\u6700\u5927\u516c\u7ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2107","title":"\u627e\u51fa\u4e0d\u540c\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2108","title":"\u6700\u5c0f\u5316\u76ee\u6807\u503c\u4e0e\u6240\u9009\u5143\u7d20\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2109","title":"\u4ece\u5b50\u96c6\u7684\u548c\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2112","title":"\u5b66\u751f\u5206\u6570\u7684\u6700\u5c0f\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2113","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c K \u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2114","title":"\u5b8c\u6210\u4efb\u52a1\u7684\u6700\u5c11\u5de5\u4f5c\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"2115","title":"\u4e0d\u540c\u7684\u597d\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2116","title":"\u5dee\u7684\u7edd\u5bf9\u503c\u4e3a K \u7684\u6570\u5bf9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2117","title":"\u4ece\u53cc\u500d\u6570\u7ec4\u4e2d\u8fd8\u539f\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2118","title":"\u51fa\u79df\u8f66\u7684\u6700\u5927\u76c8\u5229","__typename":"AppliedTranslationNode"},{"questionId":"2119","title":"\u4f7f\u6570\u7ec4\u8fde\u7eed\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2122","title":"\u7edf\u8ba1\u7279\u6b8a\u56db\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2123","title":"\u6e38\u620f\u4e2d\u5f31\u89d2\u8272\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2124","title":"\u8bbf\u95ee\u5b8c\u6240\u6709\u623f\u95f4\u7684\u7b2c\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2125","title":"\u6570\u7ec4\u7684\u6700\u5927\u516c\u56e0\u6570\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"2128","title":"\u53cd\u8f6c\u5355\u8bcd\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2129","title":"\u53ef\u4e92\u6362\u77e9\u5f62\u7684\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2130","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5e8f\u5217\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2131","title":"\u6bcf\u68f5\u5b50\u6811\u5185\u7f3a\u5931\u7684\u6700\u5c0f\u57fa\u56e0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2132","title":"\u5c06\u4e00\u7ef4\u6570\u7ec4\u8f6c\u53d8\u6210\u4e8c\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2133","title":"\u8fde\u63a5\u540e\u7b49\u4e8e\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"2134","title":"\u8003\u8bd5\u7684\u6700\u5927\u56f0\u6270\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"2135","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u591a\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2137","title":"\u6267\u884c\u64cd\u4f5c\u540e\u7684\u53d8\u91cf\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2138","title":"\u6570\u7ec4\u7f8e\u4e3d\u503c\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2139","title":"\u68c0\u6d4b\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"2140","title":"\u91cd\u590d K \u6b21\u7684\u6700\u957f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2144","title":"\u589e\u91cf\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2145","title":"\u7f51\u683c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2146","title":"\u5224\u65ad\u5355\u8bcd\u662f\u5426\u80fd\u653e\u5165\u586b\u5b57\u6e38\u620f\u5185","__typename":"AppliedTranslationNode"},{"questionId":"2147","title":"\u89e3\u51fa\u6570\u5b66\u8868\u8fbe\u5f0f\u7684\u5b66\u751f\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2154","title":"\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2155","title":"\u627e\u51fa\u7f3a\u5931\u7684\u89c2\u6d4b\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"2156","title":"\u77f3\u5b50\u6e38\u620f IX","__typename":"AppliedTranslationNode"},{"questionId":"2157","title":"\u542b\u7279\u5b9a\u5b57\u6bcd\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2160","title":"\u83b7\u53d6\u5355\u503c\u7f51\u683c\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2161","title":"\u80a1\u7968\u4ef7\u683c\u6ce2\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"2162","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u4e2a\u6570\u7ec4\u5e76\u6700\u5c0f\u5316\u6570\u7ec4\u548c\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100002","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100003","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100004","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100005","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100006","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100007","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100008","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100009","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100010","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100011","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100012","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100013","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100014","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100015","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100016","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100017","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100018","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100019","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100020","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100021","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100022","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100023","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100024","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100025","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100026","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100027","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100028","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100029","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100030","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100031","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100032","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100033","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100034","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100035","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100036","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100037","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100038","title":"\u78b0\u649e\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100039","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100040","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100041","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100042","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100043","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100044","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100045","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100046","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100047","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100048","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100049","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100050","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100051","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100052","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100065","title":"\u6700\u5c0f\u4ea4\u6362\u6b21\u6570\u4f7f\u5f97\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100091","title":"\u529b\u6263\u8c61\u68cb\u5b66\u5802","__typename":"AppliedTranslationNode"},{"questionId":"100092","title":"\u5206\u5f0f\u5316\u7b80","__typename":"AppliedTranslationNode"},{"questionId":"100093","title":"\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"100094","title":"\u53d1 LeetCoin","__typename":"AppliedTranslationNode"},{"questionId":"100096","title":"\u673a\u5668\u4eba\u5927\u5192\u9669","__typename":"AppliedTranslationNode"},{"questionId":"100103","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100104","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100105","title":"\u56f4\u6210\u4e00\u5708","__typename":"AppliedTranslationNode"},{"questionId":"100106","title":"\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100107","title":"\u731c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100125","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570 - LC","__typename":"AppliedTranslationNode"},{"questionId":"100129","title":"\u5458\u5de5\u4e92\u8bc4","__typename":"AppliedTranslationNode"},{"questionId":"100130","title":"\u7535\u68af","__typename":"AppliedTranslationNode"},{"questionId":"100136","title":"\u5b57\u7b26\u4e32\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"100139","title":"\u6d4b\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100144","title":"\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100146","title":"\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"100147","title":"\u6d88\u9664\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100148","title":"PK","__typename":"AppliedTranslationNode"},{"questionId":"100149","title":"\u5408\u5e76\u4efb\u52a1\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100151","title":"\u56fd\u5bb6\u7ed3\u76df -- 952 \u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"100152","title":"\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100153","title":"\u5feb\u9012\u5458\u6d3e\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"100154","title":"\u8fde\u8fde\u770b","__typename":"AppliedTranslationNode"},{"questionId":"100157","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"100158","title":"\u5224\u5b9a\u5b57\u7b26\u662f\u5426\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100159","title":"\u5224\u5b9a\u662f\u5426\u4e92\u4e3a\u5b57\u7b26\u91cd\u6392","__typename":"AppliedTranslationNode"},{"questionId":"100160","title":"URL\u5316","__typename":"AppliedTranslationNode"},{"questionId":"100161","title":"\u5b57\u7b26\u4e32\u538b\u7f29","__typename":"AppliedTranslationNode"},{"questionId":"100162","title":"\u5b57\u7b26\u4e32\u8f6e\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"100163","title":"\u79fb\u9664\u91cd\u590d\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100164","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100167","title":"\u94fe\u8868\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"100168","title":"\u73af\u8def\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"100169","title":"\u6808\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100170","title":"\u5316\u6808\u4e3a\u961f","__typename":"AppliedTranslationNode"},{"questionId":"100171","title":"\u8282\u70b9\u95f4\u901a\u8def","__typename":"AppliedTranslationNode"},{"questionId":"100172","title":"\u4e09\u5408\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100173","title":"\u6808\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100174","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100175","title":"\u7279\u5b9a\u6df1\u5ea6\u8282\u70b9\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100176","title":"\u68c0\u67e5\u5e73\u8861\u6027","__typename":"AppliedTranslationNode"},{"questionId":"100177","title":"\u5408\u6cd5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100178","title":"\u540e\u7ee7\u8005","__typename":"AppliedTranslationNode"},{"questionId":"100179","title":"\u9996\u4e2a\u5171\u540c\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100180","title":"\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"100181","title":"\u6574\u6570\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100182","title":"\u914d\u5bf9\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100183","title":"\u4e0b\u4e00\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100184","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100185","title":"\u65cb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100186","title":"\u96f6\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100187","title":"\u5220\u9664\u4e2d\u95f4\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100188","title":"\u94fe\u8868\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100189","title":"\u897f\u6e38\u8bb0","__typename":"AppliedTranslationNode"},{"questionId":"100191","title":"\u4f18\u5316\u53c2\u8d5b\u961f\u4f0d","__typename":"AppliedTranslationNode"},{"questionId":"100193","title":"\u9ed1\u767d\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"100194","title":"2048 \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100195","title":"\u5806\u76d8\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100196","title":"\u7ed8\u5236\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100197","title":"\u4e09\u6b65\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100198","title":"\u5e42\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"100199","title":"\u9012\u5f52\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100200","title":"\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"100201","title":"\u989c\u8272\u586b\u5145","__typename":"AppliedTranslationNode"},{"questionId":"100202","title":"\u5806\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100203","title":"\u4e8c\u8fdb\u5236\u6570\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100206","title":"\u70b9\u4eae\u5723\u8bde\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100207","title":"\u8ff7\u5bab\u91cd\u529b\u7403","__typename":"AppliedTranslationNode"},{"questionId":"100208","title":"\u65e9\u9910\u9ad8\u5cf0","__typename":"AppliedTranslationNode"},{"questionId":"100209","title":"\u6768\u67f3\u7d6e\u6291\u5236\u5242","__typename":"AppliedTranslationNode"},{"questionId":"100210","title":"\u642c\u5bb6\u6253\u5305","__typename":"AppliedTranslationNode"},{"questionId":"100211","title":" \u671f\u4e2d\u8003\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100212","title":"\u5468\u516d\u5bb5\u591c\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100213","title":"\u51fa\u6e38\u603b\u7ed3","__typename":"AppliedTranslationNode"},{"questionId":"100214","title":"\u9910\u5385\u4f18\u60e0\u5238","__typename":"AppliedTranslationNode"},{"questionId":"100215","title":"\u51fa\u5dee\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100216","title":"\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"100217","title":"\u6700\u62e5\u5835\u7684\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"100218","title":"\u5165\u5b66\u8003\u8bd5\u7b97\u6cd5\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100219","title":"\u5783\u573e\u90ae\u4ef6\u8fc7\u6ee4\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"100220","title":"\u672c\u5468\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"100221","title":"\u4e34\u65f6\u70b9\u9910\u5458","__typename":"AppliedTranslationNode"},{"questionId":"100222","title":"\u5c0f\u7ec4\u8ba8\u8bba","__typename":"AppliedTranslationNode"},{"questionId":"100223","title":"\u91c7\u8d2d\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"100226","title":"\u7b97\u6cd5\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"100228","title":"\u52a8\u7269\u6536\u5bb9\u6240","__typename":"AppliedTranslationNode"},{"questionId":"100229","title":"\u68c0\u67e5\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100230","title":"\u7ffb\u8f6c\u6570\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"100231","title":"\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"100232","title":"\u641c\u7d22\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100233","title":"\u516b\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"100234","title":"\u57fa\u7ad9\u5730\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"100235","title":"\u7f16\u7a0b\u8bed\u8a00\u504f\u597d\u8c03\u67e5","__typename":"AppliedTranslationNode"},{"questionId":"100236","title":"\u964d\u566a\u8033\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100237","title":"\u51fa\u5dee\u8def\u7ebf II","__typename":"AppliedTranslationNode"},{"questionId":"100238","title":"\u4e92\u4fe1\u534f\u5546\u673a\u5236 II","__typename":"AppliedTranslationNode"},{"questionId":"100239","title":"TLV \u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"100240","title":"\u9b54\u672f\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"100241","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100242","title":"\u7a00\u758f\u6570\u7ec4\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"100246","title":"\u5458\u5de5\u8fd0\u52a8\u4f1a","__typename":"AppliedTranslationNode"},{"questionId":"100247","title":"\u65f6\u95f4\u7247\u8f6e\u8f6c\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100248","title":"\u6700\u77ed\u5269\u4f59\u65f6\u95f4\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100249","title":"\u6570\u636e\u590d\u539f","__typename":"AppliedTranslationNode"},{"questionId":"100250","title":"\u8eab\u9ad8\u4f18\u52bf","__typename":"AppliedTranslationNode"},{"questionId":"100251","title":"\u5b9a\u4ef7\u7b56\u7565","__typename":"AppliedTranslationNode"},{"questionId":"100252","title":"\u4e1a\u7ee9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"100253","title":"\u8bfb\u4e66\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100254","title":"\u5956\u91d1\u8ba1\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100255","title":"\u529e\u516c\u5ba4\u996e\u6c34\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100256","title":"\u9ad8\u94c1\u9009\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"100257","title":"\u5730\u94c1\u7968","__typename":"AppliedTranslationNode"},{"questionId":"100258","title":"\u4ea4\u6362\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100259","title":"\u5355\u8bcd\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"100260","title":"\u4ea4\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100261","title":"\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100262","title":"\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100263","title":"SyM \u7684 \ud83d\udd11","__typename":"AppliedTranslationNode"},{"questionId":"100264","title":"\u5206\u82f9\u679c","__typename":"AppliedTranslationNode"},{"questionId":"100265","title":"qqqqqqqqqqqqqqqy \u7684\u70ed\u8eab\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100266","title":"\u5c0f\u80d6\u5b50\u7684\u65e5\u5e38","__typename":"AppliedTranslationNode"},{"questionId":"100267","title":"\u7406\u7425\u73c0\u73e0","__typename":"AppliedTranslationNode"},{"questionId":"100269","title":"\u72fc\u4eba\u6740\u6a21\u62df\u5668","__typename":"AppliedTranslationNode"},{"questionId":"100272","title":"\ud83d\udc2d\u5e74\u5feb\u4e50","__typename":"AppliedTranslationNode"},{"questionId":"100273","title":"\u7528\u4e24\u4e2a\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100274","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100275","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100276","title":"\u4e8c\u7ef4\u6570\u7ec4\u4e2d\u7684\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"100277","title":"\u9752\u86d9\u8df3\u53f0\u9636\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100278","title":"\u65cb\u8f6c\u6570\u7ec4\u7684\u6700\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100279","title":"\u77e9\u9635\u4e2d\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100280","title":"\u66ff\u6362\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"100281","title":"\u673a\u5668\u4eba\u7684\u8fd0\u52a8\u8303\u56f4","__typename":"AppliedTranslationNode"},{"questionId":"100282","title":"\u4ece\u5c3e\u5230\u5934\u6253\u5370\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100283","title":"\u91cd\u5efa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100284","title":"\u526a\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100285","title":"\u526a\u7ef3\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"100286","title":"\u5408\u5e76\u4e24\u4e2a\u6392\u5e8f\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100287","title":"\u6811\u7684\u5b50\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"100288","title":"\u4e8c\u53c9\u6811\u7684\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"100289","title":"\u5bf9\u79f0\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100290","title":"\u8868\u793a\u6570\u503c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100291","title":"\u8c03\u6574\u6570\u7ec4\u987a\u5e8f\u4f7f\u5947\u6570\u4f4d\u4e8e\u5076\u6570\u524d\u9762","__typename":"AppliedTranslationNode"},{"questionId":"100292","title":"\u4e8c\u8fdb\u5236\u4e2d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100293","title":"\u987a\u65f6\u9488\u6253\u5370\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100294","title":"\u94fe\u8868\u4e2d\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100295","title":"\u6570\u503c\u7684\u6574\u6570\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"100296","title":"\u6253\u5370\u4ece1\u5230\u6700\u5927\u7684n\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100297","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"100298","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100299","title":"\u5220\u9664\u94fe\u8868\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100300","title":"\u590d\u6742\u94fe\u8868\u7684\u590d\u5236","__typename":"AppliedTranslationNode"},{"questionId":"100301","title":"\u6700\u5c0f\u7684k\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100302","title":"\u5305\u542bmin\u51fd\u6570\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"100303","title":"\u6570\u636e\u6d41\u4e2d\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100304","title":"\u8fde\u7eed\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100305","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e0e\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100306","title":"\u6808\u7684\u538b\u5165\u3001\u5f39\u51fa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100307","title":"\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100308","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100309","title":"1\uff5en \u6574\u6570\u4e2d 1 \u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100310","title":"\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc7\u4e00\u534a\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100311","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100312","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"100313","title":"\u6570\u5b57\u5e8f\u5217\u4e2d\u67d0\u4e00\u4f4d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100314","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 III","__typename":"AppliedTranslationNode"},{"questionId":"100315","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u540e\u5e8f\u904d\u5386\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100316","title":"\u7b2c\u4e00\u4e2a\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"100317","title":"\u4e8c\u53c9\u6811\u4e2d\u548c\u4e3a\u67d0\u4e00\u503c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100318","title":"\u6570\u7ec4\u4e2d\u7684\u9006\u5e8f\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"100319","title":"\u4e8c\u53c9\u6811\u7684\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100320","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100321","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"100322","title":"\u548c\u4e3as\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100323","title":"\u628a\u6570\u7ec4\u6392\u6210\u6700\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100324","title":"\u548c\u4e3as\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100325","title":"\u628a\u6570\u5b57\u7ffb\u8bd1\u6210\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100326","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u516c\u5171\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100327","title":"\u793c\u7269\u7684\u6700\u5927\u4ef7\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100328","title":"\u7ffb\u8f6c\u5355\u8bcd\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100329","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u6570\u5b57 I","__typename":"AppliedTranslationNode"},{"questionId":"100330","title":"\u5de6\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100331","title":"0\uff5en-1\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100332","title":"\u6700\u957f\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100333","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u7b2ck\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100334","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100335","title":"\u4e0d\u7528\u52a0\u51cf\u4e58\u9664\u505a\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100336","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100337","title":"\u961f\u5217\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100338","title":"\u6784\u5efa\u4e58\u79ef\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100339","title":"n\u4e2a\u9ab0\u5b50\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100340","title":"\u628a\u5b57\u7b26\u4e32\u8f6c\u6362\u6210\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100341","title":"\u6251\u514b\u724c\u4e2d\u7684\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100342","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100343","title":"\u5706\u5708\u4e2d\u6700\u540e\u5269\u4e0b\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100344","title":"\u80a1\u7968\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"100345","title":"\u6c421+2+\u2026+n","__typename":"AppliedTranslationNode"},{"questionId":"100346","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100347","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100348","title":"\u6709\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100349","title":"\u6700\u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100350","title":"\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100351","title":"\u751f\u5b58\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100352","title":"\u8df3\u6c34\u677f","__typename":"AppliedTranslationNode"},{"questionId":"100353","title":"\u5e73\u5206\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"100354","title":"\u6700\u4f73\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100355","title":"\u73e0\u7391\u5999\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100356","title":"\u90e8\u5206\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000001","title":"test-1","__typename":"AppliedTranslationNode"},{"questionId":"1000002","title":"\u627e\u51fa\u9690\u85cf\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000003","title":"\u8fde\u7eed\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000004","title":"\u6a21\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000005","title":"\u6c34\u57df\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"1000006","title":"\u4e00\u6b21\u7f16\u8f91","__typename":"AppliedTranslationNode"},{"questionId":"1000007","title":"\u8fd4\u56de\u5012\u6570\u7b2c k \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000008","title":"\u5206\u5272\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000009","title":"\u6c42\u548c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000010","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000011","title":"\u8ff7\u8def\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000012","title":"\u5408\u5e76\u6392\u5e8f\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000013","title":"\u5cf0\u4e0e\u8c37","__typename":"AppliedTranslationNode"},{"questionId":"1000015","title":"\u6c49\u8bfa\u5854\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000016","title":"\u6392\u5e8f\u77e9\u9635\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"1000017","title":"\u9636\u4e58\u5c3e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000018","title":"\u6574\u6570\u7684\u82f1\u8bed\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"1000019","title":"BiNode","__typename":"AppliedTranslationNode"},{"questionId":"1000020","title":"\u6062\u590d\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1000021","title":"\u6700\u5c0fK\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000022","title":"\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000023","title":"\u6309\u6469\u5e08","__typename":"AppliedTranslationNode"},{"questionId":"1000024","title":"\u591a\u6b21\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"1000025","title":"\u4e0d\u7528\u52a0\u53f7\u7684\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000026","title":"LRU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000027","title":"\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000028","title":"\u8fde\u7eed\u4e2d\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000029","title":"\u76f4\u65b9\u56fe\u7684\u6c34\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000030","title":"\u5355\u8bcd\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1000031","title":"\u5e03\u5c14\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"1000032","title":"\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000033","title":" \u5b57\u6bcd\u4e0e\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000034","title":"2\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000035","title":"\u5a74\u513f\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000036","title":"\u9a6c\u620f\u56e2\u4eba\u5854","__typename":"AppliedTranslationNode"},{"questionId":"1000037","title":"\u7b2c k \u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000038","title":"\u4e3b\u8981\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1000039","title":"\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000040","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000041","title":"\u6570\u5b57\u6d41\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1000042","title":"\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000043","title":"\u6700\u77ed\u8d85\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000044","title":"\u6d88\u5931\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000045","title":"\u6700\u5927\u9ed1\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000046","title":"\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000047","title":"T9\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000048","title":"\u4ea4\u6362\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000049","title":"\u5355\u8bcd\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000050","title":"\u5170\u987f\u8682\u8681","__typename":"AppliedTranslationNode"},{"questionId":"1000051","title":"\u7a00\u758f\u76f8\u4f3c\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000055","title":"\u4e24\u6570\u4e4b\u548c II 3","__typename":"AppliedTranslationNode"},{"questionId":"1000056","title":"\u62ff\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1000057","title":"\u5267\u60c5\u89e6\u53d1\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000058","title":"\u9b54\u672f\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000059","title":"\u5207\u5206\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000060","title":"\u5377\u79ef\u795e\u7ecf\u7f51\u7edc","__typename":"AppliedTranslationNode"},{"questionId":"1000061","title":"\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000062","title":"\u4e8c\u53c9\u6811\u4efb\u52a1\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000063","title":"\u4f20\u9012\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000085","title":"\u6e38\u4e50\u56ed\u7684\u6e38\u89c8\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000086","title":"\u671f\u671b\u4e2a\u6570\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1000087","title":"\u5c0f\u5f20\u5237\u9898\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000088","title":"\u6e38\u4e50\u56ed\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000089","title":"\u4e8c\u53c9\u6811\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000090","title":"\u6700\u5c0f\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000091","title":"\u6700\u5c0f\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000092","title":"\u4f1a\u8bae\u9009\u5740","__typename":"AppliedTranslationNode"},{"questionId":"1000093","title":"\u5bfb\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000095","title":"\u6570\u5b66\u5174\u8da3\u601d\u8003\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000096","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000097","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u524d\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000098","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000099","title":"\u3010\u6807\u7a0b\u6709\u95ee\u9898\u3011\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000100","title":"\u6c42\u4e8c\u7ef4\u6570\u7ec4\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000101","title":"\u6dfb\u52a0\u6700\u5c11\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000102","title":"\u524d\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000103","title":"\u5224\u65ad\u4e8c\u53c9\u6811\u662f\u5426\u662f\u4e00\u4e2a\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000104","title":"\u5c06\u5806\u8f6c\u6362\u4e3a\u4e00\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000105","title":"\u67e5\u627e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000106","title":"\u6811\u4e0a\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1000107","title":"\u4e8c\u53c9\u6811\u4e0a\u4e24\u70b9\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000108","title":"\u5224\u65ad\u8fde\u901a\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000109","title":"\u6700\u5c11\u7684\u64cd\u4f5c\u4f7f\u5c0f\u9547\u5b58\u5728\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1000110","title":"\u6709\u5e8f\u6570\u7ec4\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000111","title":"\u4e8c\u53c9\u67e5\u627e\u6811\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"1000112","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u6700\u540e\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000114","title":"\u5b9e\u73b0\u52a8\u6001\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000115","title":"\u4e58\u79ef\u6700\u5927\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000116","title":"\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1000117","title":"\u6811\u4e0a\u6700\u63a5\u8fd1\u7684\u4e24\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000118","title":"\u7ea6\u745f\u592b\u73af\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000119","title":"\u8ba1\u7b97\u8282\u70b9\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000120","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000121","title":"\u6ed1\u52a8\u7a97\u53e3\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000122","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"1000123","title":"\u5408\u5e76 K \u4e2a\u6700\u5c0f\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000124","title":"\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000125","title":"\u7b80\u5355\u8ba1\u7b97\u5668 V","__typename":"AppliedTranslationNode"},{"questionId":"1000126","title":"\u627e\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570II","__typename":"AppliedTranslationNode"},{"questionId":"1000127","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"1000128","title":"hanhan \u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000129","title":"\u5957\u5708\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000130","title":"\u79cb\u53f6\u6536\u85cf\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000131","title":"\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000132","title":"\u5bfc\u822a\u88c5\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000133","title":"\u5feb\u901f\u516c\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1000134","title":"\u8ffd\u9010\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000135","title":"\u79ef\u5206\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000136","title":"\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000137","title":"\u5927\u6570\u6c42\u4f59","__typename":"AppliedTranslationNode"},{"questionId":"1000138","title":"\u53e4\u8463\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000139","title":"\u901f\u7b97\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000140","title":"\u9ed1\u767d\u65b9\u683c\u753b","__typename":"AppliedTranslationNode"},{"questionId":"1000141","title":"\u6392\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000142","title":"\u7334\u5b50\u6253\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000143","title":"\u5bb6\u65cf\u5173\u7cfb","__typename":"AppliedTranslationNode"},{"questionId":"1000144","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000145","title":"OCR\u8bc6\u522b","__typename":"AppliedTranslationNode"},{"questionId":"1000146","title":"\u65e9\u9910\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000147","title":"\u9ed1\u76d2\u5149\u7ebf\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1000148","title":"\u98de\u8239\u68cb\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000149","title":"\u5206\u5272\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1000150","title":"\u53e4\u8001\u7684\u6e38\u620f\u673a","__typename":"AppliedTranslationNode"},{"questionId":"1000151","title":"01 \u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000152","title":"\u6392\u5217\u5c0f\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1000153","title":"\u82f1\u6587\u5355\u8bcd\u62fc\u5199\u7ea0\u9519\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1000154","title":"\u9b54\u6cd5\u6743\u6756\u5f3a\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1000155","title":"\u706b\u8f66\u7f16\u7ec4\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000156","title":"\u6700\u4fbf\u5b9c\u7684\u673a\u7968","__typename":"AppliedTranslationNode"},{"questionId":"1000157","title":"\u5b85\u7537\u7684\u751f\u6d3b","__typename":"AppliedTranslationNode"},{"questionId":"1000158","title":"\u4ea4\u901a\u8f68\u8ff9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000159","title":"\u7834\u8bd1\u5bc6\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000160","title":"DIST","__typename":"AppliedTranslationNode"},{"questionId":"1000161","title":"Hilbert \u66f2\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000162","title":"\u9879\u76ee\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000163","title":"\u7b97\u5f0f\u8f6c\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1000164","title":"\u5730\u7816\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000166","title":"\u7b80\u5355\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000167","title":"\u591a\u6e90 D \u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000168","title":"\u5de5\u4eba\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000169","title":"\u4e00\u5143\u4e00\u6b21\u65b9\u7a0b\u6c42\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000170","title":"\u5783\u573e\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000171","title":"\u91cd\u590d\u5b57\u7b26\u4e32\u91cd\u547d\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000172","title":"\u5192\u6ce1\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000173","title":"\u627e\u51fa\u6700\u957f\u5b57\u7b26\u4e32\u5e76\u8f93\u51fa","__typename":"AppliedTranslationNode"},{"questionId":"1000174","title":"\u8ba1\u7b97\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000175","title":"\u63a5\u9a7e\u6700\u77ed\u8ddd\u79bb\u7b97\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000176","title":"\u51e0\u4f55\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"1000177","title":"\u5207\u5272\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000178","title":"\u5e8f\u5217\u79fb\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1000179","title":"\u8bf7\u5b9e\u73b0\u51fd\u6570 parseQueryString","__typename":"AppliedTranslationNode"},{"questionId":"1000181","title":"\u8bf7\u5b9e\u73b0\u4e0b\u9762\u7684\u94fe\u5f0f\u8c03\u7528\u51fd\u6570\uff0c\u4ee5\u4f7f\u5176\u80fd\u591f\u5b9e\u73b0\u94fe\u5f0f\u8c03\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1000182","title":"7. \u5316\u5b66\u516c\u5f0f\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000183","title":"3. \u53e4\u751f\u7269\u8840\u7f18\u8fdc\u8fd1\u5224\u5b9a","__typename":"AppliedTranslationNode"},{"questionId":"1000184","title":"10. \u6570\u7ec4\u7ec4\u6210\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000185","title":"16. \u6700\u77ed\u79fb\u52a8\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000186","title":"2. \u53d1\u4e0b\u5348\u8336","__typename":"AppliedTranslationNode"},{"questionId":"1000187","title":"4. \u673a\u5668\u4eba\u8df3\u8dc3\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000188","title":"6. \u590f\u5b63\u7279\u60e0","__typename":"AppliedTranslationNode"},{"questionId":"1000189","title":"\u5c0f\u7f8e\u7684\u7528\u6237\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000190","title":"\u5c0f\u7f8e\u7684\u4ed3\u5e93\u6574\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000191","title":"\u5c0f\u7f8e\u7684\u8dd1\u817f\u4ee3\u8d2d","__typename":"AppliedTranslationNode"},{"questionId":"1000192","title":"\u5c0f\u56e2\u7684\u590d\u5236\u7c98\u8d34","__typename":"AppliedTranslationNode"},{"questionId":"1000193","title":"\u5c0f\u7f8e\u7684\u533a\u57df\u4f1a\u8bae","__typename":"AppliedTranslationNode"},{"questionId":"1000194","title":"\u5c0f\u56e2\u7684\u795e\u79d8\u6697\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000195","title":"\u5c0f\u56e2\u7684\u9009\u8c03\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000196","title":"\u5c0f\u56e2\u65e0\u8def\u53ef\u9003","__typename":"AppliedTranslationNode"},{"questionId":"1000197","title":"\u5c0f\u56e2\u7684\u88c5\u9970\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1000198","title":"\u5c0f\u56e2\u7684\u9ed8\u5951\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000199","title":"\u642d\u914d\u51fa\u552e","__typename":"AppliedTranslationNode"},{"questionId":"1000200","title":"\u5c0f\u7f8e\u7684\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1000201","title":"\u504f\u7231\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000202","title":"\u5c0f\u56e2\u7684 AB \u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000203","title":"\u5341\u5b57\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1000204","title":"\u5b8c\u5168\u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000205","title":"\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000206","title":"5-sum","__typename":"AppliedTranslationNode"},{"questionId":"1000207","title":"\u5e8f\u5217\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000208","title":"\u7f16\u8f91\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"1000209","title":"\u6700\u591a\u7684\u786c\u5e01\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000210","title":"\u6700\u5c11\u7684\u786c\u5e01\u79cd\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000211","title":"\u5b50\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000212","title":"\u5b50\u4e32\u5305\u542b\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000213","title":"\u53d6\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000214","title":"\u6811\u7684\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000215","title":"\u91c7\u8d2d\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1000216","title":"\u4e50\u56e2\u7ad9\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1000217","title":"\u7279\u6b8a\u4e8c\u8fdb\u5236\u8868\u793a\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000218","title":"\u53d8\u6362\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000219","title":"\u6279\u91cf\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1000220","title":"\u7535\u52a8\u8f66\u6e38\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1000221","title":"\u84c4\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"1000222","title":"\u6700\u591a\u724c\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000223","title":"\u5b88\u536b\u57ce\u5821","__typename":"AppliedTranslationNode"},{"questionId":"1000224","title":"\u9b54\u5854\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000225","title":"\u4e0b\u8f7d\u63d2\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"1000226","title":"\u5b8c\u6210\u4e00\u534a\u9898\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000227","title":"\u4e3b\u9898\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000228","title":"\u6574\u6570\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000229","title":"\u5141\u8bb8\u91cd\u590d\u9009\u62e9\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000230","title":"\u524d n \u4e2a\u6570\u5b57\u4e8c\u8fdb\u5236\u4e2d 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000231","title":"\u4e8c\u8fdb\u5236\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000232","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000233","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 ","__typename":"AppliedTranslationNode"},{"questionId":"1000234","title":"\u6ca1\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000235","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217 ","__typename":"AppliedTranslationNode"},{"questionId":"1000236","title":"\u5355\u8bcd\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000237","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000238","title":"\u751f\u6210\u5339\u914d\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000239","title":"\u6570\u7ec4\u4e2d\u548c\u4e3a 0 \u7684\u4e09\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000240","title":"\u5206\u5272\u56de\u6587\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000241","title":"\u590d\u539f IP ","__typename":"AppliedTranslationNode"},{"questionId":"1000242","title":"\u548c\u5927\u4e8e\u7b49\u4e8e target \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000243","title":"\u722c\u697c\u68af\u7684\u6700\u5c11\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1000244","title":"\u4e58\u79ef\u5c0f\u4e8e K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000245","title":"\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000246","title":"\u548c\u4e3a k \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000247","title":"0 \u548c 1 \u4e2a\u6570\u76f8\u540c\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000248","title":"\u5de6\u53f3\u4e24\u8fb9\u5b50\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1000249","title":"\u4e8c\u7ef4\u5b50\u77e9\u9635\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000250","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000251","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000252","title":"\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000253","title":"\u542b\u6709\u6240\u6709\u5b57\u7b26\u7684\u6700\u77ed\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000254","title":"\u6709\u6548\u7684\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000255","title":"\u6700\u591a\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u5f97\u5230\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000256","title":"\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000257","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c n \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000258","title":"\u94fe\u8868\u4e2d\u73af\u7684\u5165\u53e3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000259","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u91cd\u5408\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000260","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000261","title":"\u94fe\u8868\u4e2d\u7684\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1000262","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000263","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000264","title":"\u5c55\u5e73\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000265","title":"\u6392\u5e8f\u7684\u5faa\u73af\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000266","title":"\u73af\u5f62\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000267","title":"\u63d2\u5165\u3001\u5220\u9664\u548c\u968f\u673a\u8bbf\u95ee\u90fd\u662f O(1) \u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000268","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1000269","title":"\u7ffb\u8f6c\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1000270","title":"\u6700\u8fd1\u6700\u5c11\u4f7f\u7528\u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000271","title":"\u6700\u957f\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000272","title":"\u6700\u5c11\u56de\u6587\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"1000273","title":"\u6709\u6548\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000274","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000275","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000276","title":"\u5916\u661f\u8bed\u8a00\u662f\u5426\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000277","title":"\u5b57\u7b26\u4e32\u4ea4\u7ec7","__typename":"AppliedTranslationNode"},{"questionId":"1000278","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000279","title":"\u540e\u7f00\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1000280","title":"\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000281","title":"\u5c0f\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"1000282","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000283","title":"\u76f4\u65b9\u56fe\u6700\u5927\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000284","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1000285","title":"\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000286","title":"\u4e09\u89d2\u5f62\u4e2d\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000287","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000288","title":"\u52a0\u51cf\u7684\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000289","title":"\u6700\u5c11\u7684\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000290","title":"\u6392\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000291","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000292","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000293","title":"\u6700\u8fd1\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000294","title":"\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000295","title":"\u5f80\u5b8c\u5168\u4e8c\u53c9\u6811\u6dfb\u52a0\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000296","title":"\u77e9\u9635\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000297","title":"\u4e8c\u53c9\u6811\u6bcf\u5c42\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000298","title":"\u4e8c\u53c9\u6811\u6700\u5e95\u5c42\u6700\u5de6\u8fb9\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000299","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u4fa7\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000300","title":"\u5355\u8bcd\u6f14\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"1000301","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"1000302","title":"\u5f00\u5bc6\u7801\u9501","__typename":"AppliedTranslationNode"},{"questionId":"1000303","title":"\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000304","title":"\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000305","title":"\u8ba1\u7b97\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000306","title":"\u4ece\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u7684\u8def\u5f84\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000307","title":"\u5411\u4e0b\u7684\u8def\u5f84\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000308","title":"\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000309","title":"\u8282\u70b9\u4e4b\u548c\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000310","title":"\u8bfe\u7a0b\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000311","title":"\u5c55\u5e73\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000312","title":"\u5916\u661f\u6587\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000313","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"1000314","title":"\u91cd\u5efa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000315","title":"\u6240\u6709\u5927\u4e8e\u7b49\u4e8e\u8282\u70b9\u7684\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000316","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000317","title":"\u76f8\u4f3c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000318","title":"\u591a\u4f59\u7684\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1000319","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u4e24\u4e2a\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000320","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000321","title":"\u503c\u548c\u4e0b\u6807\u4e4b\u5dee\u90fd\u5728\u7ed9\u5b9a\u7684\u8303\u56f4\u5185","__typename":"AppliedTranslationNode"},{"questionId":"1000322","title":"\u65e5\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000323","title":"\u6570\u636e\u6d41\u7684\u7b2c K \u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000324","title":"\u51fa\u73b0\u9891\u7387\u6700\u9ad8\u7684 k \u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000325","title":"\u5b9e\u73b0\u524d\u7f00\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000326","title":"\u548c\u6700\u5c0f\u7684 k \u4e2a\u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1000327","title":"\u66ff\u6362\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000328","title":"\u795e\u5947\u7684\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000329","title":"\u6700\u77ed\u7684\u5355\u8bcd\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000330","title":"\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000331","title":"\u6700\u5927\u7684\u5f02\u6216","__typename":"AppliedTranslationNode"},{"questionId":"1000332","title":"\u67e5\u627e\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000333","title":"\u5c71\u5cf0\u6570\u7ec4\u7684\u9876\u90e8","__typename":"AppliedTranslationNode"},{"questionId":"1000334","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000335","title":"\u6309\u6743\u91cd\u751f\u6210\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000336","title":"\u6c42\u5e73\u65b9\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000337","title":"\u72d2\u72d2\u5403\u9999\u8549","__typename":"AppliedTranslationNode"},{"questionId":"1000338","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000339","title":"\u6570\u7ec4\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000340","title":"\u6570\u7ec4\u4e2d\u7684\u7b2c k \u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000341","title":"\u94fe\u8868\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000342","title":"\u5408\u5e76\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000343","title":"\u6240\u6709\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000344","title":"\u542b\u6709 k \u4e2a\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000345","title":"\u8def\u5f84\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000346","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000347","title":"\u8f66\u961f\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000348","title":"\u8f66\u8f86\u5b89\u6392","__typename":"AppliedTranslationNode"},{"questionId":"1000349","title":"\u8def\u5f84\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000350","title":"\u8c01\u6321\u4f4f\u4e86\u6211\u7684\u7ea2\u7eff\u706f","__typename":"AppliedTranslationNode"},{"questionId":"1000351","title":"\u65b0\u589e\u7684\u4e13\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000352","title":"\u6700\u5927\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000353","title":"\u5f55\u53d6\u5206\u6570\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000354","title":"\u8c03\u6574\u7535\u5e73","__typename":"AppliedTranslationNode"},{"questionId":"1000355","title":"\u7b7e\u5230\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000356","title":"\u81ea\u884c\u8f66\u62c9\u529b\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"1000358","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000359","title":"\u73af\u5f62\u95ef\u5173\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000360","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000361","title":"\u5165\u573a\u5b89\u68c0","__typename":"AppliedTranslationNode"},{"questionId":"1000362","title":"\u5f00\u5e55\u5f0f\u7130\u706b","__typename":"AppliedTranslationNode"},{"questionId":"1000363","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000364","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000367","title":"\u5341\u5b57\u8def\u53e3\u7684\u4ea4\u901a","__typename":"AppliedTranslationNode"},{"questionId":"1000368","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000369","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000370","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000371","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000373","title":"\u5fd7\u613f\u8005\u8c03\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000374","title":"\u65e0\u9650\u68cb\u5c40","__typename":"AppliedTranslationNode"},{"questionId":"1000375","title":"\u81ea\u884c\u8f66\u70ab\u6280\u8d5b\u573a","__typename":"AppliedTranslationNode"},{"questionId":"1000378","title":"\u95f4\u9694\u5220\u9664\u94fe\u8868\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000379","title":"\u5730\u94c1\u8def\u7ebf\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000382","title":"\u67f1\u72b6\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000383","title":"\u7535\u5b66\u5b9e\u9a8c\u8bfe","__typename":"AppliedTranslationNode"}]}} \ No newline at end of file +{"data":{"translations":[{"questionId":"1","title":"\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2","title":"\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"3","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"4","title":"\u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"5","title":"\u6700\u957f\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"6","title":"Z \u5b57\u5f62\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"7","title":"\u6574\u6570\u53cd\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"8","title":"\u5b57\u7b26\u4e32\u8f6c\u6362\u6574\u6570 (atoi)","__typename":"AppliedTranslationNode"},{"questionId":"9","title":"\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"10","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"11","title":"\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"12","title":"\u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"13","title":"\u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"14","title":"\u6700\u957f\u516c\u5171\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"15","title":"\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"16","title":"\u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"17","title":"\u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"18","title":"\u56db\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"19","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c N \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"20","title":"\u6709\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"21","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"22","title":"\u62ec\u53f7\u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"23","title":"\u5408\u5e76K\u4e2a\u5347\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"24","title":"\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"25","title":"K \u4e2a\u4e00\u7ec4\u7ffb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"26","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"27","title":"\u79fb\u9664\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"28","title":"\u5b9e\u73b0 strStr()","__typename":"AppliedTranslationNode"},{"questionId":"29","title":"\u4e24\u6570\u76f8\u9664","__typename":"AppliedTranslationNode"},{"questionId":"30","title":"\u4e32\u8054\u6240\u6709\u5355\u8bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"31","title":"\u4e0b\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"32","title":"\u6700\u957f\u6709\u6548\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"33","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"34","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"35","title":"\u641c\u7d22\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"36","title":"\u6709\u6548\u7684\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"37","title":"\u89e3\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"38","title":"\u5916\u89c2\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"39","title":"\u7ec4\u5408\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"40","title":"\u7ec4\u5408\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"41","title":"\u7f3a\u5931\u7684\u7b2c\u4e00\u4e2a\u6b63\u6570","__typename":"AppliedTranslationNode"},{"questionId":"42","title":"\u63a5\u96e8\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"43","title":"\u5b57\u7b26\u4e32\u76f8\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"44","title":"\u901a\u914d\u7b26\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"45","title":"\u8df3\u8dc3\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"46","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"47","title":"\u5168\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"48","title":"\u65cb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"49","title":"\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"50","title":"Pow(x, n)","__typename":"AppliedTranslationNode"},{"questionId":"51","title":"N \u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"52","title":"N\u7687\u540e II","__typename":"AppliedTranslationNode"},{"questionId":"53","title":"\u6700\u5927\u5b50\u5e8f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"54","title":"\u87ba\u65cb\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"55","title":"\u8df3\u8dc3\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"56","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"57","title":"\u63d2\u5165\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"58","title":"\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"59","title":"\u87ba\u65cb\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"60","title":"\u6392\u5217\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"61","title":"\u65cb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"62","title":"\u4e0d\u540c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"63","title":"\u4e0d\u540c\u8def\u5f84 II","__typename":"AppliedTranslationNode"},{"questionId":"64","title":"\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"65","title":"\u6709\u6548\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"66","title":"\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"67","title":"\u4e8c\u8fdb\u5236\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"68","title":"\u6587\u672c\u5de6\u53f3\u5bf9\u9f50","__typename":"AppliedTranslationNode"},{"questionId":"69","title":"Sqrt(x)","__typename":"AppliedTranslationNode"},{"questionId":"70","title":"\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"71","title":"\u7b80\u5316\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"72","title":"\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"73","title":"\u77e9\u9635\u7f6e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"74","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"75","title":"\u989c\u8272\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"76","title":"\u6700\u5c0f\u8986\u76d6\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"77","title":"\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"78","title":"\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"79","title":"\u5355\u8bcd\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"80","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"81","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"82","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"83","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"84","title":"\u67f1\u72b6\u56fe\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"85","title":"\u6700\u5927\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"86","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"87","title":"\u6270\u4e71\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"88","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"89","title":"\u683c\u96f7\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"90","title":"\u5b50\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"91","title":"\u89e3\u7801\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"92","title":"\u53cd\u8f6c\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"93","title":"\u590d\u539f IP \u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"94","title":"\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"95","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"96","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"97","title":"\u4ea4\u9519\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"98","title":"\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"99","title":"\u6062\u590d\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100","title":"\u76f8\u540c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"101","title":"\u5bf9\u79f0\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"102","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"103","title":"\u4e8c\u53c9\u6811\u7684\u952f\u9f7f\u5f62\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"104","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"105","title":"\u4ece\u524d\u5e8f\u4e0e\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"106","title":"\u4ece\u4e2d\u5e8f\u4e0e\u540e\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"107","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"108","title":"\u5c06\u6709\u5e8f\u6570\u7ec4\u8f6c\u6362\u4e3a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"109","title":"\u6709\u5e8f\u94fe\u8868\u8f6c\u6362\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"110","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"111","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"112","title":"\u8def\u5f84\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"113","title":"\u8def\u5f84\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"114","title":"\u4e8c\u53c9\u6811\u5c55\u5f00\u4e3a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"115","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"116","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488","__typename":"AppliedTranslationNode"},{"questionId":"117","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488 II","__typename":"AppliedTranslationNode"},{"questionId":"118","title":"\u6768\u8f89\u4e09\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"119","title":"\u6768\u8f89\u4e09\u89d2 II","__typename":"AppliedTranslationNode"},{"questionId":"120","title":"\u4e09\u89d2\u5f62\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"121","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a","__typename":"AppliedTranslationNode"},{"questionId":"122","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"123","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a III","__typename":"AppliedTranslationNode"},{"questionId":"124","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u5927\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"125","title":"\u9a8c\u8bc1\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"126","title":"\u5355\u8bcd\u63a5\u9f99 II","__typename":"AppliedTranslationNode"},{"questionId":"127","title":"\u5355\u8bcd\u63a5\u9f99","__typename":"AppliedTranslationNode"},{"questionId":"128","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"129","title":"\u6c42\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"130","title":"\u88ab\u56f4\u7ed5\u7684\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"131","title":"\u5206\u5272\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"132","title":"\u5206\u5272\u56de\u6587\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"133","title":"\u514b\u9686\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"134","title":"\u52a0\u6cb9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"135","title":"\u5206\u53d1\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"136","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"137","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 II","__typename":"AppliedTranslationNode"},{"questionId":"138","title":"\u590d\u5236\u5e26\u968f\u673a\u6307\u9488\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"139","title":"\u5355\u8bcd\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"140","title":"\u5355\u8bcd\u62c6\u5206 II","__typename":"AppliedTranslationNode"},{"questionId":"141","title":"\u73af\u5f62\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"142","title":"\u73af\u5f62\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"143","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"144","title":"\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"145","title":"\u4e8c\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"146","title":"LRU \u7f13\u5b58\u673a\u5236","__typename":"AppliedTranslationNode"},{"questionId":"147","title":"\u5bf9\u94fe\u8868\u8fdb\u884c\u63d2\u5165\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"148","title":"\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"149","title":"\u76f4\u7ebf\u4e0a\u6700\u591a\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"150","title":"\u9006\u6ce2\u5170\u8868\u8fbe\u5f0f\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"151","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"152","title":"\u4e58\u79ef\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"153","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"154","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"155","title":"\u6700\u5c0f\u6808","__typename":"AppliedTranslationNode"},{"questionId":"156","title":"\u4e0a\u4e0b\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"157","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"158","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26 II","__typename":"AppliedTranslationNode"},{"questionId":"159","title":"\u81f3\u591a\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"160","title":"\u76f8\u4ea4\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"161","title":"\u76f8\u9694\u4e3a 1 \u7684\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"162","title":"\u5bfb\u627e\u5cf0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"163","title":"\u7f3a\u5931\u7684\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"164","title":"\u6700\u5927\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"165","title":"\u6bd4\u8f83\u7248\u672c\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"166","title":"\u5206\u6570\u5230\u5c0f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"167","title":"\u4e24\u6570\u4e4b\u548c II - \u8f93\u5165\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"168","title":"Excel\u8868\u5217\u540d\u79f0","__typename":"AppliedTranslationNode"},{"questionId":"169","title":"\u591a\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"170","title":"\u4e24\u6570\u4e4b\u548c III - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"171","title":"Excel \u8868\u5217\u5e8f\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"172","title":"\u9636\u4e58\u540e\u7684\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"173","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"174","title":"\u5730\u4e0b\u57ce\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"175","title":"\u7ec4\u5408\u4e24\u4e2a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"176","title":"\u7b2c\u4e8c\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"177","title":"\u7b2cN\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"178","title":"\u5206\u6570\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"179","title":"\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"180","title":"\u8fde\u7eed\u51fa\u73b0\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"181","title":"\u8d85\u8fc7\u7ecf\u7406\u6536\u5165\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"182","title":"\u67e5\u627e\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"183","title":"\u4ece\u4e0d\u8ba2\u8d2d\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"184","title":"\u90e8\u95e8\u5de5\u8d44\u6700\u9ad8\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"185","title":"\u90e8\u95e8\u5de5\u8d44\u524d\u4e09\u9ad8\u7684\u6240\u6709\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"186","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd II","__typename":"AppliedTranslationNode"},{"questionId":"187","title":"\u91cd\u590d\u7684DNA\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"188","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a IV","__typename":"AppliedTranslationNode"},{"questionId":"189","title":"\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"190","title":"\u98a0\u5012\u4e8c\u8fdb\u5236\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"191","title":"\u4f4d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"192","title":"\u7edf\u8ba1\u8bcd\u9891","__typename":"AppliedTranslationNode"},{"questionId":"193","title":"\u6709\u6548\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"194","title":"\u8f6c\u7f6e\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"195","title":"\u7b2c\u5341\u884c","__typename":"AppliedTranslationNode"},{"questionId":"196","title":"\u5220\u9664\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"197","title":"\u4e0a\u5347\u7684\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"198","title":"\u6253\u5bb6\u52ab\u820d","__typename":"AppliedTranslationNode"},{"questionId":"199","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"200","title":"\u5c9b\u5c7f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"201","title":"\u6570\u5b57\u8303\u56f4\u6309\u4f4d\u4e0e","__typename":"AppliedTranslationNode"},{"questionId":"202","title":"\u5feb\u4e50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"203","title":"\u79fb\u9664\u94fe\u8868\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"204","title":"\u8ba1\u6570\u8d28\u6570","__typename":"AppliedTranslationNode"},{"questionId":"205","title":"\u540c\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"206","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"207","title":"\u8bfe\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"208","title":"\u5b9e\u73b0 Trie (\u524d\u7f00\u6811)","__typename":"AppliedTranslationNode"},{"questionId":"209","title":"\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"210","title":"\u8bfe\u7a0b\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"211","title":"\u6dfb\u52a0\u4e0e\u641c\u7d22\u5355\u8bcd - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"212","title":"\u5355\u8bcd\u641c\u7d22 II","__typename":"AppliedTranslationNode"},{"questionId":"213","title":"\u6253\u5bb6\u52ab\u820d II","__typename":"AppliedTranslationNode"},{"questionId":"214","title":"\u6700\u77ed\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"215","title":"\u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"216","title":"\u7ec4\u5408\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"217","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"218","title":"\u5929\u9645\u7ebf\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"219","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"220","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"221","title":"\u6700\u5927\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"222","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"223","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"224","title":"\u57fa\u672c\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"225","title":"\u7528\u961f\u5217\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"226","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"227","title":"\u57fa\u672c\u8ba1\u7b97\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"228","title":"\u6c47\u603b\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"229","title":"\u6c42\u4f17\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"230","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"231","title":"2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"232","title":"\u7528\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"233","title":"\u6570\u5b57 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"234","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"235","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"236","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"237","title":"\u5220\u9664\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"238","title":"\u9664\u81ea\u8eab\u4ee5\u5916\u6570\u7ec4\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"239","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"240","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"241","title":"\u4e3a\u8fd0\u7b97\u8868\u8fbe\u5f0f\u8bbe\u8ba1\u4f18\u5148\u7ea7","__typename":"AppliedTranslationNode"},{"questionId":"242","title":"\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"243","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"244","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"245","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb III","__typename":"AppliedTranslationNode"},{"questionId":"246","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"247","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"248","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"249","title":"\u79fb\u4f4d\u5b57\u7b26\u4e32\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"250","title":"\u7edf\u8ba1\u540c\u503c\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"251","title":"\u5c55\u5f00\u4e8c\u7ef4\u5411\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"252","title":"\u4f1a\u8bae\u5ba4","__typename":"AppliedTranslationNode"},{"questionId":"253","title":"\u4f1a\u8bae\u5ba4 II","__typename":"AppliedTranslationNode"},{"questionId":"254","title":"\u56e0\u5b50\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"255","title":"\u9a8c\u8bc1\u524d\u5e8f\u904d\u5386\u5e8f\u5217\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"256","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"257","title":"\u4e8c\u53c9\u6811\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"258","title":"\u5404\u4f4d\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"259","title":"\u8f83\u5c0f\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"260","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 III","__typename":"AppliedTranslationNode"},{"questionId":"261","title":"\u4ee5\u56fe\u5224\u6811","__typename":"AppliedTranslationNode"},{"questionId":"262","title":"\u884c\u7a0b\u548c\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"263","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"264","title":"\u4e11\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"265","title":"\u7c89\u5237\u623f\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"266","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"267","title":"\u56de\u6587\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"268","title":"\u4e22\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"269","title":"\u706b\u661f\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"270","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c","__typename":"AppliedTranslationNode"},{"questionId":"271","title":"\u5b57\u7b26\u4e32\u7684\u7f16\u7801\u4e0e\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"272","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"273","title":"\u6574\u6570\u8f6c\u6362\u82f1\u6587\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"274","title":"H \u6307\u6570","__typename":"AppliedTranslationNode"},{"questionId":"275","title":"H \u6307\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"276","title":"\u6805\u680f\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"277","title":"\u641c\u5bfb\u540d\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"278","title":"\u7b2c\u4e00\u4e2a\u9519\u8bef\u7684\u7248\u672c","__typename":"AppliedTranslationNode"},{"questionId":"279","title":"\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"280","title":"\u6446\u52a8\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"281","title":"\u952f\u9f7f\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"282","title":"\u7ed9\u8868\u8fbe\u5f0f\u6dfb\u52a0\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"283","title":"\u79fb\u52a8\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"284","title":"\u9876\u7aef\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"285","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"286","title":"\u5899\u4e0e\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"287","title":"\u5bfb\u627e\u91cd\u590d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"288","title":"\u5355\u8bcd\u7684\u552f\u4e00\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"289","title":"\u751f\u547d\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"290","title":"\u5355\u8bcd\u89c4\u5f8b","__typename":"AppliedTranslationNode"},{"questionId":"291","title":"\u5355\u8bcd\u89c4\u5f8b II","__typename":"AppliedTranslationNode"},{"questionId":"292","title":"Nim \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"293","title":"\u7ffb\u8f6c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"294","title":"\u7ffb\u8f6c\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"295","title":"\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"296","title":"\u6700\u4f73\u7684\u78b0\u5934\u5730\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"297","title":"\u4e8c\u53c9\u6811\u7684\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"298","title":"\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"299","title":"\u731c\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"300","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"301","title":"\u5220\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"302","title":"\u5305\u542b\u5168\u90e8\u9ed1\u8272\u50cf\u7d20\u7684\u6700\u5c0f\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"303","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"304","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"305","title":"\u5c9b\u5c7f\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"306","title":"\u7d2f\u52a0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"307","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u53ef\u4fee\u6539","__typename":"AppliedTranslationNode"},{"questionId":"308","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"309","title":"\u6700\u4f73\u4e70\u5356\u80a1\u7968\u65f6\u673a\u542b\u51b7\u51bb\u671f","__typename":"AppliedTranslationNode"},{"questionId":"310","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"311","title":"\u7a00\u758f\u77e9\u9635\u7684\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"312","title":"\u6233\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"313","title":"\u8d85\u7ea7\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"314","title":"\u4e8c\u53c9\u6811\u7684\u5782\u76f4\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"315","title":"\u8ba1\u7b97\u53f3\u4fa7\u5c0f\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"316","title":"\u53bb\u9664\u91cd\u590d\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"317","title":"\u79bb\u5efa\u7b51\u7269\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"318","title":"\u6700\u5927\u5355\u8bcd\u957f\u5ea6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"319","title":"\u706f\u6ce1\u5f00\u5173","__typename":"AppliedTranslationNode"},{"questionId":"320","title":"\u5217\u4e3e\u5355\u8bcd\u7684\u5168\u90e8\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"321","title":"\u62fc\u63a5\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"322","title":"\u96f6\u94b1\u5151\u6362","__typename":"AppliedTranslationNode"},{"questionId":"323","title":"\u65e0\u5411\u56fe\u4e2d\u8fde\u901a\u5206\u91cf\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"324","title":"\u6446\u52a8\u6392\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"325","title":"\u548c\u7b49\u4e8e k \u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"326","title":"3\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"327","title":"\u533a\u95f4\u548c\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"328","title":"\u5947\u5076\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"329","title":"\u77e9\u9635\u4e2d\u7684\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"330","title":"\u6309\u8981\u6c42\u8865\u9f50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"331","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"332","title":"\u91cd\u65b0\u5b89\u6392\u884c\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"333","title":"\u6700\u5927 BST \u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"334","title":"\u9012\u589e\u7684\u4e09\u5143\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"335","title":"\u8def\u5f84\u4ea4\u53c9","__typename":"AppliedTranslationNode"},{"questionId":"336","title":"\u56de\u6587\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"337","title":"\u6253\u5bb6\u52ab\u820d III","__typename":"AppliedTranslationNode"},{"questionId":"338","title":"\u6bd4\u7279\u4f4d\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"339","title":"\u5d4c\u5957\u5217\u8868\u6743\u91cd\u548c","__typename":"AppliedTranslationNode"},{"questionId":"340","title":"\u81f3\u591a\u5305\u542b K \u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"341","title":"\u6241\u5e73\u5316\u5d4c\u5957\u5217\u8868\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"342","title":"4\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"343","title":"\u6574\u6570\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"344","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"345","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"346","title":"\u6570\u636e\u6d41\u4e2d\u7684\u79fb\u52a8\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"347","title":"\u524d K \u4e2a\u9ad8\u9891\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"348","title":"\u8bbe\u8ba1\u4e95\u5b57\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"349","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"350","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"351","title":"\u5b89\u5353\u7cfb\u7edf\u624b\u52bf\u89e3\u9501","__typename":"AppliedTranslationNode"},{"questionId":"352","title":"\u5c06\u6570\u636e\u6d41\u53d8\u4e3a\u591a\u4e2a\u4e0d\u76f8\u4ea4\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"353","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"354","title":"\u4fc4\u7f57\u65af\u5957\u5a03\u4fe1\u5c01\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"355","title":"\u8bbe\u8ba1\u63a8\u7279","__typename":"AppliedTranslationNode"},{"questionId":"356","title":"\u76f4\u7ebf\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"357","title":"\u8ba1\u7b97\u5404\u4e2a\u4f4d\u6570\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"358","title":"K \u8ddd\u79bb\u95f4\u9694\u91cd\u6392\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"359","title":"\u65e5\u5fd7\u901f\u7387\u9650\u5236\u5668","__typename":"AppliedTranslationNode"},{"questionId":"360","title":"\u6709\u5e8f\u8f6c\u5316\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"361","title":"\u8f70\u70b8\u654c\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"362","title":"\u6572\u51fb\u8ba1\u6570\u5668","__typename":"AppliedTranslationNode"},{"questionId":"363","title":"\u77e9\u5f62\u533a\u57df\u4e0d\u8d85\u8fc7 K \u7684\u6700\u5927\u6570\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"364","title":"\u52a0\u6743\u5d4c\u5957\u5e8f\u5217\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"365","title":"\u6c34\u58f6\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"366","title":"\u5bfb\u627e\u4e8c\u53c9\u6811\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"367","title":"\u6709\u6548\u7684\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"368","title":"\u6700\u5927\u6574\u9664\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"369","title":"\u7ed9\u5355\u94fe\u8868\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"370","title":"\u533a\u95f4\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"371","title":"\u4e24\u6574\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"372","title":"\u8d85\u7ea7\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"373","title":"\u67e5\u627e\u548c\u6700\u5c0f\u7684K\u5bf9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"374","title":"\u731c\u6570\u5b57\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"375","title":"\u731c\u6570\u5b57\u5927\u5c0f II","__typename":"AppliedTranslationNode"},{"questionId":"376","title":"\u6446\u52a8\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"377","title":"\u7ec4\u5408\u603b\u548c \u2163","__typename":"AppliedTranslationNode"},{"questionId":"378","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"379","title":"\u7535\u8bdd\u76ee\u5f55\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"380","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"381","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20 - \u5141\u8bb8\u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"382","title":"\u94fe\u8868\u968f\u673a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"383","title":"\u8d4e\u91d1\u4fe1","__typename":"AppliedTranslationNode"},{"questionId":"384","title":"\u6253\u4e71\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"385","title":"\u8ff7\u4f60\u8bed\u6cd5\u5206\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"386","title":"\u5b57\u5178\u5e8f\u6392\u6570","__typename":"AppliedTranslationNode"},{"questionId":"387","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c\u4e00\u4e2a\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"388","title":"\u6587\u4ef6\u7684\u6700\u957f\u7edd\u5bf9\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"389","title":"\u627e\u4e0d\u540c","__typename":"AppliedTranslationNode"},{"questionId":"390","title":"\u6d88\u9664\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"391","title":"\u5b8c\u7f8e\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"392","title":"\u5224\u65ad\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"393","title":"UTF-8 \u7f16\u7801\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"394","title":"\u5b57\u7b26\u4e32\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"395","title":"\u81f3\u5c11\u6709 K \u4e2a\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"396","title":"\u65cb\u8f6c\u51fd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"397","title":"\u6574\u6570\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"398","title":"\u968f\u673a\u6570\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"399","title":"\u9664\u6cd5\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"400","title":"\u7b2c N \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"401","title":"\u4e8c\u8fdb\u5236\u624b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"402","title":"\u79fb\u6389 K \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"403","title":"\u9752\u86d9\u8fc7\u6cb3","__typename":"AppliedTranslationNode"},{"questionId":"404","title":"\u5de6\u53f6\u5b50\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"405","title":"\u6570\u5b57\u8f6c\u6362\u4e3a\u5341\u516d\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"406","title":"\u6839\u636e\u8eab\u9ad8\u91cd\u5efa\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"407","title":"\u63a5\u96e8\u6c34 II","__typename":"AppliedTranslationNode"},{"questionId":"408","title":"\u6709\u6548\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"409","title":"\u6700\u957f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"410","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"411","title":"\u6700\u77ed\u72ec\u5360\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"412","title":"Fizz Buzz","__typename":"AppliedTranslationNode"},{"questionId":"413","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"414","title":"\u7b2c\u4e09\u5927\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"415","title":"\u5b57\u7b26\u4e32\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"416","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"417","title":"\u592a\u5e73\u6d0b\u5927\u897f\u6d0b\u6c34\u6d41\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"418","title":"\u5c4f\u5e55\u53ef\u663e\u793a\u53e5\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"419","title":"\u7532\u677f\u4e0a\u7684\u6218\u8230","__typename":"AppliedTranslationNode"},{"questionId":"420","title":"\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668","__typename":"AppliedTranslationNode"},{"questionId":"421","title":"\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"422","title":"\u6709\u6548\u7684\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"423","title":"\u4ece\u82f1\u6587\u4e2d\u91cd\u5efa\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"424","title":"\u66ff\u6362\u540e\u7684\u6700\u957f\u91cd\u590d\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"425","title":"\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"432","title":"\u5168 O(1) \u7684\u6570\u636e\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"433","title":"\u6700\u5c0f\u57fa\u56e0\u53d8\u5316","__typename":"AppliedTranslationNode"},{"questionId":"434","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"435","title":"\u65e0\u91cd\u53e0\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"436","title":"\u5bfb\u627e\u53f3\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"437","title":"\u8def\u5f84\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"438","title":"\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"439","title":"\u4e09\u5143\u8868\u8fbe\u5f0f\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"440","title":"\u5b57\u5178\u5e8f\u7684\u7b2cK\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"441","title":"\u6392\u5217\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"442","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"443","title":"\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"444","title":"\u5e8f\u5217\u91cd\u5efa","__typename":"AppliedTranslationNode"},{"questionId":"445","title":"\u4e24\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"446","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206 II - \u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"447","title":"\u56de\u65cb\u9556\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"448","title":"\u627e\u5230\u6240\u6709\u6570\u7ec4\u4e2d\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"449","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"450","title":"\u5220\u9664\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"451","title":"\u6839\u636e\u5b57\u7b26\u51fa\u73b0\u9891\u7387\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"452","title":"\u7528\u6700\u5c11\u6570\u91cf\u7684\u7bad\u5f15\u7206\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"453","title":"\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"454","title":"\u56db\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"455","title":"\u5206\u53d1\u997c\u5e72","__typename":"AppliedTranslationNode"},{"questionId":"456","title":"132 \u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"457","title":"\u73af\u5f62\u6570\u7ec4\u662f\u5426\u5b58\u5728\u5faa\u73af","__typename":"AppliedTranslationNode"},{"questionId":"458","title":"\u53ef\u601c\u7684\u5c0f\u732a","__typename":"AppliedTranslationNode"},{"questionId":"459","title":"\u91cd\u590d\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"460","title":"LFU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"461","title":"\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"462","title":"\u6700\u5c11\u79fb\u52a8\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49 II","__typename":"AppliedTranslationNode"},{"questionId":"463","title":"\u5c9b\u5c7f\u7684\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"464","title":"\u6211\u80fd\u8d62\u5417","__typename":"AppliedTranslationNode"},{"questionId":"465","title":"\u6700\u4f18\u8d26\u5355\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"466","title":"\u7edf\u8ba1\u91cd\u590d\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"467","title":"\u73af\u7ed5\u5b57\u7b26\u4e32\u4e2d\u552f\u4e00\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"468","title":"\u9a8c\u8bc1IP\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"469","title":"\u51f8\u591a\u8fb9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"471","title":"\u7f16\u7801\u6700\u77ed\u957f\u5ea6\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"472","title":"\u8fde\u63a5\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"473","title":"\u706b\u67f4\u62fc\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"474","title":"\u4e00\u548c\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"475","title":"\u4f9b\u6696\u5668","__typename":"AppliedTranslationNode"},{"questionId":"476","title":"\u6570\u5b57\u7684\u8865\u6570","__typename":"AppliedTranslationNode"},{"questionId":"477","title":"\u6c49\u660e\u8ddd\u79bb\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"479","title":"\u6700\u5927\u56de\u6587\u6570\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"480","title":"\u6ed1\u52a8\u7a97\u53e3\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"481","title":"\u795e\u5947\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"482","title":"\u5bc6\u94a5\u683c\u5f0f\u5316","__typename":"AppliedTranslationNode"},{"questionId":"483","title":"\u6700\u5c0f\u597d\u8fdb\u5236","__typename":"AppliedTranslationNode"},{"questionId":"484","title":"\u5bfb\u627e\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"485","title":"\u6700\u5927\u8fde\u7eed 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"486","title":"\u9884\u6d4b\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"487","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"488","title":"\u7956\u739b\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"489","title":"\u7b2c K \u6761\u6700\u5c0f\u6307\u4ee4","__typename":"AppliedTranslationNode"},{"questionId":"490","title":"\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"491","title":"\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"492","title":"\u6784\u9020\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"493","title":"\u7ffb\u8f6c\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"494","title":"\u76ee\u6807\u548c","__typename":"AppliedTranslationNode"},{"questionId":"495","title":"\u63d0\u83ab\u653b\u51fb","__typename":"AppliedTranslationNode"},{"questionId":"496","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"498","title":"\u5bf9\u89d2\u7ebf\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"499","title":"\u8ff7\u5bab III","__typename":"AppliedTranslationNode"},{"questionId":"500","title":"\u952e\u76d8\u884c","__typename":"AppliedTranslationNode"},{"questionId":"501","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4f17\u6570","__typename":"AppliedTranslationNode"},{"questionId":"502","title":"IPO","__typename":"AppliedTranslationNode"},{"questionId":"503","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"504","title":"\u4e03\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"505","title":"\u8ff7\u5bab II","__typename":"AppliedTranslationNode"},{"questionId":"506","title":"\u76f8\u5bf9\u540d\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"507","title":"\u5b8c\u7f8e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"508","title":"\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b50\u6811\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"509","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7 II","__typename":"AppliedTranslationNode"},{"questionId":"511","title":"\u4ece\u59cb\u70b9\u5230\u7ec8\u70b9\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"513","title":"\u627e\u6811\u5de6\u4e0b\u89d2\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"514","title":"\u81ea\u7531\u4e4b\u8def","__typename":"AppliedTranslationNode"},{"questionId":"515","title":"\u5728\u6bcf\u4e2a\u6811\u884c\u4e2d\u627e\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"516","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"517","title":"\u8d85\u7ea7\u6d17\u8863\u673a","__typename":"AppliedTranslationNode"},{"questionId":"518","title":"\u96f6\u94b1\u5151\u6362 II","__typename":"AppliedTranslationNode"},{"questionId":"520","title":"\u68c0\u6d4b\u5927\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"521","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 \u2160","__typename":"AppliedTranslationNode"},{"questionId":"522","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"523","title":"\u8fde\u7eed\u7684\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"524","title":"\u901a\u8fc7\u5220\u9664\u5b57\u6bcd\u5339\u914d\u5230\u5b57\u5178\u91cc\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"525","title":"\u8fde\u7eed\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"526","title":"\u4f18\u7f8e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"527","title":"\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"528","title":"\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"529","title":"\u626b\u96f7\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"530","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"531","title":"\u5b64\u72ec\u50cf\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"532","title":"\u6570\u7ec4\u4e2d\u7684 k-diff \u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"533","title":"\u5b64\u72ec\u50cf\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"535","title":"TinyURL \u7684\u52a0\u5bc6\u4e0e\u89e3\u5bc6","__typename":"AppliedTranslationNode"},{"questionId":"536","title":"\u4ece\u5b57\u7b26\u4e32\u751f\u6210\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"537","title":"\u590d\u6570\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"538","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"539","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"540","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u5355\u4e00\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"541","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"542","title":"01 \u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"543","title":"\u4e8c\u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"544","title":"\u8f93\u51fa\u6bd4\u8d5b\u5339\u914d\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"545","title":"\u4e8c\u53c9\u6811\u7684\u8fb9\u754c","__typename":"AppliedTranslationNode"},{"questionId":"546","title":"\u79fb\u9664\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"547","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"548","title":"\u5c06\u6570\u7ec4\u5206\u5272\u6210\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"549","title":"\u4e8c\u53c9\u6811\u4e2d\u6700\u957f\u7684\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"550","title":"\u83b7\u53d6\u98df\u7269\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"551","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 I","__typename":"AppliedTranslationNode"},{"questionId":"552","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"553","title":"\u6700\u4f18\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"554","title":"\u7816\u5899","__typename":"AppliedTranslationNode"},{"questionId":"555","title":"\u5206\u5272\u8fde\u63a5\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"556","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"557","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd III","__typename":"AppliedTranslationNode"},{"questionId":"560","title":"\u548c\u4e3a K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"561","title":"\u6570\u7ec4\u62c6\u5206 I","__typename":"AppliedTranslationNode"},{"questionId":"562","title":"\u77e9\u9635\u4e2d\u6700\u957f\u7684\u8fde\u7eed1\u7ebf\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"563","title":"\u4e8c\u53c9\u6811\u7684\u5761\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"564","title":"\u5bfb\u627e\u6700\u8fd1\u7684\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"565","title":"\u6570\u7ec4\u5d4c\u5957","__typename":"AppliedTranslationNode"},{"questionId":"566","title":"\u91cd\u5851\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"567","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"568","title":"\u6700\u5927\u4f11\u5047\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"569","title":"\u5458\u5de5\u85aa\u6c34\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"570","title":"\u81f3\u5c11\u67095\u540d\u76f4\u63a5\u4e0b\u5c5e\u7684\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"571","title":"\u7ed9\u5b9a\u6570\u5b57\u7684\u9891\u7387\u67e5\u8be2\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"572","title":"\u53e6\u4e00\u68f5\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"573","title":"\u677e\u9f20\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"574","title":"\u5f53\u9009\u8005","__typename":"AppliedTranslationNode"},{"questionId":"575","title":"\u5206\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"576","title":"\u51fa\u754c\u7684\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"577","title":"\u5458\u5de5\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"578","title":"\u67e5\u8be2\u56de\u7b54\u7387\u6700\u9ad8\u7684\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"579","title":"\u67e5\u8be2\u5458\u5de5\u7684\u7d2f\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"580","title":"\u7edf\u8ba1\u5404\u4e13\u4e1a\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"581","title":"\u6700\u77ed\u65e0\u5e8f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"582","title":"\u6740\u6389\u8fdb\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"583","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u5220\u9664\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"584","title":"\u5bfb\u627e\u7528\u6237\u63a8\u8350\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"585","title":"2016\u5e74\u7684\u6295\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"586","title":"\u8ba2\u5355\u6700\u591a\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"587","title":"\u5b89\u88c5\u6805\u680f","__typename":"AppliedTranslationNode"},{"questionId":"588","title":"\u8bbe\u8ba1\u5185\u5b58\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"591","title":"\u6807\u7b7e\u9a8c\u8bc1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"592","title":"\u5206\u6570\u52a0\u51cf\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"593","title":"\u6709\u6548\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"594","title":"\u6700\u957f\u548c\u8c10\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"595","title":"\u5927\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"596","title":"\u8d85\u8fc75\u540d\u5b66\u751f\u7684\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"597","title":"\u597d\u53cb\u7533\u8bf7 I\uff1a\u603b\u4f53\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"598","title":"\u8303\u56f4\u6c42\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"599","title":"\u4e24\u4e2a\u5217\u8868\u7684\u6700\u5c0f\u7d22\u5f15\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"600","title":"\u4e0d\u542b\u8fde\u7eed1\u7684\u975e\u8d1f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"601","title":"\u4f53\u80b2\u9986\u7684\u4eba\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"602","title":"\u597d\u53cb\u7533\u8bf7 II \uff1a\u8c01\u6709\u6700\u591a\u7684\u597d\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"603","title":"\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"604","title":"\u8fed\u4ee3\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"605","title":"\u79cd\u82b1\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"606","title":"\u6839\u636e\u4e8c\u53c9\u6811\u521b\u5efa\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"607","title":"\u9500\u552e\u5458","__typename":"AppliedTranslationNode"},{"questionId":"608","title":"\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"609","title":"\u5728\u7cfb\u7edf\u4e2d\u67e5\u627e\u91cd\u590d\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"610","title":"\u5224\u65ad\u4e09\u89d2\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"611","title":"\u6709\u6548\u4e09\u89d2\u5f62\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"612","title":"\u5e73\u9762\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"613","title":"\u76f4\u7ebf\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"614","title":"\u4e8c\u7ea7\u5173\u6ce8\u8005","__typename":"AppliedTranslationNode"},{"questionId":"615","title":"\u5e73\u5747\u5de5\u8d44\uff1a\u90e8\u95e8\u4e0e\u516c\u53f8\u6bd4\u8f83","__typename":"AppliedTranslationNode"},{"questionId":"616","title":"\u7ed9\u5b57\u7b26\u4e32\u6dfb\u52a0\u52a0\u7c97\u6807\u7b7e","__typename":"AppliedTranslationNode"},{"questionId":"617","title":"\u5408\u5e76\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"618","title":"\u5b66\u751f\u5730\u7406\u4fe1\u606f\u62a5\u544a","__typename":"AppliedTranslationNode"},{"questionId":"619","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"620","title":"\u6709\u8da3\u7684\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"621","title":"\u4efb\u52a1\u8c03\u5ea6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"623","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u589e\u52a0\u4e00\u884c","__typename":"AppliedTranslationNode"},{"questionId":"624","title":"\u6570\u7ec4\u5217\u8868\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"625","title":"\u6700\u5c0f\u56e0\u5f0f\u5206\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"626","title":"\u6362\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"627","title":"\u53d8\u66f4\u6027\u522b","__typename":"AppliedTranslationNode"},{"questionId":"628","title":"\u4e09\u4e2a\u6570\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"629","title":"K\u4e2a\u9006\u5e8f\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"630","title":"\u8bfe\u7a0b\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"631","title":"\u8bbe\u8ba1 Excel \u6c42\u548c\u516c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"632","title":"\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"633","title":"\u5e73\u65b9\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"634","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u9519\u4f4d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"635","title":"\u8bbe\u8ba1\u65e5\u5fd7\u5b58\u50a8\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"636","title":"\u51fd\u6570\u7684\u72ec\u5360\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"637","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"638","title":"\u5927\u793c\u5305","__typename":"AppliedTranslationNode"},{"questionId":"639","title":"\u89e3\u7801\u65b9\u6cd5 II","__typename":"AppliedTranslationNode"},{"questionId":"640","title":"\u6c42\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"642","title":"\u8bbe\u8ba1\u641c\u7d22\u81ea\u52a8\u8865\u5168\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"643","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 I","__typename":"AppliedTranslationNode"},{"questionId":"644","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"645","title":"\u9519\u8bef\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"646","title":"\u6700\u957f\u6570\u5bf9\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"647","title":"\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"648","title":"\u5355\u8bcd\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"649","title":"Dota2 \u53c2\u8bae\u9662","__typename":"AppliedTranslationNode"},{"questionId":"650","title":"\u53ea\u6709\u4e24\u4e2a\u952e\u7684\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"651","title":"4\u952e\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"652","title":"\u5bfb\u627e\u91cd\u590d\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"653","title":"\u4e24\u6570\u4e4b\u548c IV - \u8f93\u5165 BST","__typename":"AppliedTranslationNode"},{"questionId":"654","title":"\u6700\u5927\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"655","title":"\u8f93\u51fa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"656","title":"\u91d1\u5e01\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"657","title":"\u673a\u5668\u4eba\u80fd\u5426\u8fd4\u56de\u539f\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"658","title":"\u627e\u5230 K \u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"659","title":"\u5206\u5272\u6570\u7ec4\u4e3a\u8fde\u7eed\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"660","title":"\u79fb\u9664 9","__typename":"AppliedTranslationNode"},{"questionId":"661","title":"\u56fe\u7247\u5e73\u6ed1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"662","title":"\u4e8c\u53c9\u6811\u6700\u5927\u5bbd\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"663","title":"\u5747\u5300\u6811\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"664","title":"\u5947\u602a\u7684\u6253\u5370\u673a","__typename":"AppliedTranslationNode"},{"questionId":"665","title":"\u975e\u9012\u51cf\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"666","title":"\u8def\u5f84\u603b\u548c IV","__typename":"AppliedTranslationNode"},{"questionId":"667","title":"\u4f18\u7f8e\u7684\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"668","title":"\u4e58\u6cd5\u8868\u4e2d\u7b2ck\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"669","title":"\u4fee\u526a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"670","title":"\u6700\u5927\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"671","title":"\u4e8c\u53c9\u6811\u4e2d\u7b2c\u4e8c\u5c0f\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"672","title":"\u706f\u6ce1\u5f00\u5173 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"673","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"674","title":"\u6700\u957f\u8fde\u7eed\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"675","title":"\u4e3a\u9ad8\u5c14\u592b\u6bd4\u8d5b\u780d\u6811","__typename":"AppliedTranslationNode"},{"questionId":"676","title":"\u5b9e\u73b0\u4e00\u4e2a\u9b54\u6cd5\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"677","title":"\u952e\u503c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"678","title":"\u6709\u6548\u7684\u62ec\u53f7\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"679","title":"24 \u70b9\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"680","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"681","title":"\u6700\u8fd1\u65f6\u523b","__typename":"AppliedTranslationNode"},{"questionId":"682","title":"\u68d2\u7403\u6bd4\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"683","title":"K \u4e2a\u5173\u95ed\u7684\u706f\u6ce1","__typename":"AppliedTranslationNode"},{"questionId":"684","title":"\u5197\u4f59\u8fde\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"685","title":"\u5197\u4f59\u8fde\u63a5 II","__typename":"AppliedTranslationNode"},{"questionId":"686","title":"\u91cd\u590d\u53e0\u52a0\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"687","title":"\u6700\u957f\u540c\u503c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"688","title":"\u201c\u9a6c\u201d\u5728\u68cb\u76d8\u4e0a\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"689","title":"\u4e09\u4e2a\u65e0\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"690","title":"\u5458\u5de5\u7684\u91cd\u8981\u6027","__typename":"AppliedTranslationNode"},{"questionId":"691","title":"\u8d34\u7eb8\u62fc\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"692","title":"\u524dK\u4e2a\u9ad8\u9891\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"693","title":"\u4ea4\u66ff\u4f4d\u4e8c\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"694","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"695","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"696","title":"\u8ba1\u6570\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"697","title":"\u6570\u7ec4\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"698","title":"\u5212\u5206\u4e3ak\u4e2a\u76f8\u7b49\u7684\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"699","title":"\u6389\u843d\u7684\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"711","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"712","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5c0fASCII\u5220\u9664\u548c","__typename":"AppliedTranslationNode"},{"questionId":"713","title":"\u4e58\u79ef\u5c0f\u4e8eK\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"714","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u624b\u7eed\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"715","title":"Range \u6a21\u5757","__typename":"AppliedTranslationNode"},{"questionId":"716","title":"\u6700\u5927\u6808","__typename":"AppliedTranslationNode"},{"questionId":"717","title":"1\u6bd4\u7279\u4e0e2\u6bd4\u7279\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"718","title":"\u6700\u957f\u91cd\u590d\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"719","title":"\u627e\u51fa\u7b2c k \u5c0f\u7684\u8ddd\u79bb\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"720","title":"\u8bcd\u5178\u4e2d\u6700\u957f\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"721","title":"\u8d26\u6237\u5408\u5e76","__typename":"AppliedTranslationNode"},{"questionId":"722","title":"\u5220\u9664\u6ce8\u91ca","__typename":"AppliedTranslationNode"},{"questionId":"723","title":"\u7c89\u788e\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"724","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u4e0b\u6807","__typename":"AppliedTranslationNode"},{"questionId":"725","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"726","title":"\u539f\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"727","title":"\u6700\u5c0f\u7a97\u53e3\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"728","title":"\u81ea\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"729","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 I","__typename":"AppliedTranslationNode"},{"questionId":"730","title":"\u7edf\u8ba1\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"731","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"732","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"733","title":"\u56fe\u50cf\u6e32\u67d3","__typename":"AppliedTranslationNode"},{"questionId":"734","title":"\u53e5\u5b50\u76f8\u4f3c\u6027","__typename":"AppliedTranslationNode"},{"questionId":"735","title":"\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"736","title":"Lisp \u8bed\u6cd5\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"737","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 II","__typename":"AppliedTranslationNode"},{"questionId":"738","title":"\u5355\u8c03\u9012\u589e\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"739","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"740","title":"\u5220\u9664\u5e76\u83b7\u5f97\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"741","title":"\u6458\u6a31\u6843","__typename":"AppliedTranslationNode"},{"questionId":"742","title":"\u8f6c\u6362\u6210\u5c0f\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"743","title":"\u4e8c\u53c9\u6811\u6700\u8fd1\u7684\u53f6\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"744","title":"\u7f51\u7edc\u5ef6\u8fdf\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"745","title":"\u5bfb\u627e\u6bd4\u76ee\u6807\u5b57\u6bcd\u5927\u7684\u6700\u5c0f\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"746","title":"\u524d\u7f00\u548c\u540e\u7f00\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"747","title":"\u4f7f\u7528\u6700\u5c0f\u82b1\u8d39\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"748","title":"\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"749","title":"\u6700\u77ed\u8865\u5168\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"750","title":"\u9694\u79bb\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"751","title":"\u89d2\u77e9\u5f62\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"752","title":"IP \u5230 CIDR","__typename":"AppliedTranslationNode"},{"questionId":"753","title":"\u6253\u5f00\u8f6c\u76d8\u9501","__typename":"AppliedTranslationNode"},{"questionId":"754","title":"\u7834\u89e3\u4fdd\u9669\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"755","title":"\u5230\u8fbe\u7ec8\u70b9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"756","title":"\u5012\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"757","title":"\u91d1\u5b57\u5854\u8f6c\u6362\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"758","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u5316\u4e3a\u6392\u5e8f\u7684\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"759","title":"\u8bbe\u7f6e\u4ea4\u96c6\u5927\u5c0f\u81f3\u5c11\u4e3a2","__typename":"AppliedTranslationNode"},{"questionId":"760","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u52a0\u7c97\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"761","title":"\u5458\u5de5\u7a7a\u95f2\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"762","title":"\u627e\u51fa\u53d8\u4f4d\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"763","title":"\u7279\u6b8a\u7684\u4e8c\u8fdb\u5236\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"764","title":"N \u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"765","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"766","title":"\u6241\u5e73\u5316\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"767","title":"\u4e8c\u8fdb\u5236\u8868\u793a\u4e2d\u8d28\u6570\u4e2a\u8ba1\u7b97\u7f6e\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"768","title":"\u5212\u5206\u5b57\u6bcd\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"769","title":"\u6700\u5927\u52a0\u53f7\u6807\u5fd7","__typename":"AppliedTranslationNode"},{"questionId":"770","title":"\u60c5\u4fa3\u7275\u624b","__typename":"AppliedTranslationNode"},{"questionId":"771","title":"\u5c06 N \u53c9\u6811\u7f16\u7801\u4e3a\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"772","title":"\u5efa\u7acb\u56db\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"773","title":"\u56db\u53c9\u6811\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"774","title":"N \u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"775","title":"N \u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"776","title":"N \u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"777","title":"\u6258\u666e\u5229\u8328\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"778","title":"\u91cd\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"779","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757 II","__typename":"AppliedTranslationNode"},{"questionId":"780","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757","__typename":"AppliedTranslationNode"},{"questionId":"781","title":"\u57fa\u672c\u8ba1\u7b97\u5668 IV","__typename":"AppliedTranslationNode"},{"questionId":"782","title":"\u5b9d\u77f3\u4e0e\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"783","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"784","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u63d2\u5165\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"785","title":"\u57fa\u672c\u8ba1\u7b97\u5668 III","__typename":"AppliedTranslationNode"},{"questionId":"786","title":"\u641c\u7d22\u957f\u5ea6\u672a\u77e5\u7684\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"787","title":"\u6ed1\u52a8\u8c1c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"788","title":"\u6700\u5c0f\u5316\u53bb\u52a0\u6cb9\u7ad9\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"789","title":"\u6570\u636e\u6d41\u4e2d\u7684\u7b2c K \u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"790","title":"\u5168\u5c40\u5012\u7f6e\u4e0e\u5c40\u90e8\u5012\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"791","title":"\u62c6\u5206\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"792","title":"\u4e8c\u5206\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"793","title":"\u5728LR\u5b57\u7b26\u4e32\u4e2d\u4ea4\u6362\u76f8\u90bb\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"794","title":"\u6c34\u4f4d\u4e0a\u5347\u7684\u6cf3\u6c60\u4e2d\u6e38\u6cf3","__typename":"AppliedTranslationNode"},{"questionId":"795","title":"\u7b2cK\u4e2a\u8bed\u6cd5\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"796","title":"\u5230\u8fbe\u7ec8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"797","title":"\u68ee\u6797\u4e2d\u7684\u5154\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"798","title":"\u53d8\u4e3a\u68cb\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"799","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8282\u70b9\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"800","title":"\u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"801","title":"\u5224\u65ad\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"802","title":"\u7b2c K \u4e2a\u6700\u5c0f\u7684\u7d20\u6570\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"803","title":"K \u7ad9\u4e2d\u8f6c\u5185\u6700\u4fbf\u5b9c\u7684\u822a\u73ed","__typename":"AppliedTranslationNode"},{"questionId":"804","title":"\u65cb\u8f6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"805","title":"\u9003\u8131\u963b\u788d\u8005","__typename":"AppliedTranslationNode"},{"questionId":"806","title":"\u591a\u7c73\u8bfa\u548c\u6258\u7c73\u8bfa\u5e73\u94fa","__typename":"AppliedTranslationNode"},{"questionId":"807","title":"\u81ea\u5b9a\u4e49\u5b57\u7b26\u4e32\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"808","title":"\u5339\u914d\u5b50\u5e8f\u5217\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"809","title":"\u9636\u4e58\u51fd\u6570\u540e K \u4e2a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"810","title":"\u6709\u6548\u7684\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"811","title":"\u533a\u95f4\u5b50\u6570\u7ec4\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"812","title":"\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"813","title":"\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"814","title":"\u5f97\u5206\u6700\u9ad8\u7684\u6700\u5c0f\u8f6e\u8c03","__typename":"AppliedTranslationNode"},{"questionId":"815","title":"\u9999\u69df\u5854","__typename":"AppliedTranslationNode"},{"questionId":"816","title":"\u8bbe\u8ba1\u54c8\u5e0c\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"817","title":"\u8bbe\u8ba1\u54c8\u5e0c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"818","title":"\u76f8\u4f3c RGB \u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"819","title":"\u4f7f\u5e8f\u5217\u9012\u589e\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"820","title":"\u627e\u5230\u6700\u7ec8\u7684\u5b89\u5168\u72b6\u6001","__typename":"AppliedTranslationNode"},{"questionId":"821","title":"\u6253\u7816\u5757","__typename":"AppliedTranslationNode"},{"questionId":"822","title":"\u552f\u4e00\u6469\u5c14\u65af\u5bc6\u7801\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"823","title":"\u6570\u7ec4\u7684\u5747\u503c\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"824","title":"\u5199\u5b57\u7b26\u4e32\u9700\u8981\u7684\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"825","title":"\u4fdd\u6301\u57ce\u5e02\u5929\u9645\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"826","title":"\u5206\u6c64","__typename":"AppliedTranslationNode"},{"questionId":"827","title":"\u60c5\u611f\u4e30\u5bcc\u7684\u6587\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"828","title":"\u9ed1\u677f\u5f02\u6216\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"829","title":"\u5b50\u57df\u540d\u8bbf\u95ee\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"830","title":"\u6700\u5927\u4e09\u89d2\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"831","title":"\u6700\u5927\u5e73\u5747\u503c\u548c\u7684\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"832","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"833","title":"\u516c\u4ea4\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"834","title":"\u6a21\u7cca\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"835","title":"\u94fe\u8868\u7ec4\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"836","title":"\u8d5b\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"837","title":"\u6700\u5e38\u89c1\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"838","title":"\u8bbe\u8ba1\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"839","title":"\u5355\u8bcd\u7684\u538b\u7f29\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"841","title":"\u5b57\u7b26\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"842","title":"\u7ffb\u8f6c\u5361\u7247\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"843","title":"\u5e26\u56e0\u5b50\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"850","title":"\u5faa\u73af\u6709\u5e8f\u5217\u8868\u7684\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"851","title":"\u5c71\u7f8a\u62c9\u4e01\u6587","__typename":"AppliedTranslationNode"},{"questionId":"852","title":"\u9002\u9f84\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"853","title":"\u5b89\u6392\u5de5\u4f5c\u4ee5\u8fbe\u5230\u6700\u5927\u6536\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"854","title":"\u6700\u5927\u4eba\u5de5\u5c9b","__typename":"AppliedTranslationNode"},{"questionId":"855","title":"\u7edf\u8ba1\u5b50\u4e32\u4e2d\u7684\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"856","title":"\u8fde\u7eed\u6574\u6570\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"857","title":"\u8f83\u5927\u5206\u7ec4\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"858","title":"\u9690\u85cf\u4e2a\u4eba\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"859","title":"\u8bbe\u8ba1\u5faa\u73af\u53cc\u7aef\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"860","title":"\u8bbe\u8ba1\u5faa\u73af\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"861","title":"\u7ffb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"862","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u67e5\u627e\u4e0e\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"863","title":"\u6811\u4e2d\u8ddd\u79bb\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"864","title":"\u56fe\u50cf\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"865","title":"\u626b\u5730\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"866","title":"\u77e9\u5f62\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"867","title":"\u65b021\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"868","title":"\u63a8\u591a\u7c73\u8bfa","__typename":"AppliedTranslationNode"},{"questionId":"869","title":"\u76f8\u4f3c\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"870","title":"\u77e9\u9635\u4e2d\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"871","title":"\u94a5\u5319\u548c\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"872","title":"\u5c06\u6570\u7ec4\u62c6\u5206\u6210\u6590\u6ce2\u90a3\u5951\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"873","title":"\u731c\u731c\u8fd9\u4e2a\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"874","title":"\u6bd4\u8f83\u542b\u9000\u683c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"875","title":"\u6570\u7ec4\u4e2d\u7684\u6700\u957f\u5c71\u8109","__typename":"AppliedTranslationNode"},{"questionId":"876","title":"\u4e00\u624b\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"877","title":"\u8bbf\u95ee\u6240\u6709\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"878","title":"\u5b57\u6bcd\u79fb\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"879","title":"\u5230\u6700\u8fd1\u7684\u4eba\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"880","title":"\u77e9\u5f62\u9762\u79ef II","__typename":"AppliedTranslationNode"},{"questionId":"881","title":"\u55a7\u95f9\u548c\u5bcc\u6709","__typename":"AppliedTranslationNode"},{"questionId":"882","title":"\u5c71\u8109\u6570\u7ec4\u7684\u5cf0\u9876\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"883","title":"\u8f66\u961f","__typename":"AppliedTranslationNode"},{"questionId":"884","title":"\u76f8\u4f3c\u5ea6\u4e3a K \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"885","title":"\u8003\u573a\u5c31\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"886","title":"\u62ec\u53f7\u7684\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"887","title":"\u96c7\u4f63 K \u540d\u5de5\u4eba\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"888","title":"\u955c\u9762\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"889","title":"\u4eb2\u5bc6\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"890","title":"\u67e0\u6aac\u6c34\u627e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"891","title":"\u7ffb\u8f6c\u77e9\u9635\u540e\u7684\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"892","title":"\u548c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"893","title":"\u4e8c\u53c9\u6811\u4e2d\u6240\u6709\u8ddd\u79bb\u4e3a K \u7684\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"894","title":"\u9ed1\u540d\u5355\u4e2d\u7684\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"895","title":"\u83b7\u53d6\u6240\u6709\u94a5\u5319\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"896","title":"\u5177\u6709\u6240\u6709\u6700\u6df1\u8282\u70b9\u7684\u6700\u5c0f\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"897","title":"\u56de\u6587\u7d20\u6570","__typename":"AppliedTranslationNode"},{"questionId":"898","title":"\u8f6c\u7f6e\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"899","title":"\u4e8c\u8fdb\u5236\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"900","title":"\u91cd\u65b0\u6392\u5e8f\u5f97\u5230 2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"901","title":"\u4f18\u52bf\u6d17\u724c","__typename":"AppliedTranslationNode"},{"questionId":"902","title":"\u6700\u4f4e\u52a0\u6cb9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"903","title":"\u7528 Rand7() \u5b9e\u73b0 Rand10()","__typename":"AppliedTranslationNode"},{"questionId":"904","title":"\u53f6\u5b50\u76f8\u4f3c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"905","title":"\u6700\u957f\u7684\u6590\u6ce2\u90a3\u5951\u5b50\u5e8f\u5217\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"906","title":"\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"907","title":"\u7231\u5403\u9999\u8549\u7684\u73c2\u73c2","__typename":"AppliedTranslationNode"},{"questionId":"908","title":"\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"909","title":"\u77f3\u5b50\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"910","title":"\u7b2c N \u4e2a\u795e\u5947\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"911","title":"\u76c8\u5229\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"912","title":"\u6309\u6743\u91cd\u968f\u673a\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"913","title":"\u968f\u673a\u7ffb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"914","title":"\u975e\u91cd\u53e0\u77e9\u5f62\u4e2d\u7684\u968f\u673a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"915","title":"\u5728\u5706\u5185\u968f\u673a\u751f\u6210\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"916","title":"\u7d22\u5f15\u5904\u7684\u89e3\u7801\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"917","title":"\u6551\u751f\u8247","__typename":"AppliedTranslationNode"},{"questionId":"918","title":"\u7ec6\u5206\u56fe\u4e2d\u7684\u53ef\u5230\u8fbe\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"919","title":"\u4e09\u7ef4\u5f62\u4f53\u6295\u5f71\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"920","title":"\u4e24\u53e5\u8bdd\u4e2d\u7684\u4e0d\u5e38\u89c1\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"921","title":"\u87ba\u65cb\u77e9\u9635 III","__typename":"AppliedTranslationNode"},{"questionId":"922","title":"\u53ef\u80fd\u7684\u4e8c\u5206\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"923","title":"\u9e21\u86cb\u6389\u843d","__typename":"AppliedTranslationNode"},{"questionId":"924","title":"\u516c\u5e73\u7684\u7cd6\u679c\u68d2\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"925","title":"\u6839\u636e\u524d\u5e8f\u548c\u540e\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"926","title":"\u67e5\u627e\u548c\u66ff\u6362\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"927","title":"\u5b50\u5e8f\u5217\u5bbd\u5ea6\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"928","title":"\u4e09\u7ef4\u5f62\u4f53\u7684\u8868\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"929","title":"\u7279\u6b8a\u7b49\u4ef7\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"930","title":"\u6240\u6709\u53ef\u80fd\u7684\u6ee1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"931","title":"\u6700\u5927\u9891\u7387\u6808","__typename":"AppliedTranslationNode"},{"questionId":"932","title":"\u5355\u8c03\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"933","title":"\u9012\u589e\u987a\u5e8f\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"934","title":"\u5b50\u6570\u7ec4\u6309\u4f4d\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"935","title":"\u6709\u5e8f\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"936","title":"RLE \u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"937","title":"\u80a1\u7968\u4ef7\u683c\u8de8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"938","title":"\u6700\u5927\u4e3a N \u7684\u6570\u5b57\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"939","title":"DI \u5e8f\u5217\u7684\u6709\u6548\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"940","title":"\u6c34\u679c\u6210\u7bee","__typename":"AppliedTranslationNode"},{"questionId":"941","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"942","title":"\u8d85\u7ea7\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"943","title":"\u5b50\u6570\u7ec4\u7684\u6700\u5c0f\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"944","title":"\u6700\u5c0f\u5dee\u503c I","__typename":"AppliedTranslationNode"},{"questionId":"945","title":"\u86c7\u68af\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"946","title":"\u6700\u5c0f\u5dee\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"947","title":"\u5728\u7ebf\u9009\u4e3e","__typename":"AppliedTranslationNode"},{"questionId":"948","title":"\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"949","title":"\u732b\u548c\u8001\u9f20","__typename":"AppliedTranslationNode"},{"questionId":"950","title":"\u5361\u724c\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"951","title":"\u5206\u5272\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"952","title":"\u5355\u8bcd\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"953","title":"\u4ec5\u4ec5\u53cd\u8f6c\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"954","title":"\u73af\u5f62\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"955","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u63d2\u5165\u5668","__typename":"AppliedTranslationNode"},{"questionId":"956","title":"\u64ad\u653e\u5217\u8868\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"957","title":"\u4f7f\u62ec\u53f7\u6709\u6548\u7684\u6700\u5c11\u6dfb\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"958","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"959","title":"\u4e09\u6570\u4e4b\u548c\u7684\u591a\u79cd\u53ef\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"960","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad","__typename":"AppliedTranslationNode"},{"questionId":"961","title":"\u957f\u6309\u952e\u5165","__typename":"AppliedTranslationNode"},{"questionId":"962","title":"\u5c06\u5b57\u7b26\u4e32\u7ffb\u8f6c\u5230\u5355\u8c03\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"963","title":"\u4e09\u7b49\u5206","__typename":"AppliedTranslationNode"},{"questionId":"964","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad II","__typename":"AppliedTranslationNode"},{"questionId":"965","title":"\u72ec\u7279\u7684\u7535\u5b50\u90ae\u4ef6\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"966","title":"\u548c\u76f8\u540c\u7684\u4e8c\u5143\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"967","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"968","title":"\u6f02\u4eae\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"969","title":"\u6700\u8fd1\u7684\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"971","title":"\u6700\u77ed\u7684\u6865","__typename":"AppliedTranslationNode"},{"questionId":"972","title":"\u9a91\u58eb\u62e8\u53f7\u5668","__typename":"AppliedTranslationNode"},{"questionId":"973","title":"\u6233\u5370\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"974","title":"\u91cd\u65b0\u6392\u5217\u65e5\u5fd7\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"975","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u8303\u56f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"976","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"977","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"978","title":"\u6709\u6548\u7684\u5c71\u8109\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"979","title":"\u589e\u51cf\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"980","title":"\u6700\u77ed\u8d85\u7ea7\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"981","title":"\u5220\u5217\u9020\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"982","title":"\u4f7f\u6570\u7ec4\u552f\u4e00\u7684\u6700\u5c0f\u589e\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"983","title":"\u9a8c\u8bc1\u6808\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"984","title":"\u79fb\u9664\u6700\u591a\u7684\u540c\u884c\u6216\u540c\u5217\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"985","title":"\u4ee4\u724c\u653e\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"986","title":"\u7ed9\u5b9a\u6570\u5b57\u80fd\u7ec4\u6210\u7684\u6700\u5927\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"987","title":"\u6309\u9012\u589e\u987a\u5e8f\u663e\u793a\u5361\u724c","__typename":"AppliedTranslationNode"},{"questionId":"988","title":"\u7ffb\u8f6c\u7b49\u4ef7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"989","title":"\u6309\u516c\u56e0\u6570\u8ba1\u7b97\u6700\u5927\u7ec4\u4ef6\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"990","title":"\u9a8c\u8bc1\u5916\u661f\u8bed\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"991","title":"\u4e8c\u500d\u6570\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"992","title":"\u5220\u5217\u9020\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"993","title":"\u6700\u9ad8\u7684\u5e7f\u544a\u724c","__typename":"AppliedTranslationNode"},{"questionId":"994","title":"N \u5929\u540e\u7684\u7262\u623f","__typename":"AppliedTranslationNode"},{"questionId":"998","title":"\u4e8c\u53c9\u6811\u7684\u5b8c\u5168\u6027\u68c0\u9a8c","__typename":"AppliedTranslationNode"},{"questionId":"999","title":"\u7531\u659c\u6760\u5212\u5206\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1000","title":"\u5220\u5217\u9020\u5e8f III","__typename":"AppliedTranslationNode"},{"questionId":"1001","title":"\u91cd\u590d N \u6b21\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1002","title":"\u6700\u5927\u5bbd\u5ea6\u5761","__typename":"AppliedTranslationNode"},{"questionId":"1003","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62 II","__typename":"AppliedTranslationNode"},{"questionId":"1004","title":"\u8868\u793a\u6570\u5b57\u7684\u6700\u5c11\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1005","title":"\u5355\u503c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1006","title":"\u5143\u97f3\u62fc\u5199\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1007","title":"\u8fde\u7eed\u5dee\u76f8\u540c\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1008","title":"\u76d1\u63a7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1009","title":"\u714e\u997c\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1010","title":"\u5f3a\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1011","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811\u4ee5\u5339\u914d\u5148\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1012","title":"\u76f8\u7b49\u7684\u6709\u7406\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1013","title":"\u6590\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1014","title":"\u6700\u63a5\u8fd1\u539f\u70b9\u7684 K \u4e2a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1016","title":"\u548c\u53ef\u88ab K \u6574\u9664\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1017","title":"\u5947\u5076\u8df3","__typename":"AppliedTranslationNode"},{"questionId":"1018","title":"\u4e09\u89d2\u5f62\u7684\u6700\u5927\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1019","title":"\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1020","title":"\u6700\u957f\u6e4d\u6d41\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1021","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u5206\u914d\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1022","title":"\u4e0d\u540c\u8def\u5f84 III","__typename":"AppliedTranslationNode"},{"questionId":"1023","title":"\u57fa\u4e8e\u65f6\u95f4\u7684\u952e\u503c\u5b58\u50a8","__typename":"AppliedTranslationNode"},{"questionId":"1024","title":"\u6309\u4f4d\u4e0e\u4e3a\u96f6\u7684\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1025","title":"\u6700\u4f4e\u7968\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1026","title":"\u4e0d\u542b AAA \u6216 BBB \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1027","title":"\u67e5\u8be2\u540e\u7684\u5076\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1028","title":"\u533a\u95f4\u5217\u8868\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1029","title":"\u4e8c\u53c9\u6811\u7684\u5782\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1030","title":"\u4ece\u53f6\u7ed3\u70b9\u5f00\u59cb\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1031","title":"\u6570\u7ec4\u5f62\u5f0f\u7684\u6574\u6570\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1032","title":"\u7b49\u5f0f\u65b9\u7a0b\u7684\u53ef\u6ee1\u8db3\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1033","title":"\u574f\u4e86\u7684\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1034","title":"K \u4e2a\u4e0d\u540c\u6574\u6570\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1035","title":"\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1036","title":"\u8150\u70c2\u7684\u6a58\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1037","title":"K \u8fde\u7eed\u4f4d\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1038","title":"\u6b63\u65b9\u5f62\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1039","title":"\u627e\u5230\u5c0f\u9547\u7684\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1040","title":"\u6700\u5927\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"1041","title":"\u53ef\u4ee5\u88ab\u4e00\u6b65\u6355\u83b7\u7684\u68cb\u5b50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1042","title":"\u5408\u5e76\u77f3\u5934\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1043","title":"\u7f51\u683c\u7167\u660e","__typename":"AppliedTranslationNode"},{"questionId":"1044","title":"\u67e5\u627e\u5171\u7528\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1045","title":"\u68c0\u67e5\u66ff\u6362\u540e\u7684\u8bcd\u662f\u5426\u6709\u6548","__typename":"AppliedTranslationNode"},{"questionId":"1046","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1047","title":"K \u6b21\u53d6\u53cd\u540e\u6700\u5927\u5316\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1048","title":"\u7b28\u9636\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"1049","title":"\u884c\u76f8\u7b49\u7684\u6700\u5c11\u591a\u7c73\u8bfa\u65cb\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"1050","title":"\u524d\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1051","title":"\u5f62\u6210\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1052","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1053","title":"\u6700\u5c0f\u5316\u820d\u5165\u8bef\u5dee\u4ee5\u6ee1\u8db3\u76ee\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1054","title":"\u5341\u8fdb\u5236\u6574\u6570\u7684\u53cd\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1055","title":"\u603b\u6301\u7eed\u65f6\u95f4\u53ef\u88ab 60 \u6574\u9664\u7684\u6b4c\u66f2","__typename":"AppliedTranslationNode"},{"questionId":"1056","title":"\u5728 D \u5929\u5185\u9001\u8fbe\u5305\u88f9\u7684\u80fd\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1057","title":"\u81f3\u5c11\u6709 1 \u4f4d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1058","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5217\u6700\u5c0f\u7684\u7b49\u6548\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1059","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7f3a\u5931\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1060","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1061","title":"\u6709\u6548\u5b50\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1062","title":"\u5c06\u6570\u7ec4\u5206\u6210\u548c\u76f8\u7b49\u7684\u4e09\u4e2a\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1063","title":"\u6700\u4f73\u89c2\u5149\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1064","title":"\u53ef\u88ab K \u6574\u9664\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1065","title":"\u5b50\u4e32\u80fd\u8868\u793a\u4ece 1 \u5230 N \u6570\u5b57\u7684\u4e8c\u8fdb\u5236\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1066","title":"\u4e0d\u52a8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1067","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d II","__typename":"AppliedTranslationNode"},{"questionId":"1068","title":"\u8303\u56f4\u5185\u7684\u6570\u5b57\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1069","title":"\u6613\u6df7\u6dc6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1070","title":"\u8d1f\u4e8c\u8fdb\u5236\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1071","title":"\u53ef\u88ab 5 \u6574\u9664\u7684\u4e8c\u8fdb\u5236\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1072","title":"\u94fe\u8868\u4e2d\u7684\u4e0b\u4e00\u4e2a\u66f4\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1073","title":"\u98de\u5730\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1074","title":"\u524d\u4e94\u79d1\u7684\u5747\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1075","title":"\u5b57\u7b26\u4e32\u7684\u7d22\u5f15\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1076","title":"\u82b1\u62ec\u53f7\u5c55\u5f00","__typename":"AppliedTranslationNode"},{"questionId":"1077","title":"\u6613\u6df7\u6dc6\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"1078","title":"\u5220\u9664\u6700\u5916\u5c42\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1079","title":"\u4ece\u6839\u5230\u53f6\u7684\u4e8c\u8fdb\u5236\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1080","title":"\u9a7c\u5cf0\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1081","title":"\u89c6\u9891\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1082","title":"\u6700\u5c0f\u5143\u7d20\u5404\u6570\u4f4d\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1083","title":"\u5c0f\u4e8e K \u7684\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1084","title":"\u957f\u5ea6\u4e3a K \u7684\u65e0\u91cd\u590d\u5b57\u7b26\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1085","title":"\u5f7c\u6b64\u719f\u8bc6\u7684\u6700\u65e9\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1086","title":"\u9664\u6570\u535a\u5f08","__typename":"AppliedTranslationNode"},{"questionId":"1087","title":"\u6700\u957f\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1088","title":"\u4e00\u6708\u6709\u591a\u5c11\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1089","title":"\u5220\u53bb\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3","__typename":"AppliedTranslationNode"},{"questionId":"1090","title":"\u963f\u59c6\u65af\u7279\u6717\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1091","title":"\u5b50\u6811\u7684\u6700\u5927\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1092","title":"\u8282\u70b9\u4e0e\u5176\u7956\u5148\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1093","title":"\u4ece\u5148\u5e8f\u904d\u5386\u8fd8\u539f\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1094","title":"\u8ddd\u79bb\u987a\u5e8f\u6392\u5217\u77e9\u9635\u5355\u5143\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1095","title":"\u4e24\u5730\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1096","title":"\u4e24\u4e2a\u975e\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1097","title":"\u5b57\u7b26\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1098","title":"\u6700\u5927\u552f\u4e00\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1099","title":"\u5f97\u5206\u6700\u9ad8\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1100","title":"\u6700\u4f4e\u6210\u672c\u8054\u901a\u6240\u6709\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1101","title":"\u5e73\u884c\u8bfe\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1102","title":"\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u5728\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1103","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed","__typename":"AppliedTranslationNode"},{"questionId":"1104","title":"\u8fb9\u6846\u7740\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1105","title":"\u4e0d\u76f8\u4ea4\u7684\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1106","title":"\u9003\u79bb\u5927\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1107","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1","__typename":"AppliedTranslationNode"},{"questionId":"1108","title":"\u7528\u6237\u7f51\u7ad9\u8bbf\u95ee\u884c\u4e3a\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1110","title":"\u516c\u8def\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1111","title":"\u591a\u8fb9\u5f62\u4e09\u89d2\u5256\u5206\u7684\u6700\u4f4e\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1112","title":"\u62fc\u5199\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1113","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed II","__typename":"AppliedTranslationNode"},{"questionId":"1114","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1115","title":"\u6709\u6548\u7684\u56de\u65cb\u9556","__typename":"AppliedTranslationNode"},{"questionId":"1116","title":"\u6700\u5927\u5c42\u5185\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1117","title":"\u5730\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1118","title":"\u5c06\u6570\u7ec4\u5206\u6210\u51e0\u4e2a\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1119","title":"\u56f0\u4e8e\u73af\u4e2d\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1120","title":"\u4e0d\u90bb\u63a5\u690d\u82b1","__typename":"AppliedTranslationNode"},{"questionId":"1121","title":"\u5206\u9694\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1122","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1123","title":"\u5355\u884c\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1124","title":"\u5b57\u7b26\u4e32\u8f6c\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1125","title":"\u8bbe\u8ba1\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1126","title":"\u8fde\u63a5\u68d2\u6750\u7684\u6700\u4f4e\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1127","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1128","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"1129","title":"\u6700\u957f\u5b57\u7b26\u4e32\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"1130","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"1131","title":"\u7edf\u8ba1\u53ea\u542b\u5355\u4e00\u5b57\u6bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1132","title":"\u524d\u540e\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1133","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5728\u6700\u540e\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1134","title":"\u4e0e\u76ee\u6807\u989c\u8272\u95f4\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1135","title":"\u4e70\u4e0b\u6240\u6709\u4ea7\u54c1\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1136","title":"\u5408\u4f5c\u8fc7\u81f3\u5c11\u4e09\u6b21\u7684\u6f14\u5458\u548c\u5bfc\u6f14","__typename":"AppliedTranslationNode"},{"questionId":"1137","title":"\u9ad8\u5ea6\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1138","title":"\u7231\u751f\u6c14\u7684\u4e66\u5e97\u8001\u677f","__typename":"AppliedTranslationNode"},{"questionId":"1139","title":"\u4ea4\u6362\u4e00\u6b21\u7684\u5148\u524d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1140","title":"\u8ddd\u79bb\u76f8\u7b49\u7684\u6761\u5f62\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1141","title":"\u6700\u591a\u53ef\u4ee5\u4e70\u5230\u7684\u82f9\u679c\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1142","title":"\u8fdb\u51fb\u7684\u9a91\u58eb","__typename":"AppliedTranslationNode"},{"questionId":"1143","title":"\u627e\u51fa\u6240\u6709\u884c\u4e2d\u6700\u5c0f\u516c\u5171\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1144","title":"\u6c34\u8d44\u6e90\u5206\u914d\u4f18\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1145","title":"\u5143\u7d20\u548c\u4e3a\u76ee\u6807\u503c\u7684\u5b50\u77e9\u9635\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1146","title":"\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1147","title":"\u6309\u5217\u7ffb\u8f6c\u5f97\u5230\u6700\u5927\u503c\u7b49\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1148","title":"\u8d1f\u4e8c\u8fdb\u5236\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1149","title":"\u4e09\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1150","title":"\u67e5\u627e\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1151","title":"\u6b65\u8fdb\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1152","title":"\u77e9\u9635\u4e2d 1 \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1153","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1154","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1155","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1156","title":"Bigram \u5206\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1157","title":"\u6839\u5230\u53f6\u8def\u5f84\u4e0a\u7684\u4e0d\u8db3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1159","title":"\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1160","title":"\u6d3b\u5b57\u5370\u5237","__typename":"AppliedTranslationNode"},{"questionId":"1161","title":"\u9879\u76ee\u5458\u5de5 I","__typename":"AppliedTranslationNode"},{"questionId":"1162","title":"\u9879\u76ee\u5458\u5de5II","__typename":"AppliedTranslationNode"},{"questionId":"1163","title":"\u9879\u76ee\u5458\u5de5 III","__typename":"AppliedTranslationNode"},{"questionId":"1164","title":"\u7b49\u5dee\u6570\u5217\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1165","title":"\u5b89\u6392\u4f1a\u8bae\u65e5\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1166","title":"\u629b\u63b7\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1167","title":"\u5efa\u9020\u8857\u533a\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1168","title":"\u590d\u5199\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1169","title":"\u53d7\u6807\u7b7e\u5f71\u54cd\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1170","title":"\u6700\u77ed\u516c\u5171\u8d85\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1171","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1172","title":"\u9500\u552e\u5206\u6790 I ","__typename":"AppliedTranslationNode"},{"questionId":"1173","title":"\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1174","title":"\u9500\u552e\u5206\u6790III","__typename":"AppliedTranslationNode"},{"questionId":"1175","title":"\u6570\u7ec4\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1176","title":"\u529b\u6263\u6392\u884c\u699c","__typename":"AppliedTranslationNode"},{"questionId":"1177","title":"\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1178","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1179","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1180","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1181","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1182","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 IV","__typename":"AppliedTranslationNode"},{"questionId":"1183","title":"\u5927\u6837\u672c\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1184","title":"\u62fc\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"1185","title":"\u5c71\u8109\u6570\u7ec4\u4e2d\u67e5\u627e\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1186","title":"H2O \u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"1187","title":"\u4ea4\u66ff\u6253\u5370FooBar","__typename":"AppliedTranslationNode"},{"questionId":"1188","title":"\u82b1\u62ec\u53f7\u5c55\u5f00 II","__typename":"AppliedTranslationNode"},{"questionId":"1189","title":"\u52a0\u5bc6\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1190","title":"\u6700\u5c0f\u516c\u5171\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1191","title":"\u8fd1\u4e49\u8bcd\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1192","title":"\u5206\u4eab\u5de7\u514b\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1193","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 V","__typename":"AppliedTranslationNode"},{"questionId":"1194","title":"\u4e8c\u53c9\u6811\u5bfb\u8def","__typename":"AppliedTranslationNode"},{"questionId":"1195","title":"\u5206\u7cd6\u679c II","__typename":"AppliedTranslationNode"},{"questionId":"1196","title":"\u586b\u5145\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1197","title":"\u89e3\u6790\u5e03\u5c14\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1198","title":"\u5c0f\u4f17\u4e66\u7c4d","__typename":"AppliedTranslationNode"},{"questionId":"1199","title":"\u5341\u516d\u8fdb\u5236\u9b54\u672f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1200","title":"\u5220\u9664\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1201","title":"\u5220\u9664\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1202","title":"\u5220\u9664\u56de\u6587\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1203","title":"\u6309\u5e8f\u6253\u5370","__typename":"AppliedTranslationNode"},{"questionId":"1204","title":"\u6bcf\u65e5\u65b0\u7528\u6237\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1205","title":"IP \u5730\u5740\u65e0\u6548\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1206","title":"\u822a\u73ed\u9884\u8ba2\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1207","title":"\u5220\u70b9\u6210\u6797","__typename":"AppliedTranslationNode"},{"questionId":"1208","title":"\u6709\u6548\u62ec\u53f7\u7684\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1209","title":"\u8bbe\u8ba1\u6709\u9650\u963b\u585e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1210","title":"\u5220\u9664\u67d0\u4e9b\u5143\u7d20\u540e\u7684\u6570\u7ec4\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1211","title":"\u5b57\u6bcd\u7ec4\u5408\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1212","title":"\u987a\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1213","title":"\u4e0d\u76f8\u4ea4\u7684\u63e1\u624b","__typename":"AppliedTranslationNode"},{"questionId":"1214","title":"\u6bcf\u4f4d\u5b66\u751f\u7684\u6700\u9ad8\u6210\u7ee9","__typename":"AppliedTranslationNode"},{"questionId":"1215","title":"\u62a5\u544a\u7684\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1216","title":"\u6253\u5370\u96f6\u4e0e\u5947\u5076\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1217","title":"\u6570\u7ec4\u7684\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1218","title":"\u6700\u6df1\u53f6\u8282\u70b9\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1219","title":"\u8868\u73b0\u826f\u597d\u7684\u6700\u957f\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1220","title":"\u6700\u5c0f\u7684\u5fc5\u8981\u56e2\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1221","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc725%\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1222","title":"\u5220\u9664\u88ab\u8986\u76d6\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1223","title":"\u5e26\u9608\u503c\u7684\u56fe\u8fde\u901a\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1224","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"1225","title":"\u67e5\u8be2\u6d3b\u8dc3\u4e1a\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1226","title":"\u7528\u6237\u8d2d\u4e70\u5e73\u53f0","__typename":"AppliedTranslationNode"},{"questionId":"1227","title":"\u7b49\u4ef7\u591a\u7c73\u8bfa\u9aa8\u724c\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1228","title":"\u53f6\u503c\u7684\u6700\u5c0f\u4ee3\u4ef7\u751f\u6210\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1229","title":"\u989c\u8272\u4ea4\u66ff\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1230","title":"\u7edd\u5bf9\u503c\u8868\u8fbe\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1231","title":"\u5c06\u6bcf\u4e2a\u5143\u7d20\u66ff\u6362\u4e3a\u53f3\u4fa7\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1232","title":"\u8f6c\u53d8\u6570\u7ec4\u540e\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1233","title":"\u77e9\u5f62\u5185\u8239\u53ea\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1234","title":"\u6700\u5927\u5f97\u5206\u7684\u8def\u5f84\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1236","title":"\u7b2c N \u4e2a\u6cf0\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1237","title":"\u62a5\u544a\u7684\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"1238","title":"\u5b57\u6bcd\u677f\u4e0a\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1239","title":"\u6700\u5927\u7684\u4ee5 1 \u4e3a\u8fb9\u754c\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1240","title":"\u77f3\u5b50\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"1241","title":"\u89e3\u538b\u7f29\u7f16\u7801\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1242","title":"\u77e9\u9635\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1243","title":"\u7956\u7236\u8282\u70b9\u503c\u4e3a\u5076\u6570\u7684\u8282\u70b9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1244","title":"\u4e0d\u540c\u7684\u5faa\u73af\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1245","title":"\u67e5\u8be2\u8fd130\u5929\u6d3b\u8dc3\u7528\u6237\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1246","title":"\u8fc7\u53bb30\u5929\u7684\u7528\u6237\u6d3b\u52a8 II","__typename":"AppliedTranslationNode"},{"questionId":"1247","title":"\u9012\u51cf\u5143\u7d20\u4f7f\u6570\u7ec4\u5448\u952f\u9f7f\u72b6","__typename":"AppliedTranslationNode"},{"questionId":"1248","title":"\u4e8c\u53c9\u6811\u7740\u8272\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1249","title":"\u5feb\u7167\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1250","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1251","title":"\u6bb5\u5f0f\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1252","title":"\u7834\u574f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1253","title":"\u5c06\u77e9\u9635\u6309\u5bf9\u89d2\u7ebf\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1254","title":"\u5c42\u6570\u6700\u6df1\u53f6\u5b50\u8282\u70b9\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1255","title":"\u7ffb\u8f6c\u5b50\u6570\u7ec4\u5f97\u5230\u6700\u5927\u7684\u6570\u7ec4\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1256","title":"\u6570\u7ec4\u5e8f\u53f7\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1257","title":"\u77e9\u9635\u8f6c\u6362\u540e\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1258","title":"\u6587\u7ae0\u6d4f\u89c8 I","__typename":"AppliedTranslationNode"},{"questionId":"1259","title":"\u6587\u7ae0\u6d4f\u89c8 II","__typename":"AppliedTranslationNode"},{"questionId":"1260","title":"\u4e00\u5e74\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1261","title":"\u5355\u5b57\u7b26\u91cd\u590d\u5b50\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1262","title":"\u5b50\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1263","title":"\u63b7\u9ab0\u5b50\u7684N\u79cd\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1264","title":"\u53ef\u4ee5\u8f93\u5165\u7684\u6700\u5927\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1267","title":"\u4ece\u94fe\u8868\u4e2d\u5220\u53bb\u603b\u548c\u503c\u4e3a\u96f6\u7684\u8fde\u7eed\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1268","title":"\u5e02\u573a\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1269","title":"\u5e02\u573a\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1270","title":"\u9910\u76d8\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1271","title":"\u7f51\u7edc\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1272","title":"\u67e5\u8be2\u65e0\u6548\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1273","title":"\u6bd4\u8f83\u5b57\u7b26\u4e32\u6700\u5c0f\u5b57\u6bcd\u51fa\u73b0\u9891\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"1274","title":"\u65e5\u671f\u4e4b\u95f4\u9694\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1275","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1276","title":"\u6700\u63a5\u8fd1\u7684\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1277","title":"\u5f62\u6210\u4e09\u7684\u6700\u5927\u500d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1278","title":"\u6307\u5b9a\u65e5\u671f\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1279","title":"\u8d28\u6570\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1280","title":"\u5065\u8eab\u8ba1\u5212\u8bc4\u4f30","__typename":"AppliedTranslationNode"},{"questionId":"1281","title":"\u6784\u5efa\u56de\u6587\u4e32\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"1282","title":"\u731c\u5b57\u8c1c","__typename":"AppliedTranslationNode"},{"questionId":"1283","title":"\u8f6c\u53d8\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1284","title":"\u56db\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1285","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u53d8\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"1286","title":"\u5e26\u9650\u5236\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1287","title":"\u516c\u4ea4\u7ad9\u95f4\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1288","title":"\u5220\u9664\u4e00\u6b21\u5f97\u5230\u5b50\u6570\u7ec4\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1289","title":"\u4e00\u5468\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1290","title":"\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1291","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 I","__typename":"AppliedTranslationNode"},{"questionId":"1292","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 II","__typename":"AppliedTranslationNode"},{"questionId":"1293","title":"\u5b58\u5728\u8fde\u7eed\u4e09\u4e2a\u5947\u6570\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1295","title":"\u6536\u96c6\u8db3\u591f\u82f9\u679c\u7684\u6700\u5c0f\u82b1\u56ed\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1296","title":"\u6811\u8282\u70b9\u7684\u7b2c K \u4e2a\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1297","title":"\u201c\u6c14\u7403\u201d \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1298","title":"\u53cd\u8f6c\u6bcf\u5bf9\u62ec\u53f7\u95f4\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1299","title":"K \u6b21\u4e32\u8054\u540e\u6700\u5927\u5b50\u6570\u7ec4\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1300","title":"\u67e5\u627e\u96c6\u7fa4\u5185\u7684\u300c\u5173\u952e\u8fde\u63a5\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1301","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u90e8\u95e8\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1302","title":"\u5220\u9664\u5b57\u7b26\u4f7f\u5b57\u7b26\u4e32\u53d8\u597d","__typename":"AppliedTranslationNode"},{"questionId":"1304","title":"\u6700\u957f\u5feb\u4e50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1305","title":"\u961f\u5217\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1306","title":"\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1307","title":"\u4e11\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1308","title":"\u4ea4\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1309","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1311","title":"\u6700\u5927\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1313","title":"\u7edf\u8ba1\u4e3a\u8681\u7fa4\u6784\u7b51\u623f\u95f4\u7684\u4e0d\u540c\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1316","title":"\u4ea4\u66ff\u6253\u5370\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1317","title":"\u6bcf\u6708\u4ea4\u6613 I","__typename":"AppliedTranslationNode"},{"questionId":"1318","title":"\u9526\u6807\u8d5b\u4f18\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1319","title":"\u72ec\u4e00\u65e0\u4e8c\u7684\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1320","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"1321","title":"\u5c3d\u53ef\u80fd\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1322","title":"\u7a7f\u8fc7\u8ff7\u5bab\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1324","title":"\u7403\u4f1a\u843d\u4f55\u5904","__typename":"AppliedTranslationNode"},{"questionId":"1325","title":"\u6982\u7387\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1326","title":"\u5411\u4e0b\u53d6\u6574\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1327","title":"\u6700\u540e\u4e00\u4e2a\u80fd\u8fdb\u5165\u7535\u68af\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1328","title":"\u6bcf\u6708\u4ea4\u6613II","__typename":"AppliedTranslationNode"},{"questionId":"1329","title":"\u73a9\u7b79\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1330","title":"\u6700\u957f\u5b9a\u5dee\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1331","title":"\u9ec4\u91d1\u77ff\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"1332","title":"\u7edf\u8ba1\u5143\u97f3\u5b57\u6bcd\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1336","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1337","title":"\u8bbe\u8ba1\u8df3\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1338","title":"\u67e5\u8be2\u7ed3\u679c\u7684\u8d28\u91cf\u548c\u5360\u6bd4","__typename":"AppliedTranslationNode"},{"questionId":"1339","title":"\u67e5\u8be2\u7403\u961f\u79ef\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1340","title":"\u54f2\u5b66\u5bb6\u8fdb\u9910","__typename":"AppliedTranslationNode"},{"questionId":"1341","title":"\u5206\u5272\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1342","title":"\u53ef\u4ee5\u653b\u51fb\u56fd\u738b\u7684\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"1343","title":"\u63b7\u9ab0\u5b50\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"1344","title":"\u6700\u5927\u76f8\u7b49\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1345","title":"\u5b57\u7b26\u4e32\u7684\u5de6\u53f3\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1349","title":"\u7f00\u70b9\u6210\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1350","title":"\u5220\u9664\u5b50\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"1351","title":"\u66ff\u6362\u5b50\u4e32\u5f97\u5230\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1352","title":"\u89c4\u5212\u517c\u804c\u5de5\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1357","title":"\u62a5\u544a\u7cfb\u7edf\u72b6\u6001\u7684\u8fde\u7eed\u65e5\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1358","title":"\u627e\u51fa\u7ed9\u5b9a\u65b9\u7a0b\u7684\u6b63\u6574\u6570\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"1359","title":"\u5faa\u73af\u7801\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1360","title":"\u4e32\u8054\u5b57\u7b26\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1361","title":"\u94fa\u74f7\u7816","__typename":"AppliedTranslationNode"},{"questionId":"1362","title":"\u98de\u673a\u5ea7\u4f4d\u5206\u914d\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1364","title":"\u540c\u79ef\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1366","title":"\u7b2c\u4e00\u4e2a\u552f\u4e00\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1367","title":"\u5806\u53e0\u957f\u65b9\u4f53\u7684\u6700\u5927\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1368","title":"\u591a\u7ebf\u7a0b\u7f51\u9875\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1369","title":"\u4ea4\u6362\u5b57\u7b26\u4f7f\u5f97\u5b57\u7b26\u4e32\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"1370","title":"\u7edf\u8ba1\u300c\u4f18\u7f8e\u5b50\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1371","title":"\u79fb\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1372","title":"\u68c0\u67e5\u300c\u597d\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1374","title":"\u81f3\u5c11\u6709\u4e00\u4e2a 1 \u7684\u6700\u5de6\u7aef\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1377","title":"\u6bcf\u4e2a\u5e16\u5b50\u7684\u8bc4\u8bba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1378","title":"\u5947\u6570\u503c\u5355\u5143\u683c\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1379","title":"\u91cd\u6784 2 \u884c\u4e8c\u8fdb\u5236\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1380","title":"\u7edf\u8ba1\u5c01\u95ed\u5c9b\u5c7f\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1381","title":"\u5f97\u5206\u6700\u9ad8\u7684\u5355\u8bcd\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1384","title":"\u627e\u51fa\u9002\u5e94\u5c4f\u5e55\u7684\u6700\u5927\u5b57\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1386","title":"\u4e8c\u7ef4\u7f51\u683c\u8fc1\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1387","title":"\u5728\u53d7\u6c61\u67d3\u7684\u4e8c\u53c9\u6811\u4e2d\u67e5\u627e\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1388","title":"\u53ef\u88ab\u4e09\u6574\u9664\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1389","title":"\u63a8\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1390","title":"\u5e73\u5747\u552e\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1391","title":"\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1395","title":"\u8bbf\u95ee\u6240\u6709\u70b9\u7684\u6700\u5c0f\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1396","title":"\u7edf\u8ba1\u53c2\u4e0e\u901a\u4fe1\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1397","title":"\u641c\u7d22\u63a8\u8350\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1398","title":"\u505c\u5728\u539f\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1399","title":"\u9875\u9762\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1400","title":"\u627e\u51fa\u4e95\u5b57\u68cb\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1401","title":"\u4e0d\u6d6a\u8d39\u539f\u6599\u7684\u6c49\u5821\u5236\u4f5c\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1402","title":"\u7edf\u8ba1\u5168\u4e3a 1 \u7684\u6b63\u65b9\u5f62\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1403","title":"\u5206\u5272\u56de\u6587\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1404","title":"\u9006\u5e8f\u6253\u5370\u4e0d\u53ef\u53d8\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1405","title":"\u5411\u516c\u53f8CEO\u6c47\u62a5\u5de5\u4f5c\u7684\u6240\u6709\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1406","title":"\u6574\u6570\u7684\u5404\u4f4d\u79ef\u548c\u4e4b\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1407","title":"\u7528\u6237\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1408","title":"\u4f7f\u7ed3\u679c\u4e0d\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c0f\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1409","title":"\u8f6c\u5316\u4e3a\u5168\u96f6\u77e9\u9635\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1410","title":"\u7ea2\u7eff\u706f\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1411","title":"\u4e8c\u8fdb\u5236\u94fe\u8868\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1413","title":"\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u6b63\u65b9\u5f62\u7684\u6700\u5927\u8fb9\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1414","title":"\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1415","title":"\u5b66\u751f\u4eec\u53c2\u52a0\u5404\u79d1\u6d4b\u8bd5\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1420","title":"\u627e\u5230\u8fde\u7eed\u533a\u95f4\u7684\u5f00\u59cb\u548c\u7ed3\u675f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1421","title":"\u7edf\u8ba1\u4f4d\u6570\u4e3a\u5076\u6570\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1422","title":"\u5212\u5206\u6570\u7ec4\u4e3a\u8fde\u7eed\u6570\u5b57\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1423","title":"\u5b50\u4e32\u7684\u6700\u5927\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1424","title":"\u4f60\u80fd\u4ece\u76d2\u5b50\u91cc\u83b7\u5f97\u7684\u6700\u5927\u7cd6\u679c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1425","title":"\u4e0d\u540c\u56fd\u5bb6\u7684\u5929\u6c14\u7c7b\u578b","__typename":"AppliedTranslationNode"},{"questionId":"1426","title":"\u548c\u4e3a\u96f6\u7684N\u4e2a\u552f\u4e00\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1427","title":"\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u6240\u6709\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1428","title":"\u8df3\u8dc3\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1429","title":"\u53e3\u7b97\u96be\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1432","title":"\u5224\u65ad\u7ed9\u5b9a\u7684\u5e8f\u5217\u662f\u5426\u662f\u4e8c\u53c9\u6811\u4ece\u6839\u5230\u53f6\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1434","title":"\u89e3\u7801\u5b57\u6bcd\u5230\u6574\u6570\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1435","title":"\u5b50\u6570\u7ec4\u5f02\u6216\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1436","title":"\u83b7\u53d6\u4f60\u597d\u53cb\u5df2\u89c2\u770b\u7684\u89c6\u9891","__typename":"AppliedTranslationNode"},{"questionId":"1437","title":"\u8ba9\u5b57\u7b26\u4e32\u6210\u4e3a\u56de\u6587\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1438","title":"\u6c42\u56e2\u961f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1439","title":"\u4e0d\u540c\u6027\u522b\u6bcf\u65e5\u5206\u6570\u603b\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1440","title":"\u5c06\u6574\u6570\u8f6c\u6362\u4e3a\u4e24\u4e2a\u65e0\u96f6\u6574\u6570\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1441","title":"\u6216\u8fd0\u7b97\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1442","title":"\u8fde\u901a\u7f51\u7edc\u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1443","title":"\u4e8c\u6307\u8f93\u5165\u7684\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1444","title":"\u5c06\u6570\u5b57\u53d8\u6210 0 \u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1445","title":"\u5927\u5c0f\u4e3a K \u4e14\u5e73\u5747\u503c\u5927\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1446","title":"\u65f6\u949f\u6307\u9488\u7684\u5939\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"1447","title":"\u8df3\u8dc3\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1448","title":"6 \u548c 9 \u7ec4\u6210\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1449","title":"\u7ad6\u76f4\u6253\u5370\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1450","title":"\u5220\u9664\u7ed9\u5b9a\u503c\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1451","title":"\u704c\u6e89\u82b1\u56ed\u7684\u6700\u5c11\u6c34\u9f99\u5934\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1452","title":"\u9910\u9986\u8425\u4e1a\u989d\u53d8\u5316\u589e\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1453","title":"\u5e7f\u544a\u6548\u679c","__typename":"AppliedTranslationNode"},{"questionId":"1454","title":"\u5220\u9664\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1455","title":"\u9910\u5385\u8fc7\u6ee4\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1456","title":"\u9608\u503c\u8ddd\u79bb\u5185\u90bb\u5c45\u6700\u5c11\u7684\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1457","title":"\u5de5\u4f5c\u8ba1\u5212\u7684\u6700\u4f4e\u96be\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1458","title":"\u6839\u636e\u6570\u5b57\u4e8c\u8fdb\u5236\u4e0b 1 \u7684\u6570\u76ee\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1459","title":"\u6bcf\u9694 n \u4e2a\u987e\u5ba2\u6253\u6298","__typename":"AppliedTranslationNode"},{"questionId":"1460","title":"\u5305\u542b\u6240\u6709\u4e09\u79cd\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1461","title":"\u6709\u6548\u7684\u5feb\u9012\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1462","title":"\u5217\u51fa\u6307\u5b9a\u65f6\u95f4\u6bb5\u5185\u6240\u6709\u7684\u4e0b\u5355\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1463","title":"\u77e9\u9635\u4e2d\u6218\u6597\u529b\u6700\u5f31\u7684 K \u884c","__typename":"AppliedTranslationNode"},{"questionId":"1464","title":"\u6570\u7ec4\u5927\u5c0f\u51cf\u534a","__typename":"AppliedTranslationNode"},{"questionId":"1465","title":"\u5206\u88c2\u4e8c\u53c9\u6811\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1466","title":"\u8df3\u8dc3\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1467","title":"\u6bcf\u6b21\u8bbf\u95ee\u7684\u4ea4\u6613\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1468","title":"\u68c0\u67e5\u6574\u6570\u53ca\u5176\u4e24\u500d\u6570\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1469","title":"\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1470","title":"\u63a8\u6587\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1471","title":"\u53c2\u52a0\u8003\u8bd5\u7684\u6700\u5927\u5b66\u751f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1472","title":"\u4e0a\u5347\u4e0b\u964d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1473","title":"\u6bcf\u4e2a\u5143\u97f3\u5305\u542b\u5076\u6570\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1474","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u957f\u4ea4\u9519\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1475","title":"\u4e8c\u53c9\u641c\u7d22\u5b50\u6811\u7684\u6700\u5927\u952e\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1476","title":"\u7edf\u8ba1\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u8d1f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1477","title":"\u6700\u540e K \u4e2a\u6570\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1478","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1479","title":"\u591a\u6b21\u6c42\u548c\u6784\u9020\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1480","title":"\u7535\u5f71\u8bc4\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1481","title":"\u9662\u7cfb\u65e0\u6548\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1482","title":"\u6709\u591a\u5c11\u5c0f\u4e8e\u5f53\u524d\u6570\u5b57\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1483","title":"\u901a\u8fc7\u6295\u7968\u5bf9\u56e2\u961f\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1484","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1485","title":"\u4f7f\u7f51\u683c\u56fe\u81f3\u5c11\u6709\u4e00\u6761\u6709\u6548\u8def\u5f84\u7684\u6700\u5c0f\u4ee3\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1486","title":"\u4e24\u4e2a\u6570\u7ec4\u95f4\u7684\u8ddd\u79bb\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1487","title":"\u5b89\u6392\u7535\u5f71\u9662\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1488","title":"\u5c06\u6574\u6570\u6309\u6743\u91cd\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1489","title":"3n \u5757\u62ab\u8428","__typename":"AppliedTranslationNode"},{"questionId":"1490","title":"\u751f\u6210\u6bcf\u79cd\u5b57\u7b26\u90fd\u662f\u5947\u6570\u4e2a\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1491","title":"\u706f\u6ce1\u5f00\u5173 III","__typename":"AppliedTranslationNode"},{"questionId":"1492","title":"\u901a\u77e5\u6240\u6709\u5458\u5de5\u6240\u9700\u7684\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1493","title":"T \u79d2\u540e\u9752\u86d9\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1494","title":"\u6d3b\u52a8\u53c2\u4e0e\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1495","title":"\u987e\u5ba2\u7684\u53ef\u4fe1\u8054\u7cfb\u4eba\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1496","title":"\u77e9\u9635\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1497","title":"\u8bbe\u8ba1\u4e00\u4e2a\u652f\u6301\u589e\u91cf\u64cd\u4f5c\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1498","title":"\u627e\u51fa\u514b\u9686\u4e8c\u53c9\u6811\u4e2d\u7684\u76f8\u540c\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1499","title":"\u6700\u5927\u7684\u56e2\u961f\u8868\u73b0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1500","title":"\u7edf\u8ba1\u6700\u5927\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1501","title":"\u5706\u548c\u77e9\u5f62\u662f\u5426\u6709\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"1502","title":"\u6784\u9020 K \u4e2a\u56de\u6587\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1503","title":"\u505a\u83dc\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1504","title":"\u83b7\u53d6\u6700\u8fd1\u7b2c\u4e8c\u6b21\u7684\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1505","title":"\u6309\u65e2\u5b9a\u987a\u5e8f\u521b\u5efa\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1507","title":"\u68c0\u67e5\u7f51\u683c\u4e2d\u662f\u5426\u5b58\u5728\u6709\u6548\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1508","title":"\u6700\u957f\u5feb\u4e50\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1509","title":"\u4f7f\u7528\u552f\u4e00\u6807\u8bc6\u7801\u66ff\u6362\u5458\u5de5ID","__typename":"AppliedTranslationNode"},{"questionId":"1510","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1511","title":"\u7edf\u8ba1\u4f5c\u6218\u5355\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1512","title":"\u8bbe\u8ba1\u5730\u94c1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1513","title":"\u627e\u5230\u6240\u6709\u597d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1514","title":"\u9010\u6b65\u6c42\u548c\u5f97\u5230\u6b63\u6570\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1515","title":"\u548c\u4e3a K \u7684\u6700\u5c11\u6590\u6ce2\u90a3\u5951\u6570\u5b57\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1516","title":"\u957f\u5ea6\u4e3a n \u7684\u5f00\u5fc3\u5b57\u7b26\u4e32\u4e2d\u5b57\u5178\u5e8f\u7b2c k \u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1517","title":"\u6062\u590d\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1518","title":"\u6309\u5e74\u5ea6\u5217\u51fa\u9500\u552e\u603b\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1519","title":"\u975e\u9012\u589e\u987a\u5e8f\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1520","title":"\u5c06\u4e8c\u8fdb\u5236\u8868\u793a\u51cf\u5230 1 \u7684\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1522","title":"\u77f3\u5b50\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1523","title":"\u80a1\u7968\u7684\u8d44\u672c\u635f\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"1524","title":"\u6570\u7ec4\u4e2d\u7684\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1525","title":"\u67e5\u8be2\u5e26\u952e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1526","title":"HTML \u5b9e\u4f53\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1527","title":"\u7ed9 N x 3 \u7f51\u683c\u56fe\u6d82\u8272\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1528","title":"\u62e5\u6709\u6700\u591a\u7cd6\u679c\u7684\u5b69\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1529","title":"\u6539\u53d8\u4e00\u4e2a\u6574\u6570\u80fd\u5f97\u5230\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1530","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u6253\u7834\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1531","title":"\u6bcf\u4e2a\u4eba\u6234\u4e0d\u540c\u5e3d\u5b50\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1532","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1533","title":"\u70b9\u83dc\u5c55\u793a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1534","title":"\u6570\u9752\u86d9","__typename":"AppliedTranslationNode"},{"questionId":"1535","title":"\u751f\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1536","title":"\u8d2d\u4e70\u4e86\u4ea7\u54c1 A \u548c\u4ea7\u54c1 B \u5374\u6ca1\u6709\u8d2d\u4e70\u4ea7\u54c1 C \u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1537","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1538","title":"\u53ef\u83b7\u5f97\u7684\u6700\u5927\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1539","title":"\u5bf9\u89d2\u7ebf\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"1541","title":"\u6392\u540d\u9760\u524d\u7684\u65c5\u884c\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1542","title":"\u8fde\u7eed\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1543","title":"\u6700\u7b80\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1544","title":"\u7edf\u8ba1\u4e8c\u53c9\u6811\u4e2d\u597d\u8282\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1545","title":"\u6570\u4f4d\u6210\u672c\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1546","title":"\u67e5\u627e\u6210\u7ee9\u5904\u4e8e\u4e2d\u6e38\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1547","title":"\u65c5\u884c\u7ec8\u70b9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"1548","title":"\u662f\u5426\u6240\u6709 1 \u90fd\u81f3\u5c11\u76f8\u9694 k \u4e2a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1549","title":"\u7edd\u5bf9\u5dee\u4e0d\u8d85\u8fc7\u9650\u5236\u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1550","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u7b2c k \u4e2a\u6700\u5c0f\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1551","title":"\u51c0\u73b0\u503c\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1552","title":"\u7528\u6808\u64cd\u4f5c\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1553","title":"\u5f62\u6210\u4e24\u4e2a\u5f02\u6216\u76f8\u7b49\u6570\u7ec4\u7684\u4e09\u5143\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1554","title":"\u6536\u96c6\u6811\u4e0a\u6240\u6709\u82f9\u679c\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1555","title":"\u5207\u62ab\u8428\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1556","title":"\u901a\u8fc7\u7ffb\u8f6c\u5b50\u6570\u7ec4\u4f7f\u4e24\u4e2a\u6570\u7ec4\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1557","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u5305\u542b\u6240\u6709\u957f\u5ea6\u4e3a K \u7684\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1558","title":"\u8bfe\u7a0b\u8868 IV","__typename":"AppliedTranslationNode"},{"questionId":"1559","title":"\u6458\u6a31\u6843 II","__typename":"AppliedTranslationNode"},{"questionId":"1560","title":"\u5728\u65e2\u5b9a\u65f6\u95f4\u505a\u4f5c\u4e1a\u7684\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1561","title":"\u91cd\u65b0\u6392\u5217\u53e5\u5b50\u4e2d\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1562","title":"\u6536\u85cf\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1563","title":"\u5706\u5f62\u9776\u5185\u7684\u6700\u5927\u98de\u9556\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1564","title":"\u5236\u4f5c\u4f1a\u8bdd\u67f1\u72b6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1565","title":"\u8ba1\u7b97\u5e03\u5c14\u8868\u8fbe\u5f0f\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1566","title":"\u68c0\u67e5\u5355\u8bcd\u662f\u5426\u4e3a\u53e5\u4e2d\u5176\u4ed6\u5355\u8bcd\u7684\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1567","title":"\u5b9a\u957f\u5b50\u4e32\u4e2d\u5143\u97f3\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1568","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u4f2a\u56de\u6587\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1569","title":"\u4e24\u4e2a\u5b50\u5e8f\u5217\u7684\u6700\u5927\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1570","title":"\u5546\u54c1\u6298\u6263\u540e\u7684\u6700\u7ec8\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1571","title":"\u5b89\u6392\u90ae\u7b52","__typename":"AppliedTranslationNode"},{"questionId":"1572","title":"\u5b50\u77e9\u5f62\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1573","title":"\u627e\u4e24\u4e2a\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1574","title":"\u6570\u7ec4\u4e2d\u4e24\u5143\u7d20\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1575","title":"\u5207\u5272\u540e\u9762\u79ef\u6700\u5927\u7684\u86cb\u7cd5","__typename":"AppliedTranslationNode"},{"questionId":"1576","title":"\u91cd\u65b0\u89c4\u5212\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1577","title":"\u4e24\u4e2a\u76d2\u5b50\u4e2d\u7403\u7684\u989c\u8272\u6570\u76f8\u540c\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1578","title":"\u82f9\u679c\u548c\u6854\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1579","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1580","title":"\u91cd\u65b0\u6392\u5217\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1581","title":"\u6570\u7ec4\u4e2d\u7684 k \u4e2a\u6700\u5f3a\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1582","title":"\u8bbe\u8ba1\u6d4f\u89c8\u5668\u5386\u53f2\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1583","title":"\u7c89\u5237\u623f\u5b50 III","__typename":"AppliedTranslationNode"},{"questionId":"1584","title":"\u53bb\u6389\u6700\u4f4e\u5de5\u8d44\u548c\u6700\u9ad8\u5de5\u8d44\u540e\u7684\u5de5\u8d44\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1585","title":"n \u7684\u7b2c k \u4e2a\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1586","title":"\u5220\u6389\u4e00\u4e2a\u5143\u7d20\u4ee5\u540e\u5168\u4e3a 1 \u7684\u6700\u957f\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1587","title":"\u5e76\u884c\u8bfe\u7a0b II","__typename":"AppliedTranslationNode"},{"questionId":"1603","title":"\u4e00\u7ef4\u6570\u7ec4\u7684\u52a8\u6001\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1604","title":"\u4e0d\u540c\u6574\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1605","title":"\u5236\u4f5c m \u675f\u82b1\u6240\u9700\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1607","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1608","title":"\u8ba1\u7b97\u7a0e\u540e\u5de5\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"1609","title":"\u5bfb\u627e\u6240\u6709\u7684\u72ec\u751f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1610","title":"\u6570\u7ec4\u5f02\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1611","title":"\u4fdd\u8bc1\u6587\u4ef6\u540d\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"1612","title":"\u907f\u514d\u6d2a\u6c34\u6cdb\u6ee5","__typename":"AppliedTranslationNode"},{"questionId":"1613","title":"\u627e\u5230\u6700\u5c0f\u751f\u6210\u6811\u91cc\u7684\u5173\u952e\u8fb9\u548c\u4f2a\u5173\u952e\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1615","title":"\u5b50\u6570\u7ec4\u548c\u6392\u5e8f\u540e\u7684\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1616","title":"\u4e09\u6b21\u64cd\u4f5c\u540e\u6700\u5927\u503c\u4e0e\u6700\u5c0f\u503c\u7684\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1617","title":"\u77f3\u5b50\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1618","title":"\u5220\u9664\u94fe\u8868 M \u4e2a\u8282\u70b9\u4e4b\u540e\u7684 N \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1619","title":"\u5224\u65ad\u8def\u5f84\u662f\u5426\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1620","title":"\u68c0\u67e5\u6570\u7ec4\u5bf9\u662f\u5426\u53ef\u4ee5\u88ab k \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1621","title":"\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1622","title":"\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1623","title":"\u5468\u5185\u6bcf\u5929\u7684\u9500\u552e\u60c5\u51b5","__typename":"AppliedTranslationNode"},{"questionId":"1624","title":"\u514b\u9686\u542b\u968f\u673a\u6307\u9488\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1625","title":"\u6309\u65e5\u671f\u5206\u7ec4\u9500\u552e\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1626","title":"\u5224\u65ad\u80fd\u5426\u5f62\u6210\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1627","title":"\u6240\u6709\u8682\u8681\u6389\u4e0b\u6765\u524d\u7684\u6700\u540e\u4e00\u523b","__typename":"AppliedTranslationNode"},{"questionId":"1628","title":"\u7edf\u8ba1\u5168 1 \u5b50\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1629","title":"\u6700\u591a K \u6b21\u4ea4\u6362\u76f8\u90bb\u6570\u4f4d\u540e\u5f97\u5230\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1630","title":"\u5728\u533a\u95f4\u8303\u56f4\u5185\u7edf\u8ba1\u5947\u6570\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1631","title":"\u548c\u4e3a\u5947\u6570\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1632","title":"\u5b57\u7b26\u4e32\u7684\u597d\u5206\u5272\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1633","title":"\u5f62\u6210\u76ee\u6807\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6700\u5c11\u589e\u52a0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1634","title":"\u514b\u9686 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1635","title":"\u597d\u6570\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1636","title":"\u4ec5\u542b 1 \u7684\u5b50\u4e32\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1637","title":"\u538b\u7f29\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"1638","title":"\u670d\u52a1\u4e2d\u5fc3\u7684\u6700\u4f73\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1639","title":"\u4e0a\u6708\u64ad\u653e\u7684\u513f\u7ae5\u9002\u5b9c\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"1640","title":"\u8bbe\u8ba1\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1641","title":"\u53ef\u4ee5\u653e\u5fc3\u6295\u8d44\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1642","title":"\u6362\u9152\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1643","title":"\u5b50\u6811\u4e2d\u6807\u7b7e\u76f8\u540c\u7684\u8282\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1644","title":"\u6700\u591a\u7684\u4e0d\u91cd\u53e0\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1645","title":"\u627e\u5230\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u51fd\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1646","title":"\u7b2c k \u4e2a\u7f3a\u5931\u7684\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1647","title":"K \u6b21\u64cd\u4f5c\u8f6c\u53d8\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1648","title":"\u5e73\u8861\u62ec\u53f7\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1649","title":"\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u975e\u7a7a\u5b50\u6570\u7ec4\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1650","title":"\u627e\u5230 N \u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1651","title":"\u91cd\u65b0\u6392\u5217\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1652","title":"\u706f\u6ce1\u5f00\u5173 IV","__typename":"AppliedTranslationNode"},{"questionId":"1653","title":"\u597d\u53f6\u5b50\u8282\u70b9\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1654","title":"\u6d88\u8d39\u8005\u4e0b\u5355\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1655","title":"\u79fb\u52a8 N \u53c9\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1656","title":"\u7edf\u8ba1\u597d\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1657","title":"\u627e\u51fa\u6570\u7ec4\u6e38\u620f\u7684\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1658","title":"\u6392\u5e03\u4e8c\u8fdb\u5236\u7f51\u683c\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1659","title":"\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1660","title":"\u5343\u4f4d\u5206\u9694\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1661","title":"\u53ef\u4ee5\u5230\u8fbe\u6240\u6709\u70b9\u7684\u6700\u5c11\u70b9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1662","title":"\u5f97\u5230\u76ee\u6807\u6570\u7ec4\u7684\u6700\u5c11\u51fd\u6570\u8c03\u7528\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1663","title":"\u4e8c\u7ef4\u7f51\u683c\u56fe\u4e2d\u63a2\u6d4b\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1664","title":"\u67e5\u627e\u62e5\u6709\u6709\u6548\u90ae\u7bb1\u7684\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1665","title":"N \u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1666","title":"\u6574\u7406\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1667","title":"\u627e\u51fa\u7b2c N \u4e2a\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c K \u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1668","title":"\u627e\u51fa\u6700\u957f\u7684\u8d85\u8d5e\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1669","title":"\u5207\u68cd\u5b50\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1670","title":"\u60a3\u67d0\u79cd\u75be\u75c5\u7684\u60a3\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1671","title":"\u6700\u8fd1\u7684\u4e09\u7b14\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1672","title":"\u627e\u5230\u6700\u5927\u6574\u6570\u7684\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"1674","title":"\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1675","title":"\u4e24\u7403\u4e4b\u95f4\u7684\u78c1\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1676","title":"\u5403\u6389 N \u4e2a\u6a58\u5b50\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1677","title":"\u77e9\u9635\u5bf9\u89d2\u7ebf\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1678","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1679","title":"\u5220\u9664\u6700\u77ed\u7684\u5b50\u6570\u7ec4\u4f7f\u5269\u4f59\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1680","title":"\u7edf\u8ba1\u6240\u6709\u53ef\u884c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1681","title":"\u627e\u51fa\u9690\u85cf\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1682","title":"\u5706\u5f62\u8d5b\u9053\u4e0a\u7ecf\u8fc7\u6b21\u6570\u6700\u591a\u7684\u6247\u533a","__typename":"AppliedTranslationNode"},{"questionId":"1683","title":"\u4f60\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1684","title":"\u67e5\u627e\u5927\u5c0f\u4e3a M \u7684\u6700\u65b0\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1685","title":"\u77f3\u5b50\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1686","title":"\u4ea7\u54c1\u540d\u79f0\u683c\u5f0f\u4fee\u590d","__typename":"AppliedTranslationNode"},{"questionId":"1687","title":"\u56fe\u4e2d\u6700\u76f8\u4f3c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1688","title":"\u6bcf\u4ef6\u5546\u54c1\u7684\u6700\u65b0\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1689","title":"\u91cd\u590d\u81f3\u5c11 K \u6b21\u4e14\u957f\u5ea6\u4e3a M \u7684\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1690","title":"\u4e58\u79ef\u4e3a\u6b63\u6570\u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1691","title":"\u4f7f\u9646\u5730\u5206\u79bb\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1692","title":"\u5c06\u5b50\u6570\u7ec4\u91cd\u65b0\u6392\u5e8f\u5f97\u5230\u540c\u4e00\u4e2a\u4e8c\u53c9\u67e5\u627e\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1693","title":"\u6240\u6709\u5947\u6570\u957f\u5ea6\u5b50\u6570\u7ec4\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1694","title":"\u4f7f\u6570\u7ec4\u548c\u80fd\u88ab P \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1695","title":"\u6240\u6709\u6392\u5217\u4e2d\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1696","title":"\u5947\u602a\u7684\u6253\u5370\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"1697","title":"\u53ea\u6709\u4e00\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1698","title":"\u66ff\u6362\u6240\u6709\u7684\u95ee\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1699","title":"\u6570\u7684\u5e73\u65b9\u7b49\u4e8e\u4e24\u6570\u4e58\u79ef\u7684\u65b9\u6cd5\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1700","title":"\u907f\u514d\u91cd\u590d\u5b57\u6bcd\u7684\u6700\u5c0f\u5220\u9664\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1701","title":"\u4fdd\u8bc1\u56fe\u53ef\u5b8c\u5168\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1702","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981","__typename":"AppliedTranslationNode"},{"questionId":"1703","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc I","__typename":"AppliedTranslationNode"},{"questionId":"1704","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u7279\u6b8a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1705","title":"\u7edf\u8ba1\u4e0d\u5f00\u5fc3\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"1706","title":"\u8fde\u63a5\u6240\u6709\u70b9\u7684\u6700\u5c0f\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1707","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u901a\u8fc7\u6392\u5e8f\u5b50\u5b57\u7b26\u4e32\u5f97\u5230\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1708","title":"\u8bbe\u8ba1\u505c\u8f66\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1709","title":"\u8b66\u544a\u4e00\u5c0f\u65f6\u5185\u4f7f\u7528\u76f8\u540c\u5458\u5de5\u5361\u5927\u4e8e\u7b49\u4e8e\u4e09\u6b21\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1710","title":"\u627e\u5230\u5904\u7406\u6700\u591a\u8bf7\u6c42\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1711","title":"\u7ed9\u5b9a\u884c\u548c\u5217\u7684\u548c\u6c42\u53ef\u884c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1712","title":"\u6309\u6708\u7edf\u8ba1\u8ba2\u5355\u6570\u4e0e\u987e\u5ba2\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1713","title":"\u4e24\u4e2a\u7a00\u758f\u5411\u91cf\u7684\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1714","title":"\u91cd\u65b0\u6392\u5217\u5355\u8bcd\u95f4\u7684\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1715","title":"\u62c6\u5206\u5b57\u7b26\u4e32\u4f7f\u552f\u4e00\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee\u6700\u5927","__typename":"AppliedTranslationNode"},{"questionId":"1716","title":"\u77e9\u9635\u7684\u6700\u5927\u975e\u8d1f\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1717","title":"\u8fde\u901a\u4e24\u7ec4\u70b9\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1718","title":"\u4ed3\u5e93\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1719","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc II","__typename":"AppliedTranslationNode"},{"questionId":"1720","title":"\u6587\u4ef6\u5939\u64cd\u4f5c\u65e5\u5fd7\u641c\u96c6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1721","title":"\u7ecf\u8425\u6469\u5929\u8f6e\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"1722","title":"\u7687\u4f4d\u7ee7\u627f\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1723","title":"\u6700\u591a\u53ef\u8fbe\u6210\u7684\u6362\u697c\u8bf7\u6c42\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1724","title":"\u8fdb\u5e97\u5374\u672a\u8fdb\u884c\u8fc7\u4ea4\u6613\u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1725","title":"\u5927\u5c0f\u4e3a K \u7684\u4e0d\u91cd\u53e0\u7ebf\u6bb5\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1726","title":"\u7f51\u7edc\u4fe1\u53f7\u6700\u597d\u7684\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1727","title":"\u732b\u548c\u8001\u9f20 II","__typename":"AppliedTranslationNode"},{"questionId":"1728","title":"\u5947\u5999\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1729","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"1730","title":"\u7279\u6b8a\u6570\u7ec4\u7684\u7279\u5f81\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1731","title":"\u5947\u5076\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1732","title":"\u4f7f\u6574\u6570\u53d8\u4e3a 0 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1733","title":"\u53ef\u89c1\u70b9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1734","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981 II","__typename":"AppliedTranslationNode"},{"questionId":"1735","title":"\u6bcf\u4f4d\u987e\u5ba2\u6700\u7ecf\u5e38\u8ba2\u8d2d\u7684\u5546\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1736","title":"\u6839\u636e\u4e2d\u7f00\u8868\u8fbe\u5f0f\u6784\u9020\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1737","title":"\u62ec\u53f7\u7684\u6700\u5927\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1738","title":"\u6700\u5927\u7f51\u7edc\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1739","title":"\u5206\u5272\u4e24\u4e2a\u5b57\u7b26\u4e32\u5f97\u5230\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1740","title":"\u7edf\u8ba1\u5b50\u6811\u4e2d\u57ce\u5e02\u4e4b\u95f4\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1741","title":"\u6309\u7167\u9891\u7387\u5c06\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1742","title":"\u4e24\u70b9\u4e4b\u95f4\u4e0d\u5305\u542b\u4efb\u4f55\u70b9\u7684\u6700\u5bbd\u5782\u76f4\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1743","title":"\u7edf\u8ba1\u53ea\u5dee\u4e00\u4e2a\u5b57\u7b26\u7684\u5b50\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1744","title":"\u901a\u8fc7\u7ed9\u5b9a\u8bcd\u5178\u6784\u9020\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1745","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u6700\u8fd1\u7684\u53f3\u4fa7\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1746","title":"\u4e24\u4e2a\u76f8\u540c\u5b57\u7b26\u4e4b\u95f4\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1747","title":"\u6267\u884c\u64cd\u4f5c\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1748","title":"\u65e0\u77db\u76fe\u7684\u6700\u4f73\u7403\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1749","title":"\u6ca1\u6709\u5356\u51fa\u7684\u5356\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1750","title":"\u68c0\u67e5\u4e24\u68f5\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811\u662f\u5426\u7b49\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1751","title":"\u6309\u952e\u6301\u7eed\u65f6\u95f4\u6700\u957f\u7684\u952e","__typename":"AppliedTranslationNode"},{"questionId":"1752","title":"\u7b49\u5dee\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1753","title":"\u6700\u5c0f\u4f53\u529b\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1755","title":"\u62c6\u70b8\u5f39","__typename":"AppliedTranslationNode"},{"questionId":"1756","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1757","title":"\u5230\u5bb6\u7684\u6700\u5c11\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1758","title":"\u5206\u914d\u91cd\u590d\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1759","title":"\u627e\u5230\u9057\u5931\u7684ID","__typename":"AppliedTranslationNode"},{"questionId":"1760","title":"\u80fd\u5426\u8fde\u63a5\u5f62\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1761","title":"\u7edf\u8ba1\u5b57\u5178\u5e8f\u5143\u97f3\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1762","title":"\u53ef\u4ee5\u5230\u8fbe\u7684\u6700\u8fdc\u5efa\u7b51","__typename":"AppliedTranslationNode"},{"questionId":"1763","title":"\u4e09\u4eba\u56fd\u5bb6\u4ee3\u8868\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1764","title":"\u6700\u5927\u91cd\u590d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1765","title":"\u5408\u5e76\u4e24\u4e2a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1766","title":"\u5f97\u5230\u5c71\u5f62\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1767","title":"\u8bbe\u8ba1\u524d\u4e2d\u540e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1768","title":"\u8bbe\u8ba1\u5e26\u89e3\u6790\u51fd\u6570\u7684\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1769","title":"\u83b7\u53d6\u751f\u6210\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1770","title":"\u5b57\u7b26\u9891\u6b21\u552f\u4e00\u7684\u6700\u5c0f\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1771","title":"\u9500\u552e\u4ef7\u503c\u51cf\u5c11\u7684\u989c\u8272\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1772","title":"\u901a\u8fc7\u6307\u4ee4\u521b\u5efa\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1773","title":"\u5404\u8d5b\u4e8b\u7684\u7528\u6237\u6ce8\u518c\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1774","title":"\u6c42\u4e24\u4e2a\u591a\u9879\u5f0f\u94fe\u8868\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1775","title":"\u8bbe\u8ba1\u6709\u5e8f\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1776","title":"\u5c06 x \u51cf\u5230 0 \u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1777","title":"\u786e\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u63a5\u8fd1","__typename":"AppliedTranslationNode"},{"questionId":"1778","title":"\u6700\u5927\u5316\u7f51\u683c\u5e78\u798f\u611f","__typename":"AppliedTranslationNode"},{"questionId":"1779","title":"Hopper \u516c\u53f8\u67e5\u8be2 I","__typename":"AppliedTranslationNode"},{"questionId":"1780","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 II","__typename":"AppliedTranslationNode"},{"questionId":"1781","title":"\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u6570\u7ec4\u662f\u5426\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1782","title":"\u5177\u6709\u7ed9\u5b9a\u6570\u503c\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1783","title":"\u751f\u6210\u5e73\u8861\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1784","title":"\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u521d\u59cb\u80fd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1786","title":"\u7edf\u8ba1\u4e00\u81f4\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1787","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u5dee\u7edd\u5bf9\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1788","title":"\u77f3\u5b50\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1789","title":"\u4ece\u4ed3\u5e93\u5230\u7801\u5934\u8fd0\u8f93\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1790","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 III","__typename":"AppliedTranslationNode"},{"questionId":"1791","title":"\u6700\u5bcc\u6709\u5ba2\u6237\u7684\u8d44\u4ea7\u603b\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1792","title":"\u627e\u51fa\u6700\u5177\u7ade\u4e89\u529b\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1793","title":"\u4f7f\u6570\u7ec4\u4e92\u8865\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1794","title":"\u6570\u7ec4\u7684\u6700\u5c0f\u504f\u79fb\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1796","title":"\u7ea0\u6b63\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1797","title":"\u8bbe\u8ba1 Goal \u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1798","title":"K \u548c\u6570\u5bf9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1799","title":"\u6700\u5c0f\u4e0d\u517c\u5bb9\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1800","title":"\u8fde\u63a5\u8fde\u7eed\u4e8c\u8fdb\u5236\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1801","title":"\u6bcf\u53f0\u673a\u5668\u7684\u8fdb\u7a0b\u5e73\u5747\u8fd0\u884c\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1802","title":"\u65e0\u6cd5\u5403\u5348\u9910\u7684\u5b66\u751f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1803","title":"\u5e73\u5747\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1804","title":"\u4fee\u6539\u540e\u7684\u6700\u5927\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1805","title":"\u5f97\u5230\u8fde\u7eed K \u4e2a 1 \u7684\u6700\u5c11\u76f8\u90bb\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1806","title":"\u6bd4\u8d5b\u4e2d\u7684\u914d\u5bf9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1807","title":"\u5341-\u4e8c\u8fdb\u5236\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1808","title":"\u77f3\u5b50\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"1809","title":"\u6570\u7ec4\u4e2d\u7279\u6b8a\u7b49\u95f4\u8ddd\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1810","title":"\u6539\u53d8\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1811","title":"\u4fee\u590d\u8868\u4e2d\u7684\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1812","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1813","title":"\u5220\u9664\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1814","title":"\u8df3\u8dc3\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1815","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1816","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 IV","__typename":"AppliedTranslationNode"},{"questionId":"1817","title":"\u8ba1\u7b97\u529b\u6263\u94f6\u884c\u7684\u94b1","__typename":"AppliedTranslationNode"},{"questionId":"1818","title":"\u5220\u9664\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1819","title":"\u6784\u5efa\u5b57\u5178\u5e8f\u6700\u5927\u7684\u53ef\u884c\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1820","title":"\u91cd\u6784\u4e00\u68f5\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1821","title":"\u53d1\u7968\u4e2d\u7684\u4ea7\u54c1\u91d1\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1822","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"1823","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u7684\u4e24\u534a\u662f\u5426\u76f8\u4f3c","__typename":"AppliedTranslationNode"},{"questionId":"1824","title":"\u5403\u82f9\u679c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1825","title":"\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1826","title":"\u4e0e\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1827","title":"\u65e0\u6548\u7684\u63a8\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1828","title":"\u8ba1\u7b97\u5206\u914d\u7cd6\u679c\u7684\u4e0d\u540c\u65b9\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1829","title":"\u5361\u8f66\u4e0a\u7684\u6700\u5927\u5355\u5143\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1830","title":"\u5927\u9910\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1831","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e09\u4e2a\u5b50\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1832","title":"\u5f97\u5230\u5b50\u5e8f\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1833","title":"\u627e\u5230\u6700\u9ad8\u6d77\u62d4","__typename":"AppliedTranslationNode"},{"questionId":"1834","title":"\u9700\u8981\u6559\u8bed\u8a00\u7684\u6700\u5c11\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1835","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1836","title":"\u751f\u6210\u4e58\u79ef\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1837","title":"\u6bcf\u5929\u7684\u9886\u5bfc\u548c\u5408\u4f19\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1838","title":"\u5b57\u7b26\u4e32\u7684\u4e0d\u540c\u5b50\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1839","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1840","title":"\u6267\u884c\u4ea4\u6362\u64cd\u4f5c\u540e\u7684\u6700\u5c0f\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1842","title":"\u4e24\u4eba\u4e4b\u95f4\u7684\u901a\u8bdd\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1843","title":"\u53ef\u4ee5\u5f62\u6210\u6700\u5927\u6b63\u65b9\u5f62\u7684\u77e9\u5f62\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1844","title":"\u76d2\u5b50\u4e2d\u5c0f\u7403\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1845","title":"\u91cd\u65b0\u6392\u5217\u540e\u7684\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1847","title":"\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1848","title":"\u552f\u4e00\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1849","title":"\u4efb\u610f\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u503c\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1850","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e24\u7aef\u76f8\u540c\u5b57\u7b26\u540e\u7684\u6700\u77ed\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1851","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee II","__typename":"AppliedTranslationNode"},{"questionId":"1852","title":"\u8bbf\u95ee\u65e5\u671f\u4e4b\u95f4\u6700\u5927\u7684\u7a7a\u6863\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1858","title":"\u66ff\u6362\u9690\u85cf\u6570\u5b57\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1859","title":"\u6ee1\u8db3\u4e09\u6761\u4ef6\u4e4b\u4e00\u9700\u6539\u53d8\u7684\u6700\u5c11\u5b57\u7b26\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1860","title":"\u627e\u51fa\u7b2c K \u5927\u7684\u5f02\u6216\u5750\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1861","title":"\u653e\u7f6e\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1862","title":"\u82f9\u679c\u548c\u6a58\u5b50\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1865","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728 II","__typename":"AppliedTranslationNode"},{"questionId":"1866","title":"\u4ece\u76f8\u90bb\u5143\u7d20\u5bf9\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1871","title":"\u56de\u6587\u4e32\u5206\u5272 IV","__typename":"AppliedTranslationNode"},{"questionId":"1872","title":"\u4f60\u80fd\u5728\u4f60\u6700\u559c\u6b22\u7684\u90a3\u5929\u5403\u5230\u4f60\u6700\u559c\u6b22\u7684\u7cd6\u679c\u5417\uff1f","__typename":"AppliedTranslationNode"},{"questionId":"1873","title":"\u6700\u957f\u7684\u7f8e\u597d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1874","title":"\u901a\u8fc7\u8fde\u63a5\u53e6\u4e00\u4e2a\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u5f97\u5230\u4e00\u4e2a\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1875","title":"\u4e92\u8d28\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1876","title":"\u5730\u56fe\u4e2d\u7684\u6700\u9ad8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1877","title":"\u6c42\u5173\u6ce8\u8005\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1878","title":"\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u7ecf\u6392\u5e8f\u548c\u8f6e\u8f6c\u5f97\u5230","__typename":"AppliedTranslationNode"},{"questionId":"1879","title":"\u79fb\u9664\u77f3\u5b50\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1880","title":"\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5927\u7684\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1881","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1882","title":"\u6bcf\u4f4d\u7ecf\u7406\u7684\u4e0b\u5c5e\u5458\u5de5\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1883","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1884","title":"\u751f\u6210\u4ea4\u66ff\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1885","title":"\u7edf\u8ba1\u540c\u6784\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1886","title":"\u888b\u5b50\u91cc\u6700\u5c11\u6570\u76ee\u7684\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1887","title":"\u4e00\u4e2a\u56fe\u4e2d\u8fde\u901a\u4e09\u5143\u7ec4\u7684\u6700\u5c0f\u5ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1888","title":"\u627e\u5230\u6700\u8fd1\u7684\u6709\u76f8\u540c X \u6216 Y \u5750\u6807\u7684\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1889","title":"\u5224\u65ad\u4e00\u4e2a\u6570\u5b57\u662f\u5426\u53ef\u4ee5\u8868\u793a\u6210\u4e09\u7684\u5e42\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1890","title":"\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u7f8e\u4e3d\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1891","title":"\u7edf\u8ba1\u70b9\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1892","title":"\u67e5\u627e\u6bcf\u4e2a\u5458\u5de5\u82b1\u8d39\u7684\u603b\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1893","title":"\u7ecf\u8fc7\u4e00\u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1894","title":"\u4ea4\u66ff\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1895","title":"\u79fb\u52a8\u6240\u6709\u7403\u5230\u6bcf\u4e2a\u76d2\u5b50\u6240\u9700\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1896","title":"\u6267\u884c\u4e58\u6cd5\u8fd0\u7b97\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1897","title":"\u7531\u5b50\u5e8f\u5217\u6784\u9020\u7684\u6700\u957f\u56de\u6587\u4e32\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1898","title":"\u5e94\u8be5\u88ab\u7981\u6b62\u7684Leetflex\u8d26\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1899","title":"\u7edf\u8ba1\u5339\u914d\u68c0\u7d22\u89c4\u5219\u7684\u7269\u54c1\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1900","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u4ef7\u683c\u7684\u751c\u70b9\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1901","title":"\u901a\u8fc7\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1902","title":"\u8f66\u961f II","__typename":"AppliedTranslationNode"},{"questionId":"1903","title":"\u8bbe\u8ba1\u6700\u8fd1\u4f7f\u7528\uff08MRU\uff09\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1904","title":"\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e8c\u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1905","title":"\u8bbe\u8ba1\u4e00\u4e2a\u9a8c\u8bc1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1906","title":"N \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1907","title":"\u7edf\u8ba1\u5f02\u6216\u503c\u5728\u8303\u56f4\u5185\u7684\u6570\u5bf9\u6709\u591a\u5c11","__typename":"AppliedTranslationNode"},{"questionId":"1908","title":"\u53ef\u56de\u6536\u4e14\u4f4e\u8102\u7684\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1909","title":"\u80fd\u770b\u5230\u6d77\u666f\u7684\u5efa\u7b51\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1910","title":"\u68c0\u67e5\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1911","title":"\u6784\u6210\u7279\u5b9a\u548c\u9700\u8981\u6dfb\u52a0\u7684\u6700\u5c11\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1912","title":"\u4ece\u7b2c\u4e00\u4e2a\u8282\u70b9\u51fa\u53d1\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684\u53d7\u9650\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1913","title":"\u4f7f\u6240\u6709\u533a\u95f4\u7684\u5f02\u6216\u7ed3\u679c\u4e3a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1914","title":"\u5bfb\u627e\u6ca1\u6709\u88ab\u6267\u884c\u7684\u4efb\u52a1\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1915","title":"\u4ec5\u6267\u884c\u4e00\u6b21\u5b57\u7b26\u4e32\u4ea4\u6362\u80fd\u5426\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1916","title":"\u627e\u51fa\u661f\u578b\u56fe\u7684\u4e2d\u5fc3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1917","title":"\u6700\u5927\u5e73\u5747\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1918","title":"\u597d\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1919","title":"\u6309\u53d7\u6b22\u8fce\u7a0b\u5ea6\u6392\u5217\u529f\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"1920","title":"\u5224\u65ad\u56fd\u9645\u8c61\u68cb\u68cb\u76d8\u4e2d\u4e00\u4e2a\u683c\u5b50\u7684\u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1923","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 III","__typename":"AppliedTranslationNode"},{"questionId":"1924","title":"\u5f97\u5230\u65b0\u9c9c\u751c\u751c\u5708\u7684\u6700\u591a\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1925","title":"\u7edf\u8ba1\u4e00\u4e2a\u6570\u7ec4\u4e2d\u597d\u5bf9\u5b50\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1926","title":"\u6bcf\u5bb6\u5546\u5e97\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1927","title":"\u6700\u5927\u5347\u5e8f\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1928","title":"\u79ef\u538b\u8ba2\u5355\u4e2d\u7684\u8ba2\u5355\u603b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1929","title":"\u6709\u754c\u6570\u7ec4\u4e2d\u6307\u5b9a\u4e0b\u6807\u5904\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1930","title":"\u4f60\u80fd\u6784\u9020\u51fa\u8fde\u7eed\u503c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1931","title":"\u672a\u77e5\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1932","title":"\u5927\u6ee1\u8d2f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1933","title":"\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1934","title":"\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u62ec\u53f7\u5185\u5bb9","__typename":"AppliedTranslationNode"},{"questionId":"1935","title":"\u8fd8\u539f\u6392\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b65\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1936","title":"\u597d\u56e0\u5b50\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1937","title":"\u6700\u5927\u5316\u82b1\u56ed\u7684\u7f8e\u89c2\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1938","title":"\u6700\u5c11\u64cd\u4f5c\u4f7f\u6570\u7ec4\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1939","title":"\u7edf\u8ba1\u4e00\u4e2a\u5706\u4e2d\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1940","title":"\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1941","title":"\u4f7f\u5b57\u7b26\u4e32\u6709\u5e8f\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1942","title":"\u5458\u5de5\u7684\u76f4\u5c5e\u90e8\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"1943","title":"\u7edf\u8ba1\u8ddd\u79bb\u6700\u5c0f\u7684\u5b50\u4e32\u5bf9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1944","title":"\u622a\u65ad\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1945","title":"\u67e5\u627e\u7528\u6237\u6d3b\u8dc3\u5206\u949f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1946","title":"\u7edd\u5bf9\u5dee\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1947","title":"\u5e8f\u5217\u4e2d\u4e0d\u540c\u6700\u5927\u516c\u7ea6\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1948","title":"\u6bcf\u4e2a\u4ea7\u54c1\u5728\u4e0d\u540c\u5546\u5e97\u7684\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1949","title":"\u5b9e\u73b0 Trie \uff08\u524d\u7f00\u6811\uff09 II","__typename":"AppliedTranslationNode"},{"questionId":"1950","title":"\u6570\u7ec4\u5143\u7d20\u79ef\u7684\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1951","title":"\u627e\u51fa\u6e38\u620f\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1952","title":"\u6700\u5c11\u4fa7\u8df3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1953","title":"\u6c42\u51fa MK \u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1954","title":"\u5c06\u6240\u6709\u6570\u5b57\u7528\u5b57\u7b26\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1955","title":"\u5ea7\u4f4d\u9884\u7ea6\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1956","title":"\u51cf\u5c0f\u548c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\u540e\u7684\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1957","title":"\u6700\u8fd1\u7684\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1958","title":"\u6ca1\u6709\u5e7f\u544a\u7684\u5267\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1959","title":"\u9690\u85cf\u7f51\u683c\u4e0b\u7684\u6700\u5c0f\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1960","title":"\u5224\u65ad\u53e5\u5b50\u662f\u5426\u4e3a\u5168\u5b57\u6bcd\u53e5","__typename":"AppliedTranslationNode"},{"questionId":"1961","title":"\u96ea\u7cd5\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1962","title":"\u5355\u7ebf\u7a0b CPU","__typename":"AppliedTranslationNode"},{"questionId":"1963","title":"\u6240\u6709\u6570\u5bf9\u6309\u4f4d\u4e0e\u7ed3\u679c\u7684\u5f02\u6216\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1964","title":"\u5bfb\u627e\u9762\u8bd5\u5019\u9009\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1965","title":"K \u8fdb\u5236\u8868\u793a\u4e0b\u7684\u5404\u4f4d\u6570\u5b57\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1966","title":"\u6700\u9ad8\u9891\u5143\u7d20\u7684\u9891\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1967","title":"\u6240\u6709\u5143\u97f3\u6309\u987a\u5e8f\u6392\u5e03\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1968","title":"\u6700\u9ad8\u5efa\u7b51\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1969","title":"\u6700\u591a\u9080\u8bf7\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1970","title":"\u5c06\u53e5\u5b50\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1971","title":"\u589e\u957f\u7684\u5185\u5b58\u6cc4\u9732","__typename":"AppliedTranslationNode"},{"questionId":"1972","title":"\u65cb\u8f6c\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1974","title":"\u5bfb\u627e\u4eca\u5e74\u5177\u6709\u6b63\u6536\u5165\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1975","title":"\u5230\u76ee\u6807\u5143\u7d20\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1976","title":"\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u9012\u51cf\u7684\u8fde\u7eed\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1977","title":"\u5305\u542b\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1978","title":"\u90bb\u4f4d\u4ea4\u6362\u7684\u6700\u5c0f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1980","title":"\u6709\u7f3a\u9677\u7684\u4f20\u611f\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1981","title":"\u6bcf\u5929\u7684\u6700\u5927\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1982","title":"\u4ece\u672a\u6392\u5e8f\u7684\u94fe\u8868\u4e2d\u79fb\u9664\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1983","title":"\u4eba\u53e3\u6700\u591a\u7684\u5e74\u4efd","__typename":"AppliedTranslationNode"},{"questionId":"1984","title":"\u4e0b\u6807\u5bf9\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1985","title":"\u5b50\u6570\u7ec4\u6700\u5c0f\u4e58\u79ef\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1986","title":"\u6709\u5411\u56fe\u4e2d\u6700\u5927\u989c\u8272\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1987","title":"\u957f\u5ea6\u4e3a\u4e09\u4e14\u5404\u5b57\u7b26\u4e0d\u540c\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1988","title":"\u6570\u7ec4\u4e2d\u6700\u5927\u6570\u5bf9\u548c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1989","title":"\u4e24\u4e2a\u6570\u7ec4\u6700\u5c0f\u7684\u5f02\u6216\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1990","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u4e09\u4e2a\u83f1\u5f62\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1991","title":"\u8054\u8d5b\u4fe1\u606f\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1993","title":"\u627e\u51fa\u6240\u6709\u5b50\u96c6\u7684\u5f02\u6216\u603b\u548c\u518d\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1994","title":"\u6784\u6210\u4ea4\u66ff\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1995","title":"\u627e\u51fa\u548c\u4e3a\u6307\u5b9a\u503c\u7684\u4e0b\u6807\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1996","title":"\u6070\u6709 K \u6839\u6728\u68cd\u53ef\u4ee5\u770b\u5230\u7684\u6392\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1997","title":"\u4e0b\u4e2a\u7531\u76f8\u540c\u6570\u5b57\u6784\u6210\u7684\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1999","title":"\u54ea\u79cd\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u66f4\u957f","__typename":"AppliedTranslationNode"},{"questionId":"2000","title":"\u51c6\u65f6\u5230\u8fbe\u7684\u5217\u8f66\u6700\u5c0f\u65f6\u901f","__typename":"AppliedTranslationNode"},{"questionId":"2001","title":"\u8df3\u8dc3\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"2002","title":"\u77f3\u5b50\u6e38\u620f VIII","__typename":"AppliedTranslationNode"},{"questionId":"2003","title":"\u6bcf\u4e2a\u5b50\u6570\u7ec4\u7684\u6570\u5b57\u79cd\u7c7b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2004","title":"\u8f6c\u6362\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"2005","title":"\u68c0\u67e5\u662f\u5426\u533a\u57df\u5185\u6240\u6709\u6574\u6570\u90fd\u88ab\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"2006","title":"\u627e\u5230\u9700\u8981\u8865\u5145\u7c89\u7b14\u7684\u5b66\u751f\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2008","title":"\u53cd\u8f6c\u8868\u8fbe\u5f0f\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2009","title":"\u5305\u542b\u6240\u6709\u524d\u7f00\u7684\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"2010","title":"\u68c0\u67e5\u67d0\u5355\u8bcd\u662f\u5426\u7b49\u4e8e\u4e24\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2011","title":"\u63d2\u5165\u540e\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2012","title":"\u4f7f\u7528\u670d\u52a1\u5668\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"2013","title":"\u51c6\u65f6\u62b5\u8fbe\u4f1a\u8bae\u73b0\u573a\u7684\u6700\u5c0f\u8df3\u8fc7\u4f11\u606f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2015","title":"\u5224\u65ad\u77e9\u9635\u7ecf\u8f6e\u8f6c\u540e\u662f\u5426\u4e00\u81f4","__typename":"AppliedTranslationNode"},{"questionId":"2016","title":"\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49\u7684\u51cf\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2017","title":"\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u7b26\u4ea4\u66ff\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2018","title":"\u88c5\u5305\u88f9\u7684\u6700\u5c0f\u6d6a\u8d39\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2019","title":"\u4e24\u4e2a\u884c\u7a0b\u7f16\u7801\u6570\u7ec4\u7684\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2020","title":"\u5220\u9664\u4e00\u4e2a\u5143\u7d20\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"2021","title":"\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u51fa\u73b0\u7684\u7ed9\u5b9a\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2022","title":"\u6700\u5927\u5b50\u5e8f\u5217\u4ea4\u66ff\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2023","title":"\u8bbe\u8ba1\u7535\u5f71\u79df\u501f\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"2024","title":"\u8ba1\u7b97\u7279\u6b8a\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"2025","title":"\u91cd\u65b0\u5206\u914d\u5b57\u7b26\u4f7f\u6240\u6709\u5b57\u7b26\u4e32\u90fd\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"2026","title":"\u5408\u5e76\u82e5\u5e72\u4e09\u5143\u7ec4\u4ee5\u5f62\u6210\u76ee\u6807\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2027","title":"\u53ef\u79fb\u9664\u5b57\u7b26\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2028","title":"\u6700\u4f73\u8fd0\u52a8\u5458\u7684\u6bd4\u62fc\u56de\u5408","__typename":"AppliedTranslationNode"},{"questionId":"2029","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u6700\u5c0f\u4e58\u79ef\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2031","title":"\u9e21\u86cb\u6389\u843d-\u4e24\u679a\u9e21\u86cb","__typename":"AppliedTranslationNode"},{"questionId":"2032","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6700\u5927\u5947\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2033","title":"\u4f60\u5b8c\u6210\u7684\u5b8c\u6574\u5bf9\u5c40\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2034","title":"\u67e5\u8be2\u5dee\u7edd\u5bf9\u503c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2035","title":"\u7edf\u8ba1\u5b50\u5c9b\u5c7f","__typename":"AppliedTranslationNode"},{"questionId":"2037","title":"\u7edf\u8ba1\u5e73\u65b9\u548c\u4e09\u5143\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2038","title":"\u8ff7\u5bab\u4e2d\u79bb\u5165\u53e3\u6700\u8fd1\u7684\u51fa\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"2039","title":"\u6c42\u548c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2040","title":"\u89c4\u5b9a\u65f6\u95f4\u5185\u5230\u8fbe\u7ec8\u70b9\u7684\u6700\u5c0f\u82b1\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"2041","title":"2020\u5e74\u6700\u540e\u4e00\u6b21\u767b\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"2042","title":"\u4e24\u4e2a\u6570\u5bf9\u4e4b\u95f4\u7684\u6700\u5927\u4e58\u79ef\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2043","title":"\u5faa\u73af\u8f6e\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"2044","title":"\u6700\u7f8e\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2045","title":"\u5272\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"2046","title":"\u9875\u9762\u63a8\u8350\u2161","__typename":"AppliedTranslationNode"},{"questionId":"2047","title":"\u627e\u51fa\u9876\u5cf0\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"2048","title":"\u57fa\u4e8e\u6392\u5217\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2049","title":"\u6d88\u706d\u602a\u7269\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2050","title":"\u7edf\u8ba1\u597d\u6570\u5b57\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2051","title":"\u6700\u957f\u516c\u5171\u5b50\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"2053","title":"\u68c0\u67e5\u662f\u5426\u6240\u6709\u5b57\u7b26\u51fa\u73b0\u6b21\u6570\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"2054","title":"\u6700\u5c0f\u672a\u88ab\u5360\u636e\u6905\u5b50\u7684\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2055","title":"\u63cf\u8ff0\u7ed8\u753b\u7ed3\u679c","__typename":"AppliedTranslationNode"},{"questionId":"2057","title":"\u6309\u5206\u7c7b\u7edf\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"2058","title":"\u6570\u7ec4\u4e32\u8054","__typename":"AppliedTranslationNode"},{"questionId":"2059","title":"\u957f\u5ea6\u4e3a 3 \u7684\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2060","title":"\u5408\u5e76\u591a\u68f5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"2061","title":"\u7528\u4e09\u79cd\u4e0d\u540c\u989c\u8272\u4e3a\u7f51\u683c\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"2062","title":"Nim \u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"2064","title":"\u5174\u8da3\u76f8\u540c\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"2066","title":"\u65b0\u589e\u7684\u6700\u5c11\u53f0\u9636\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2067","title":"\u6263\u5206\u540e\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"2068","title":"\u67e5\u8be2\u6700\u5927\u57fa\u56e0\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2069","title":"\u7b2c K \u5c0f\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2070","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u5206\u89e3\u4e3a\u503c\u5747\u7b49\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2071","title":"\u6392\u5e8f\u6570\u7ec4\u4e4b\u95f4\u7684\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2072","title":"\u6240\u6709\u5b50\u6570\u7ec4\u6700\u5c0f\u503c\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2073","title":"\u611f\u67d3 K \u79cd\u75c5\u6bd2\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2076","title":"\u5b57\u7b26\u4e32\u8f6c\u5316\u540e\u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2077","title":"\u5b50\u5b57\u7b26\u4e32\u7a81\u53d8\u540e\u53ef\u80fd\u5f97\u5230\u7684\u6700\u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2078","title":"\u6700\u5927\u517c\u5bb9\u6027\u8bc4\u5206\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2079","title":"\u5220\u9664\u7cfb\u7edf\u4e2d\u7684\u91cd\u590d\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"2080","title":"\u68c0\u67e5\u64cd\u4f5c\u662f\u5426\u5408\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"2081","title":"K \u6b21\u8c03\u6574\u6570\u7ec4\u5927\u5c0f\u6d6a\u8d39\u7684\u6700\u5c0f\u603b\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2083","title":"\u4e09\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2084","title":"\u4f60\u53ef\u4ee5\u5de5\u4f5c\u7684\u6700\u5927\u5468\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2085","title":"\u6784\u9020\u5143\u7d20\u4e0d\u7b49\u4e8e\u4e24\u76f8\u90bb\u5143\u7d20\u5e73\u5747\u503c\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2086","title":"\u7edf\u8ba1\u7279\u6b8a\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2088","title":"\u4f7f\u7528\u7279\u6b8a\u6253\u5b57\u673a\u952e\u5165\u5355\u8bcd\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2089","title":"\u6700\u5927\u65b9\u9635\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2090","title":"\u5230\u8fbe\u76ee\u7684\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2091","title":"\u5212\u5206\u6570\u5b57\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2093","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u4e3a\u6570\u7ec4\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2094","title":"\u79fb\u9664\u77f3\u5b50\u4f7f\u603b\u6570\u6700\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"2095","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2096","title":"\u627e\u51fa\u5230\u6bcf\u4e2a\u4f4d\u7f6e\u4e3a\u6b62\u6700\u957f\u7684\u6709\u6548\u969c\u788d\u8d5b\u8dd1\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"2098","title":"\u67e5\u8be2\u5177\u6709\u6700\u591a\u5171\u540c\u5173\u6ce8\u8005\u7684\u6240\u6709\u4e24\u4e24\u7ed3\u5bf9\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2099","title":"\u4f5c\u4e3a\u5b50\u5b57\u7b26\u4e32\u51fa\u73b0\u5728\u5355\u8bcd\u4e2d\u7684\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2100","title":"\u6570\u7ec4\u5143\u7d20\u7684\u6700\u5c0f\u975e\u96f6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2101","title":"\u4f60\u80fd\u7a7f\u8fc7\u77e9\u9635\u7684\u6700\u540e\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2102","title":"\u627e\u5230\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"2103","title":"\u627e\u5230\u6240\u6709\u7684\u519c\u573a\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2104","title":"\u6811\u4e0a\u7684\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"2105","title":"\u597d\u5b50\u96c6\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2106","title":"\u627e\u51fa\u6570\u7ec4\u7684\u6700\u5927\u516c\u7ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2107","title":"\u627e\u51fa\u4e0d\u540c\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2108","title":"\u6700\u5c0f\u5316\u76ee\u6807\u503c\u4e0e\u6240\u9009\u5143\u7d20\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2109","title":"\u4ece\u5b50\u96c6\u7684\u548c\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2112","title":"\u5b66\u751f\u5206\u6570\u7684\u6700\u5c0f\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2113","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c K \u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2114","title":"\u5b8c\u6210\u4efb\u52a1\u7684\u6700\u5c11\u5de5\u4f5c\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"2115","title":"\u4e0d\u540c\u7684\u597d\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2116","title":"\u5dee\u7684\u7edd\u5bf9\u503c\u4e3a K \u7684\u6570\u5bf9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2117","title":"\u4ece\u53cc\u500d\u6570\u7ec4\u4e2d\u8fd8\u539f\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2118","title":"\u51fa\u79df\u8f66\u7684\u6700\u5927\u76c8\u5229","__typename":"AppliedTranslationNode"},{"questionId":"2119","title":"\u4f7f\u6570\u7ec4\u8fde\u7eed\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2122","title":"\u7edf\u8ba1\u7279\u6b8a\u56db\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2123","title":"\u6e38\u620f\u4e2d\u5f31\u89d2\u8272\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2124","title":"\u8bbf\u95ee\u5b8c\u6240\u6709\u623f\u95f4\u7684\u7b2c\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2125","title":"\u6570\u7ec4\u7684\u6700\u5927\u516c\u56e0\u6570\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"2128","title":"\u53cd\u8f6c\u5355\u8bcd\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2129","title":"\u53ef\u4e92\u6362\u77e9\u5f62\u7684\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2130","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5e8f\u5217\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2131","title":"\u6bcf\u68f5\u5b50\u6811\u5185\u7f3a\u5931\u7684\u6700\u5c0f\u57fa\u56e0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2132","title":"\u5c06\u4e00\u7ef4\u6570\u7ec4\u8f6c\u53d8\u6210\u4e8c\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2133","title":"\u8fde\u63a5\u540e\u7b49\u4e8e\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"2134","title":"\u8003\u8bd5\u7684\u6700\u5927\u56f0\u6270\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"2135","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u591a\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2137","title":"\u6267\u884c\u64cd\u4f5c\u540e\u7684\u53d8\u91cf\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2138","title":"\u6570\u7ec4\u7f8e\u4e3d\u503c\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2139","title":"\u68c0\u6d4b\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"2140","title":"\u91cd\u590d K \u6b21\u7684\u6700\u957f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2144","title":"\u589e\u91cf\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2145","title":"\u7f51\u683c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2146","title":"\u5224\u65ad\u5355\u8bcd\u662f\u5426\u80fd\u653e\u5165\u586b\u5b57\u6e38\u620f\u5185","__typename":"AppliedTranslationNode"},{"questionId":"2147","title":"\u89e3\u51fa\u6570\u5b66\u8868\u8fbe\u5f0f\u7684\u5b66\u751f\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2154","title":"\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2155","title":"\u627e\u51fa\u7f3a\u5931\u7684\u89c2\u6d4b\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"2156","title":"\u77f3\u5b50\u6e38\u620f IX","__typename":"AppliedTranslationNode"},{"questionId":"2157","title":"\u542b\u7279\u5b9a\u5b57\u6bcd\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2159","title":"\u81f3\u5c11\u5728\u4e24\u4e2a\u6570\u7ec4\u4e2d\u51fa\u73b0\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2160","title":"\u83b7\u53d6\u5355\u503c\u7f51\u683c\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2161","title":"\u80a1\u7968\u4ef7\u683c\u6ce2\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"2162","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u4e2a\u6570\u7ec4\u5e76\u6700\u5c0f\u5316\u6570\u7ec4\u548c\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100002","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100003","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100004","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100005","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100006","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100007","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100008","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100009","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100010","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100011","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100012","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100013","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100014","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100015","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100016","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100017","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100018","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100019","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100020","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100021","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100022","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100023","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100024","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100025","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100026","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100027","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100028","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100029","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100030","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100031","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100032","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100033","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100034","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100035","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100036","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100037","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100038","title":"\u78b0\u649e\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100039","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100040","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100041","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100042","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100043","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100044","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100045","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100046","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100047","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100048","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100049","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100050","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100051","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100052","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100065","title":"\u6700\u5c0f\u4ea4\u6362\u6b21\u6570\u4f7f\u5f97\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100091","title":"\u529b\u6263\u8c61\u68cb\u5b66\u5802","__typename":"AppliedTranslationNode"},{"questionId":"100092","title":"\u5206\u5f0f\u5316\u7b80","__typename":"AppliedTranslationNode"},{"questionId":"100093","title":"\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"100094","title":"\u53d1 LeetCoin","__typename":"AppliedTranslationNode"},{"questionId":"100096","title":"\u673a\u5668\u4eba\u5927\u5192\u9669","__typename":"AppliedTranslationNode"},{"questionId":"100103","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100104","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100105","title":"\u56f4\u6210\u4e00\u5708","__typename":"AppliedTranslationNode"},{"questionId":"100106","title":"\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100107","title":"\u731c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100125","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570 - LC","__typename":"AppliedTranslationNode"},{"questionId":"100129","title":"\u5458\u5de5\u4e92\u8bc4","__typename":"AppliedTranslationNode"},{"questionId":"100130","title":"\u7535\u68af","__typename":"AppliedTranslationNode"},{"questionId":"100136","title":"\u5b57\u7b26\u4e32\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"100139","title":"\u6d4b\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100144","title":"\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100146","title":"\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"100147","title":"\u6d88\u9664\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100148","title":"PK","__typename":"AppliedTranslationNode"},{"questionId":"100149","title":"\u5408\u5e76\u4efb\u52a1\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100151","title":"\u56fd\u5bb6\u7ed3\u76df -- 952 \u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"100152","title":"\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100153","title":"\u5feb\u9012\u5458\u6d3e\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"100154","title":"\u8fde\u8fde\u770b","__typename":"AppliedTranslationNode"},{"questionId":"100157","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"100158","title":"\u5224\u5b9a\u5b57\u7b26\u662f\u5426\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100159","title":"\u5224\u5b9a\u662f\u5426\u4e92\u4e3a\u5b57\u7b26\u91cd\u6392","__typename":"AppliedTranslationNode"},{"questionId":"100160","title":"URL\u5316","__typename":"AppliedTranslationNode"},{"questionId":"100161","title":"\u5b57\u7b26\u4e32\u538b\u7f29","__typename":"AppliedTranslationNode"},{"questionId":"100162","title":"\u5b57\u7b26\u4e32\u8f6e\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"100163","title":"\u79fb\u9664\u91cd\u590d\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100164","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100167","title":"\u94fe\u8868\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"100168","title":"\u73af\u8def\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"100169","title":"\u6808\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100170","title":"\u5316\u6808\u4e3a\u961f","__typename":"AppliedTranslationNode"},{"questionId":"100171","title":"\u8282\u70b9\u95f4\u901a\u8def","__typename":"AppliedTranslationNode"},{"questionId":"100172","title":"\u4e09\u5408\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100173","title":"\u6808\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100174","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100175","title":"\u7279\u5b9a\u6df1\u5ea6\u8282\u70b9\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100176","title":"\u68c0\u67e5\u5e73\u8861\u6027","__typename":"AppliedTranslationNode"},{"questionId":"100177","title":"\u5408\u6cd5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100178","title":"\u540e\u7ee7\u8005","__typename":"AppliedTranslationNode"},{"questionId":"100179","title":"\u9996\u4e2a\u5171\u540c\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100180","title":"\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"100181","title":"\u6574\u6570\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100182","title":"\u914d\u5bf9\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100183","title":"\u4e0b\u4e00\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100184","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100185","title":"\u65cb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100186","title":"\u96f6\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100187","title":"\u5220\u9664\u4e2d\u95f4\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100188","title":"\u94fe\u8868\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100189","title":"\u897f\u6e38\u8bb0","__typename":"AppliedTranslationNode"},{"questionId":"100191","title":"\u4f18\u5316\u53c2\u8d5b\u961f\u4f0d","__typename":"AppliedTranslationNode"},{"questionId":"100193","title":"\u9ed1\u767d\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"100194","title":"2048 \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100195","title":"\u5806\u76d8\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100196","title":"\u7ed8\u5236\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100197","title":"\u4e09\u6b65\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100198","title":"\u5e42\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"100199","title":"\u9012\u5f52\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100200","title":"\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"100201","title":"\u989c\u8272\u586b\u5145","__typename":"AppliedTranslationNode"},{"questionId":"100202","title":"\u5806\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100203","title":"\u4e8c\u8fdb\u5236\u6570\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100206","title":"\u70b9\u4eae\u5723\u8bde\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100207","title":"\u8ff7\u5bab\u91cd\u529b\u7403","__typename":"AppliedTranslationNode"},{"questionId":"100208","title":"\u65e9\u9910\u9ad8\u5cf0","__typename":"AppliedTranslationNode"},{"questionId":"100209","title":"\u6768\u67f3\u7d6e\u6291\u5236\u5242","__typename":"AppliedTranslationNode"},{"questionId":"100210","title":"\u642c\u5bb6\u6253\u5305","__typename":"AppliedTranslationNode"},{"questionId":"100211","title":" \u671f\u4e2d\u8003\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100212","title":"\u5468\u516d\u5bb5\u591c\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100213","title":"\u51fa\u6e38\u603b\u7ed3","__typename":"AppliedTranslationNode"},{"questionId":"100214","title":"\u9910\u5385\u4f18\u60e0\u5238","__typename":"AppliedTranslationNode"},{"questionId":"100215","title":"\u51fa\u5dee\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100216","title":"\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"100217","title":"\u6700\u62e5\u5835\u7684\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"100218","title":"\u5165\u5b66\u8003\u8bd5\u7b97\u6cd5\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100219","title":"\u5783\u573e\u90ae\u4ef6\u8fc7\u6ee4\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"100220","title":"\u672c\u5468\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"100221","title":"\u4e34\u65f6\u70b9\u9910\u5458","__typename":"AppliedTranslationNode"},{"questionId":"100222","title":"\u5c0f\u7ec4\u8ba8\u8bba","__typename":"AppliedTranslationNode"},{"questionId":"100223","title":"\u91c7\u8d2d\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"100226","title":"\u7b97\u6cd5\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"100228","title":"\u52a8\u7269\u6536\u5bb9\u6240","__typename":"AppliedTranslationNode"},{"questionId":"100229","title":"\u68c0\u67e5\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100230","title":"\u7ffb\u8f6c\u6570\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"100231","title":"\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"100232","title":"\u641c\u7d22\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100233","title":"\u516b\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"100234","title":"\u57fa\u7ad9\u5730\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"100235","title":"\u7f16\u7a0b\u8bed\u8a00\u504f\u597d\u8c03\u67e5","__typename":"AppliedTranslationNode"},{"questionId":"100236","title":"\u964d\u566a\u8033\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100237","title":"\u51fa\u5dee\u8def\u7ebf II","__typename":"AppliedTranslationNode"},{"questionId":"100238","title":"\u4e92\u4fe1\u534f\u5546\u673a\u5236 II","__typename":"AppliedTranslationNode"},{"questionId":"100239","title":"TLV \u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"100240","title":"\u9b54\u672f\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"100241","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100242","title":"\u7a00\u758f\u6570\u7ec4\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"100246","title":"\u5458\u5de5\u8fd0\u52a8\u4f1a","__typename":"AppliedTranslationNode"},{"questionId":"100247","title":"\u65f6\u95f4\u7247\u8f6e\u8f6c\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100248","title":"\u6700\u77ed\u5269\u4f59\u65f6\u95f4\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100249","title":"\u6570\u636e\u590d\u539f","__typename":"AppliedTranslationNode"},{"questionId":"100250","title":"\u8eab\u9ad8\u4f18\u52bf","__typename":"AppliedTranslationNode"},{"questionId":"100251","title":"\u5b9a\u4ef7\u7b56\u7565","__typename":"AppliedTranslationNode"},{"questionId":"100252","title":"\u4e1a\u7ee9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"100253","title":"\u8bfb\u4e66\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100254","title":"\u5956\u91d1\u8ba1\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100255","title":"\u529e\u516c\u5ba4\u996e\u6c34\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100256","title":"\u9ad8\u94c1\u9009\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"100257","title":"\u5730\u94c1\u7968","__typename":"AppliedTranslationNode"},{"questionId":"100258","title":"\u4ea4\u6362\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100259","title":"\u5355\u8bcd\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"100260","title":"\u4ea4\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100261","title":"\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100262","title":"\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100263","title":"SyM \u7684 \ud83d\udd11","__typename":"AppliedTranslationNode"},{"questionId":"100264","title":"\u5206\u82f9\u679c","__typename":"AppliedTranslationNode"},{"questionId":"100265","title":"qqqqqqqqqqqqqqqy \u7684\u70ed\u8eab\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100266","title":"\u5c0f\u80d6\u5b50\u7684\u65e5\u5e38","__typename":"AppliedTranslationNode"},{"questionId":"100267","title":"\u7406\u7425\u73c0\u73e0","__typename":"AppliedTranslationNode"},{"questionId":"100269","title":"\u72fc\u4eba\u6740\u6a21\u62df\u5668","__typename":"AppliedTranslationNode"},{"questionId":"100272","title":"\ud83d\udc2d\u5e74\u5feb\u4e50","__typename":"AppliedTranslationNode"},{"questionId":"100273","title":"\u7528\u4e24\u4e2a\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100274","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100275","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100276","title":"\u4e8c\u7ef4\u6570\u7ec4\u4e2d\u7684\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"100277","title":"\u9752\u86d9\u8df3\u53f0\u9636\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100278","title":"\u65cb\u8f6c\u6570\u7ec4\u7684\u6700\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100279","title":"\u77e9\u9635\u4e2d\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100280","title":"\u66ff\u6362\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"100281","title":"\u673a\u5668\u4eba\u7684\u8fd0\u52a8\u8303\u56f4","__typename":"AppliedTranslationNode"},{"questionId":"100282","title":"\u4ece\u5c3e\u5230\u5934\u6253\u5370\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100283","title":"\u91cd\u5efa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100284","title":"\u526a\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100285","title":"\u526a\u7ef3\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"100286","title":"\u5408\u5e76\u4e24\u4e2a\u6392\u5e8f\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100287","title":"\u6811\u7684\u5b50\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"100288","title":"\u4e8c\u53c9\u6811\u7684\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"100289","title":"\u5bf9\u79f0\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100290","title":"\u8868\u793a\u6570\u503c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100291","title":"\u8c03\u6574\u6570\u7ec4\u987a\u5e8f\u4f7f\u5947\u6570\u4f4d\u4e8e\u5076\u6570\u524d\u9762","__typename":"AppliedTranslationNode"},{"questionId":"100292","title":"\u4e8c\u8fdb\u5236\u4e2d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100293","title":"\u987a\u65f6\u9488\u6253\u5370\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100294","title":"\u94fe\u8868\u4e2d\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100295","title":"\u6570\u503c\u7684\u6574\u6570\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"100296","title":"\u6253\u5370\u4ece1\u5230\u6700\u5927\u7684n\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100297","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"100298","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100299","title":"\u5220\u9664\u94fe\u8868\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100300","title":"\u590d\u6742\u94fe\u8868\u7684\u590d\u5236","__typename":"AppliedTranslationNode"},{"questionId":"100301","title":"\u6700\u5c0f\u7684k\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100302","title":"\u5305\u542bmin\u51fd\u6570\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"100303","title":"\u6570\u636e\u6d41\u4e2d\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100304","title":"\u8fde\u7eed\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100305","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e0e\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100306","title":"\u6808\u7684\u538b\u5165\u3001\u5f39\u51fa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100307","title":"\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100308","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100309","title":"1\uff5en \u6574\u6570\u4e2d 1 \u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100310","title":"\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc7\u4e00\u534a\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100311","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100312","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"100313","title":"\u6570\u5b57\u5e8f\u5217\u4e2d\u67d0\u4e00\u4f4d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100314","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 III","__typename":"AppliedTranslationNode"},{"questionId":"100315","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u540e\u5e8f\u904d\u5386\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100316","title":"\u7b2c\u4e00\u4e2a\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"100317","title":"\u4e8c\u53c9\u6811\u4e2d\u548c\u4e3a\u67d0\u4e00\u503c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100318","title":"\u6570\u7ec4\u4e2d\u7684\u9006\u5e8f\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"100319","title":"\u4e8c\u53c9\u6811\u7684\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100320","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100321","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"100322","title":"\u548c\u4e3as\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100323","title":"\u628a\u6570\u7ec4\u6392\u6210\u6700\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100324","title":"\u548c\u4e3as\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100325","title":"\u628a\u6570\u5b57\u7ffb\u8bd1\u6210\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100326","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u516c\u5171\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100327","title":"\u793c\u7269\u7684\u6700\u5927\u4ef7\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100328","title":"\u7ffb\u8f6c\u5355\u8bcd\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100329","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u6570\u5b57 I","__typename":"AppliedTranslationNode"},{"questionId":"100330","title":"\u5de6\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100331","title":"0\uff5en-1\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100332","title":"\u6700\u957f\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100333","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u7b2ck\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100334","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100335","title":"\u4e0d\u7528\u52a0\u51cf\u4e58\u9664\u505a\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100336","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100337","title":"\u961f\u5217\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100338","title":"\u6784\u5efa\u4e58\u79ef\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100339","title":"n\u4e2a\u9ab0\u5b50\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100340","title":"\u628a\u5b57\u7b26\u4e32\u8f6c\u6362\u6210\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100341","title":"\u6251\u514b\u724c\u4e2d\u7684\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100342","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100343","title":"\u5706\u5708\u4e2d\u6700\u540e\u5269\u4e0b\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100344","title":"\u80a1\u7968\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"100345","title":"\u6c421+2+\u2026+n","__typename":"AppliedTranslationNode"},{"questionId":"100346","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100347","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100348","title":"\u6709\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100349","title":"\u6700\u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100350","title":"\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100351","title":"\u751f\u5b58\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100352","title":"\u8df3\u6c34\u677f","__typename":"AppliedTranslationNode"},{"questionId":"100353","title":"\u5e73\u5206\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"100354","title":"\u6700\u4f73\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100355","title":"\u73e0\u7391\u5999\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100356","title":"\u90e8\u5206\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000001","title":"test-1","__typename":"AppliedTranslationNode"},{"questionId":"1000002","title":"\u627e\u51fa\u9690\u85cf\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000003","title":"\u8fde\u7eed\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000004","title":"\u6a21\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000005","title":"\u6c34\u57df\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"1000006","title":"\u4e00\u6b21\u7f16\u8f91","__typename":"AppliedTranslationNode"},{"questionId":"1000007","title":"\u8fd4\u56de\u5012\u6570\u7b2c k \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000008","title":"\u5206\u5272\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000009","title":"\u6c42\u548c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000010","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000011","title":"\u8ff7\u8def\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000012","title":"\u5408\u5e76\u6392\u5e8f\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000013","title":"\u5cf0\u4e0e\u8c37","__typename":"AppliedTranslationNode"},{"questionId":"1000015","title":"\u6c49\u8bfa\u5854\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000016","title":"\u6392\u5e8f\u77e9\u9635\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"1000017","title":"\u9636\u4e58\u5c3e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000018","title":"\u6574\u6570\u7684\u82f1\u8bed\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"1000019","title":"BiNode","__typename":"AppliedTranslationNode"},{"questionId":"1000020","title":"\u6062\u590d\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1000021","title":"\u6700\u5c0fK\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000022","title":"\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000023","title":"\u6309\u6469\u5e08","__typename":"AppliedTranslationNode"},{"questionId":"1000024","title":"\u591a\u6b21\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"1000025","title":"\u4e0d\u7528\u52a0\u53f7\u7684\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000026","title":"LRU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000027","title":"\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000028","title":"\u8fde\u7eed\u4e2d\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000029","title":"\u76f4\u65b9\u56fe\u7684\u6c34\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000030","title":"\u5355\u8bcd\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1000031","title":"\u5e03\u5c14\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"1000032","title":"\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000033","title":" \u5b57\u6bcd\u4e0e\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000034","title":"2\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000035","title":"\u5a74\u513f\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000036","title":"\u9a6c\u620f\u56e2\u4eba\u5854","__typename":"AppliedTranslationNode"},{"questionId":"1000037","title":"\u7b2c k \u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000038","title":"\u4e3b\u8981\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1000039","title":"\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000040","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000041","title":"\u6570\u5b57\u6d41\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1000042","title":"\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000043","title":"\u6700\u77ed\u8d85\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000044","title":"\u6d88\u5931\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000045","title":"\u6700\u5927\u9ed1\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000046","title":"\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000047","title":"T9\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000048","title":"\u4ea4\u6362\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000049","title":"\u5355\u8bcd\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000050","title":"\u5170\u987f\u8682\u8681","__typename":"AppliedTranslationNode"},{"questionId":"1000051","title":"\u7a00\u758f\u76f8\u4f3c\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000055","title":"\u4e24\u6570\u4e4b\u548c II 3","__typename":"AppliedTranslationNode"},{"questionId":"1000056","title":"\u62ff\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1000057","title":"\u5267\u60c5\u89e6\u53d1\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000058","title":"\u9b54\u672f\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000059","title":"\u5207\u5206\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000060","title":"\u5377\u79ef\u795e\u7ecf\u7f51\u7edc","__typename":"AppliedTranslationNode"},{"questionId":"1000061","title":"\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000062","title":"\u4e8c\u53c9\u6811\u4efb\u52a1\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000063","title":"\u4f20\u9012\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000085","title":"\u6e38\u4e50\u56ed\u7684\u6e38\u89c8\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000086","title":"\u671f\u671b\u4e2a\u6570\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1000087","title":"\u5c0f\u5f20\u5237\u9898\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000088","title":"\u6e38\u4e50\u56ed\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000089","title":"\u4e8c\u53c9\u6811\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000090","title":"\u6700\u5c0f\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000091","title":"\u6700\u5c0f\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000092","title":"\u4f1a\u8bae\u9009\u5740","__typename":"AppliedTranslationNode"},{"questionId":"1000093","title":"\u5bfb\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000095","title":"\u6570\u5b66\u5174\u8da3\u601d\u8003\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000096","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000097","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u524d\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000098","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000099","title":"\u3010\u6807\u7a0b\u6709\u95ee\u9898\u3011\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000100","title":"\u6c42\u4e8c\u7ef4\u6570\u7ec4\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000101","title":"\u6dfb\u52a0\u6700\u5c11\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000102","title":"\u524d\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000103","title":"\u5224\u65ad\u4e8c\u53c9\u6811\u662f\u5426\u662f\u4e00\u4e2a\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000104","title":"\u5c06\u5806\u8f6c\u6362\u4e3a\u4e00\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000105","title":"\u67e5\u627e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000106","title":"\u6811\u4e0a\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1000107","title":"\u4e8c\u53c9\u6811\u4e0a\u4e24\u70b9\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000108","title":"\u5224\u65ad\u8fde\u901a\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000109","title":"\u6700\u5c11\u7684\u64cd\u4f5c\u4f7f\u5c0f\u9547\u5b58\u5728\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1000110","title":"\u6709\u5e8f\u6570\u7ec4\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000111","title":"\u4e8c\u53c9\u67e5\u627e\u6811\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"1000112","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u6700\u540e\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000114","title":"\u5b9e\u73b0\u52a8\u6001\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000115","title":"\u4e58\u79ef\u6700\u5927\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000116","title":"\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1000117","title":"\u6811\u4e0a\u6700\u63a5\u8fd1\u7684\u4e24\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000118","title":"\u7ea6\u745f\u592b\u73af\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000119","title":"\u8ba1\u7b97\u8282\u70b9\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000120","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000121","title":"\u6ed1\u52a8\u7a97\u53e3\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000122","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"1000123","title":"\u5408\u5e76 K \u4e2a\u6700\u5c0f\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000124","title":"\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000125","title":"\u7b80\u5355\u8ba1\u7b97\u5668 V","__typename":"AppliedTranslationNode"},{"questionId":"1000126","title":"\u627e\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570II","__typename":"AppliedTranslationNode"},{"questionId":"1000127","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"1000128","title":"hanhan \u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000129","title":"\u5957\u5708\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000130","title":"\u79cb\u53f6\u6536\u85cf\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000131","title":"\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000132","title":"\u5bfc\u822a\u88c5\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000133","title":"\u5feb\u901f\u516c\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1000134","title":"\u8ffd\u9010\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000135","title":"\u79ef\u5206\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000136","title":"\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000137","title":"\u5927\u6570\u6c42\u4f59","__typename":"AppliedTranslationNode"},{"questionId":"1000138","title":"\u53e4\u8463\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000139","title":"\u901f\u7b97\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000140","title":"\u9ed1\u767d\u65b9\u683c\u753b","__typename":"AppliedTranslationNode"},{"questionId":"1000141","title":"\u6392\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000142","title":"\u7334\u5b50\u6253\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000143","title":"\u5bb6\u65cf\u5173\u7cfb","__typename":"AppliedTranslationNode"},{"questionId":"1000144","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000145","title":"OCR\u8bc6\u522b","__typename":"AppliedTranslationNode"},{"questionId":"1000146","title":"\u65e9\u9910\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000147","title":"\u9ed1\u76d2\u5149\u7ebf\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1000148","title":"\u98de\u8239\u68cb\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000149","title":"\u5206\u5272\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1000150","title":"\u53e4\u8001\u7684\u6e38\u620f\u673a","__typename":"AppliedTranslationNode"},{"questionId":"1000151","title":"01 \u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000152","title":"\u6392\u5217\u5c0f\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1000153","title":"\u82f1\u6587\u5355\u8bcd\u62fc\u5199\u7ea0\u9519\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1000154","title":"\u9b54\u6cd5\u6743\u6756\u5f3a\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1000155","title":"\u706b\u8f66\u7f16\u7ec4\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000156","title":"\u6700\u4fbf\u5b9c\u7684\u673a\u7968","__typename":"AppliedTranslationNode"},{"questionId":"1000157","title":"\u5b85\u7537\u7684\u751f\u6d3b","__typename":"AppliedTranslationNode"},{"questionId":"1000158","title":"\u4ea4\u901a\u8f68\u8ff9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000159","title":"\u7834\u8bd1\u5bc6\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000160","title":"DIST","__typename":"AppliedTranslationNode"},{"questionId":"1000161","title":"Hilbert \u66f2\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000162","title":"\u9879\u76ee\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000163","title":"\u7b97\u5f0f\u8f6c\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1000164","title":"\u5730\u7816\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000166","title":"\u7b80\u5355\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000167","title":"\u591a\u6e90 D \u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000168","title":"\u5de5\u4eba\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000169","title":"\u4e00\u5143\u4e00\u6b21\u65b9\u7a0b\u6c42\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000170","title":"\u5783\u573e\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000171","title":"\u91cd\u590d\u5b57\u7b26\u4e32\u91cd\u547d\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000172","title":"\u5192\u6ce1\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000173","title":"\u627e\u51fa\u6700\u957f\u5b57\u7b26\u4e32\u5e76\u8f93\u51fa","__typename":"AppliedTranslationNode"},{"questionId":"1000174","title":"\u8ba1\u7b97\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000175","title":"\u63a5\u9a7e\u6700\u77ed\u8ddd\u79bb\u7b97\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000176","title":"\u51e0\u4f55\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"1000177","title":"\u5207\u5272\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000178","title":"\u5e8f\u5217\u79fb\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1000179","title":"\u8bf7\u5b9e\u73b0\u51fd\u6570 parseQueryString","__typename":"AppliedTranslationNode"},{"questionId":"1000181","title":"\u8bf7\u5b9e\u73b0\u4e0b\u9762\u7684\u94fe\u5f0f\u8c03\u7528\u51fd\u6570\uff0c\u4ee5\u4f7f\u5176\u80fd\u591f\u5b9e\u73b0\u94fe\u5f0f\u8c03\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1000182","title":"7. \u5316\u5b66\u516c\u5f0f\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000183","title":"3. \u53e4\u751f\u7269\u8840\u7f18\u8fdc\u8fd1\u5224\u5b9a","__typename":"AppliedTranslationNode"},{"questionId":"1000184","title":"10. \u6570\u7ec4\u7ec4\u6210\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000185","title":"16. \u6700\u77ed\u79fb\u52a8\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000186","title":"2. \u53d1\u4e0b\u5348\u8336","__typename":"AppliedTranslationNode"},{"questionId":"1000187","title":"4. \u673a\u5668\u4eba\u8df3\u8dc3\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000188","title":"6. \u590f\u5b63\u7279\u60e0","__typename":"AppliedTranslationNode"},{"questionId":"1000189","title":"\u5c0f\u7f8e\u7684\u7528\u6237\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000190","title":"\u5c0f\u7f8e\u7684\u4ed3\u5e93\u6574\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000191","title":"\u5c0f\u7f8e\u7684\u8dd1\u817f\u4ee3\u8d2d","__typename":"AppliedTranslationNode"},{"questionId":"1000192","title":"\u5c0f\u56e2\u7684\u590d\u5236\u7c98\u8d34","__typename":"AppliedTranslationNode"},{"questionId":"1000193","title":"\u5c0f\u7f8e\u7684\u533a\u57df\u4f1a\u8bae","__typename":"AppliedTranslationNode"},{"questionId":"1000194","title":"\u5c0f\u56e2\u7684\u795e\u79d8\u6697\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000195","title":"\u5c0f\u56e2\u7684\u9009\u8c03\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000196","title":"\u5c0f\u56e2\u65e0\u8def\u53ef\u9003","__typename":"AppliedTranslationNode"},{"questionId":"1000197","title":"\u5c0f\u56e2\u7684\u88c5\u9970\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1000198","title":"\u5c0f\u56e2\u7684\u9ed8\u5951\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000199","title":"\u642d\u914d\u51fa\u552e","__typename":"AppliedTranslationNode"},{"questionId":"1000200","title":"\u5c0f\u7f8e\u7684\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1000201","title":"\u504f\u7231\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000202","title":"\u5c0f\u56e2\u7684 AB \u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000203","title":"\u5341\u5b57\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1000204","title":"\u5b8c\u5168\u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000205","title":"\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000206","title":"5-sum","__typename":"AppliedTranslationNode"},{"questionId":"1000207","title":"\u5e8f\u5217\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000208","title":"\u7f16\u8f91\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"1000209","title":"\u6700\u591a\u7684\u786c\u5e01\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000210","title":"\u6700\u5c11\u7684\u786c\u5e01\u79cd\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000211","title":"\u5b50\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000212","title":"\u5b50\u4e32\u5305\u542b\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000213","title":"\u53d6\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000214","title":"\u6811\u7684\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000215","title":"\u91c7\u8d2d\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1000216","title":"\u4e50\u56e2\u7ad9\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1000217","title":"\u7279\u6b8a\u4e8c\u8fdb\u5236\u8868\u793a\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000218","title":"\u53d8\u6362\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000219","title":"\u6279\u91cf\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1000220","title":"\u7535\u52a8\u8f66\u6e38\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1000221","title":"\u84c4\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"1000222","title":"\u6700\u591a\u724c\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000223","title":"\u5b88\u536b\u57ce\u5821","__typename":"AppliedTranslationNode"},{"questionId":"1000224","title":"\u9b54\u5854\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000225","title":"\u4e0b\u8f7d\u63d2\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"1000226","title":"\u5b8c\u6210\u4e00\u534a\u9898\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000227","title":"\u4e3b\u9898\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000228","title":"\u6574\u6570\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000229","title":"\u5141\u8bb8\u91cd\u590d\u9009\u62e9\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000230","title":"\u524d n \u4e2a\u6570\u5b57\u4e8c\u8fdb\u5236\u4e2d 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000231","title":"\u4e8c\u8fdb\u5236\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000232","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000233","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 ","__typename":"AppliedTranslationNode"},{"questionId":"1000234","title":"\u6ca1\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000235","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217 ","__typename":"AppliedTranslationNode"},{"questionId":"1000236","title":"\u5355\u8bcd\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000237","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000238","title":"\u751f\u6210\u5339\u914d\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000239","title":"\u6570\u7ec4\u4e2d\u548c\u4e3a 0 \u7684\u4e09\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000240","title":"\u5206\u5272\u56de\u6587\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000241","title":"\u590d\u539f IP ","__typename":"AppliedTranslationNode"},{"questionId":"1000242","title":"\u548c\u5927\u4e8e\u7b49\u4e8e target \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000243","title":"\u722c\u697c\u68af\u7684\u6700\u5c11\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1000244","title":"\u4e58\u79ef\u5c0f\u4e8e K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000245","title":"\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000246","title":"\u548c\u4e3a k \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000247","title":"0 \u548c 1 \u4e2a\u6570\u76f8\u540c\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000248","title":"\u5de6\u53f3\u4e24\u8fb9\u5b50\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1000249","title":"\u4e8c\u7ef4\u5b50\u77e9\u9635\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000250","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000251","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000252","title":"\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000253","title":"\u542b\u6709\u6240\u6709\u5b57\u7b26\u7684\u6700\u77ed\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000254","title":"\u6709\u6548\u7684\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000255","title":"\u6700\u591a\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u5f97\u5230\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000256","title":"\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000257","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c n \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000258","title":"\u94fe\u8868\u4e2d\u73af\u7684\u5165\u53e3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000259","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u91cd\u5408\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000260","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000261","title":"\u94fe\u8868\u4e2d\u7684\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1000262","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000263","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000264","title":"\u5c55\u5e73\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000265","title":"\u6392\u5e8f\u7684\u5faa\u73af\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000266","title":"\u73af\u5f62\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000267","title":"\u63d2\u5165\u3001\u5220\u9664\u548c\u968f\u673a\u8bbf\u95ee\u90fd\u662f O(1) \u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000268","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1000269","title":"\u7ffb\u8f6c\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1000270","title":"\u6700\u8fd1\u6700\u5c11\u4f7f\u7528\u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000271","title":"\u6700\u957f\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000272","title":"\u6700\u5c11\u56de\u6587\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"1000273","title":"\u6709\u6548\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000274","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000275","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000276","title":"\u5916\u661f\u8bed\u8a00\u662f\u5426\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000277","title":"\u5b57\u7b26\u4e32\u4ea4\u7ec7","__typename":"AppliedTranslationNode"},{"questionId":"1000278","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000279","title":"\u540e\u7f00\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1000280","title":"\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000281","title":"\u5c0f\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"1000282","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000283","title":"\u76f4\u65b9\u56fe\u6700\u5927\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000284","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1000285","title":"\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000286","title":"\u4e09\u89d2\u5f62\u4e2d\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000287","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000288","title":"\u52a0\u51cf\u7684\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000289","title":"\u6700\u5c11\u7684\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000290","title":"\u6392\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000291","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000292","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000293","title":"\u6700\u8fd1\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000294","title":"\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000295","title":"\u5f80\u5b8c\u5168\u4e8c\u53c9\u6811\u6dfb\u52a0\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000296","title":"\u77e9\u9635\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000297","title":"\u4e8c\u53c9\u6811\u6bcf\u5c42\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000298","title":"\u4e8c\u53c9\u6811\u6700\u5e95\u5c42\u6700\u5de6\u8fb9\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000299","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u4fa7\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000300","title":"\u5355\u8bcd\u6f14\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"1000301","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"1000302","title":"\u5f00\u5bc6\u7801\u9501","__typename":"AppliedTranslationNode"},{"questionId":"1000303","title":"\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000304","title":"\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000305","title":"\u8ba1\u7b97\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000306","title":"\u4ece\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u7684\u8def\u5f84\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000307","title":"\u5411\u4e0b\u7684\u8def\u5f84\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000308","title":"\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000309","title":"\u8282\u70b9\u4e4b\u548c\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000310","title":"\u8bfe\u7a0b\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000311","title":"\u5c55\u5e73\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000312","title":"\u5916\u661f\u6587\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000313","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"1000314","title":"\u91cd\u5efa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000315","title":"\u6240\u6709\u5927\u4e8e\u7b49\u4e8e\u8282\u70b9\u7684\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000316","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000317","title":"\u76f8\u4f3c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000318","title":"\u591a\u4f59\u7684\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1000319","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u4e24\u4e2a\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000320","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000321","title":"\u503c\u548c\u4e0b\u6807\u4e4b\u5dee\u90fd\u5728\u7ed9\u5b9a\u7684\u8303\u56f4\u5185","__typename":"AppliedTranslationNode"},{"questionId":"1000322","title":"\u65e5\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000323","title":"\u6570\u636e\u6d41\u7684\u7b2c K \u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000324","title":"\u51fa\u73b0\u9891\u7387\u6700\u9ad8\u7684 k \u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000325","title":"\u5b9e\u73b0\u524d\u7f00\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000326","title":"\u548c\u6700\u5c0f\u7684 k \u4e2a\u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1000327","title":"\u66ff\u6362\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000328","title":"\u795e\u5947\u7684\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000329","title":"\u6700\u77ed\u7684\u5355\u8bcd\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000330","title":"\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000331","title":"\u6700\u5927\u7684\u5f02\u6216","__typename":"AppliedTranslationNode"},{"questionId":"1000332","title":"\u67e5\u627e\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000333","title":"\u5c71\u5cf0\u6570\u7ec4\u7684\u9876\u90e8","__typename":"AppliedTranslationNode"},{"questionId":"1000334","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000335","title":"\u6309\u6743\u91cd\u751f\u6210\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000336","title":"\u6c42\u5e73\u65b9\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000337","title":"\u72d2\u72d2\u5403\u9999\u8549","__typename":"AppliedTranslationNode"},{"questionId":"1000338","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000339","title":"\u6570\u7ec4\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000340","title":"\u6570\u7ec4\u4e2d\u7684\u7b2c k \u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000341","title":"\u94fe\u8868\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000342","title":"\u5408\u5e76\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000343","title":"\u6240\u6709\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000344","title":"\u542b\u6709 k \u4e2a\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000345","title":"\u8def\u5f84\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000346","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000347","title":"\u8f66\u961f\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000348","title":"\u8f66\u8f86\u5b89\u6392","__typename":"AppliedTranslationNode"},{"questionId":"1000349","title":"\u8def\u5f84\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000350","title":"\u8c01\u6321\u4f4f\u4e86\u6211\u7684\u7ea2\u7eff\u706f","__typename":"AppliedTranslationNode"},{"questionId":"1000351","title":"\u65b0\u589e\u7684\u4e13\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000352","title":"\u6700\u5927\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000353","title":"\u5f55\u53d6\u5206\u6570\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000354","title":"\u8c03\u6574\u7535\u5e73","__typename":"AppliedTranslationNode"},{"questionId":"1000355","title":"\u7b7e\u5230\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000356","title":"\u81ea\u884c\u8f66\u62c9\u529b\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"1000358","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000359","title":"\u73af\u5f62\u95ef\u5173\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000360","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000361","title":"\u5165\u573a\u5b89\u68c0","__typename":"AppliedTranslationNode"},{"questionId":"1000362","title":"\u5f00\u5e55\u5f0f\u7130\u706b","__typename":"AppliedTranslationNode"},{"questionId":"1000363","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000364","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000367","title":"\u5341\u5b57\u8def\u53e3\u7684\u4ea4\u901a","__typename":"AppliedTranslationNode"},{"questionId":"1000368","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000369","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000370","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000371","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000373","title":"\u5fd7\u613f\u8005\u8c03\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000374","title":"\u65e0\u9650\u68cb\u5c40","__typename":"AppliedTranslationNode"},{"questionId":"1000375","title":"\u81ea\u884c\u8f66\u70ab\u6280\u8d5b\u573a","__typename":"AppliedTranslationNode"},{"questionId":"1000378","title":"\u95f4\u9694\u5220\u9664\u94fe\u8868\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000379","title":"\u5730\u94c1\u8def\u7ebf\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000382","title":"\u67f1\u72b6\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000383","title":"\u7535\u5b66\u5b9e\u9a8c\u8bfe","__typename":"AppliedTranslationNode"}]}} \ No newline at end of file From 4bfd960700ca11ac64bd67c34efc8c3ebbdd0584 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Mon, 11 Oct 2021 14:51:07 +0800 Subject: [PATCH 3/8] =?UTF-8?q?2034:=E8=82=A1=E7=A5=A8=E4=BB=B7=E6=A0=BC?= =?UTF-8?q?=E6=B3=A2=E5=8A=A8?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../editor/cn/StockPriceFluctuation.java | 160 ++++++++++++++++++ .../cn/doc/content/StockPriceFluctuation.md | 56 ++++++ 2 files changed, 216 insertions(+) create mode 100644 src/main/java/leetcode/editor/cn/StockPriceFluctuation.java create mode 100644 src/main/java/leetcode/editor/cn/doc/content/StockPriceFluctuation.md diff --git a/src/main/java/leetcode/editor/cn/StockPriceFluctuation.java b/src/main/java/leetcode/editor/cn/StockPriceFluctuation.java new file mode 100644 index 0000000..9cd930b --- /dev/null +++ b/src/main/java/leetcode/editor/cn/StockPriceFluctuation.java @@ -0,0 +1,160 @@ +//给你一支股票价格的数据流。数据流中每一条记录包含一个 时间戳 和该时间点股票对应的 价格 。 +// +// 不巧的是，由于股票市场内在的波动性，股票价格记录可能不是按时间顺序到来的。某些情况下，有的记录可能是错的。如果两个有相同时间戳的记录出现在数据流中，前一条 +//记录视为错误记录，后出现的记录 更正 前一条错误的记录。 +// +// 请你设计一个算法，实现： +// +// +// 更新 股票在某一时间戳的股票价格，如果有之前同一时间戳的价格，这一操作将 更正 之前的错误价格。 +// 找到当前记录里 最新股票价格 。最新股票价格 定义为时间戳最晚的股票价格。 +// 找到当前记录里股票的 最高价格 。 +// 找到当前记录里股票的 最低价格 。 +// +// +// 请你实现 StockPrice 类： +// +// +// StockPrice() 初始化对象，当前无股票价格记录。 +// void update(int timestamp, int price) 在时间点 timestamp 更新股票价格为 price 。 +// int current() 返回股票 最新价格 。 +// int maximum() 返回股票 最高价格 。 +// int minimum() 返回股票 最低价格 。 +// +// +// +// +// 示例 1： +// +// 输入： +//["StockPrice", "update", "update", "current", "maximum", "update", "maximum", +//"update", "minimum"] +//[[], [1, 10], [2, 5], [], [], [1, 3], [], [4, 2], []] +//输出： +//[null, null, null, 5, 10, null, 5, null, 2] +// +//解释： +//StockPrice stockPrice = new StockPrice(); +//stockPrice.update(1, 10); // 时间戳为 [1] ，对应的股票价格为 [10] 。 +//stockPrice.update(2, 5); // 时间戳为 [1,2] ，对应的股票价格为 [10,5] 。 +//stockPrice.current(); // 返回 5 ，最新时间戳为 2 ，对应价格为 5 。 +//stockPrice.maximum(); // 返回 10 ，最高价格的时间戳为 1 ，价格为 10 。 +//stockPrice.update(1, 3); // 之前时间戳为 1 的价格错误，价格更新为 3 。 +// // 时间戳为 [1,2] ，对应股票价格为 [3,5] 。 +//stockPrice.maximum(); // 返回 5 ，更正后最高价格为 5 。 +//stockPrice.update(4, 2); // 时间戳为 [1,2,4] ，对应价格为 [3,5,2] 。 +//stockPrice.minimum(); // 返回 2 ，最低价格时间戳为 4 ，价格为 2 。 +// +// +// +// +// 提示： +// +// +// 1 <= timestamp, price <= 10⁹ +// update，current，maximum 和 minimum 总 调用次数不超过 10⁵ 。 +// current，maximum 和 minimum 被调用时，update 操作 至少 已经被调用过 一次 。 +// +// 👍 6 👎 0 + +package leetcode.editor.cn; + +import java.util.TreeMap; + +//2034:股票价格波动 +class StockPriceFluctuation { + public static void main(String[] args) { + //测试代码 +// Solution solution = new StockPriceFluctuation().new Solution(); + StockPrice stockPrice = new StockPriceFluctuation().new StockPrice(); + stockPrice.update(38, 2308); + stockPrice.maximum(); + stockPrice.current(); + stockPrice.minimum(); + stockPrice.maximum(); + stockPrice.maximum(); + stockPrice.maximum(); + stockPrice.minimum(); + stockPrice.minimum(); + stockPrice.maximum(); + stockPrice.update(47, 7876); + stockPrice.maximum(); + stockPrice.minimum(); + stockPrice.update(58, 1866); + stockPrice.maximum(); + stockPrice.minimum(); + stockPrice.current(); + stockPrice.maximum(); + stockPrice.update(43, 121); + stockPrice.minimum(); + stockPrice.maximum(); + stockPrice.update(40, 5339); + stockPrice.maximum(); + stockPrice.maximum(); + stockPrice.current(); + stockPrice.update(32, 5339); + stockPrice.current();// + stockPrice.minimum(); + stockPrice.update(43, 6414); + stockPrice.update(49, 9369); + stockPrice.minimum(); + stockPrice.minimum(); + stockPrice.update(36, 3192); + stockPrice.current();// + stockPrice.update(48, 1006); + stockPrice.maximum(); + stockPrice.update(53, 8013); + stockPrice.minimum(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class StockPrice { + + TreeMap map; + TreeMap priceMap; + int cur; + + public StockPrice() { + map = new TreeMap<>(); + priceMap = new TreeMap<>(); + cur = 0; + } + + public void update(int timestamp, int price) { + if (map.containsKey(timestamp)) { + int oldPrice = map.get(timestamp); + priceMap.put(oldPrice, priceMap.get(oldPrice) - 1); + if (priceMap.get(oldPrice) == 0) { + priceMap.remove(oldPrice); + } + } + priceMap.put(price, priceMap.getOrDefault(price, 0) + 1); + map.put(timestamp, price); + cur = Math.max(cur, timestamp); + } + + public int current() { + return map.get(cur); + } + + public int maximum() { + return priceMap.lastKey(); + } + + public int minimum() { + return priceMap.firstKey(); + } + } + +/** + * Your StockPrice object will be instantiated and called as such: + * StockPrice obj = new StockPrice(); + * obj.update(timestamp,price); + * int param_2 = obj.current(); + * int param_3 = obj.maximum(); + * int param_4 = obj.minimum(); + */ +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/StockPriceFluctuation.md b/src/main/java/leetcode/editor/cn/doc/content/StockPriceFluctuation.md new file mode 100644 index 0000000..83cc75f --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/StockPriceFluctuation.md @@ -0,0 +1,56 @@ +

    给你一支股票价格的数据流。数据流中每一条记录包含一个 时间戳 和该时间点股票对应的 价格 。

    + +

    不巧的是，由于股票市场内在的波动性，股票价格记录可能不是按时间顺序到来的。某些情况下，有的记录可能是错的。如果两个有相同时间戳的记录出现在数据流中，前一条记录视为错误记录，后出现的记录 更正 前一条错误的记录。

    + +

    请你设计一个算法，实现：

    + +
      +
    • 更新 股票在某一时间戳的股票价格，如果有之前同一时间戳的价格，这一操作将 更正 之前的错误价格。
      • +
    • 找到当前记录里 最新股票价格 。最新股票价格 定义为时间戳最晚的股票价格。
      • +
    • 找到当前记录里股票的 最高价格 。
      • +
    • 找到当前记录里股票的 最低价格 。
      • +
    + +

    请你实现 StockPrice 类：

    + +
      +
    • StockPrice() 初始化对象，当前无股票价格记录。
      • +
    • void update(int timestamp, int price) 在时间点 timestamp 更新股票价格为 price 。
      • +
    • int current() 返回股票 最新价格 。
      • +
    • int maximum() 返回股票 最高价格 。
      • +
    • int minimum() 返回股票 最低价格 。
      • +
    + +

     

    + +

    示例 1：

    + +
    输入：
+["StockPrice", "update", "update", "current", "maximum", "update", "maximum", "update", "minimum"]
+[[], [1, 10], [2, 5], [], [], [1, 3], [], [4, 2], []]
+输出：
+[null, null, null, 5, 10, null, 5, null, 2]
+
+解释：
+StockPrice stockPrice = new StockPrice();
+stockPrice.update(1, 10); // 时间戳为 [1] ，对应的股票价格为 [10] 。
+stockPrice.update(2, 5);  // 时间戳为 [1,2] ，对应的股票价格为 [10,5] 。
+stockPrice.current();     // 返回 5 ，最新时间戳为 2 ，对应价格为 5 。
+stockPrice.maximum();     // 返回 10 ，最高价格的时间戳为 1 ，价格为 10 。
+stockPrice.update(1, 3);  // 之前时间戳为 1 的价格错误，价格更新为 3 。
+                          // 时间戳为 [1,2] ，对应股票价格为 [3,5] 。
+stockPrice.maximum();     // 返回 5 ，更正后最高价格为 5 。
+stockPrice.update(4, 2);  // 时间戳为 [1,2,4] ，对应价格为 [3,5,2] 。
+stockPrice.minimum();     // 返回 2 ，最低价格时间戳为 4 ，价格为 2 。
+
    + +

     

    + +

    提示：

    + +
      +
    • 1 <= timestamp, price <= 109
      • +
    • update，current，maximum 和 minimum 总 调用次数不超过 105 。
      • +
    • current，maximum 和 minimum 被调用时，update 操作 至少 已经被调用过 一次 。
      • +
    +
  • 👍 6
  • 👎 0
    • \ No newline at end of file From e62c01ab9b4f14cc296fbfd14c149fa1c25e957e Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Tue, 12 Oct 2021 12:19:32 +0800 Subject: [PATCH 4/8] =?UTF-8?q?29:=E4=B8=A4=E6=95=B0=E7=9B=B8=E9=99=A4?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../leetcode/editor/cn/DivideTwoIntegers.java | 87 +++++++++++++++++++ src/main/java/leetcode/editor/cn/doc/all.json | 2 +- .../cn/doc/content/DivideTwoIntegers.md | 30 +++++++ .../leetcode/editor/cn/doc/translation.json | 2 +- 4 files changed, 119 insertions(+), 2 deletions(-) create mode 100644 src/main/java/leetcode/editor/cn/DivideTwoIntegers.java create mode 100644 src/main/java/leetcode/editor/cn/doc/content/DivideTwoIntegers.md diff --git a/src/main/java/leetcode/editor/cn/DivideTwoIntegers.java b/src/main/java/leetcode/editor/cn/DivideTwoIntegers.java new file mode 100644 index 0000000..0aba82a --- /dev/null +++ b/src/main/java/leetcode/editor/cn/DivideTwoIntegers.java @@ -0,0 +1,87 @@ +//给定两个整数，被除数 dividend 和除数 divisor。将两数相除，要求不使用乘法、除法和 mod 运算符。 +// +// 返回被除数 dividend 除以除数 divisor 得到的商。 +// +// 整数除法的结果应当截去（truncate）其小数部分，例如：truncate(8.345) = 8 以及 truncate(-2.7335) = -2 +// +// +// +// 示例 1: +// +// 输入: dividend = 10, divisor = 3 +//输出: 3 +//解释: 10/3 = truncate(3.33333..) = truncate(3) = 3 +// +// 示例 2: +// +// 输入: dividend = 7, divisor = -3 +//输出: -2 +//解释: 7/-3 = truncate(-2.33333..) = -2 +// +// +// +// 提示： +// +// +// 被除数和除数均为 32 位有符号整数。 +// 除数不为 0。 +// 假设我们的环境只能存储 32 位有符号整数，其数值范围是 [−2³¹, 231 − 1]。本题中，如果除法结果溢出，则返回 231 − 1。 +// +// Related Topics 位运算 数学 👍 700 👎 0 + +package leetcode.editor.cn; + +//29:两数相除 +class DivideTwoIntegers { + public static void main(String[] args) { + //测试代码 + Solution solution = new DivideTwoIntegers().new Solution(); + solution.divide(-2147483648, 2); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int divide(int dividend, int divisor) { + if (divisor == 0 || dividend == 0) { + return 0; + } + if (divisor == 1) { + return dividend; + } + if (divisor == -1) { + return dividend == -2147483648 ? 2147483647 : -dividend; + } + if (divisor == -2147483648) { + return dividend == -2147483648 ? 1 : 0; + } + int count = 0; + int bl1 = 0; + int bl2 = 0; + int temp = dividend; + if (dividend == -2147483648) { + dividend = 2147483647; + bl1 = 1; + } else if (dividend < 0) { + dividend = -dividend; + bl1 = 1; + } + if (divisor < 0) { + divisor = -divisor; + bl2 = 1; + } + while (dividend >= divisor) { + count++; + dividend -= divisor; + } + if (temp == -2147483648) { + if (dividend + 1 >= divisor) { + count++; + } + } + return (bl1 ^ bl2) == 0 ? count : -count; + } + } +//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 9cb862a..0dc26df 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.3526394025088826,"acs":19453,"articleLive":2,"columnArticles":237,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":55164,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.5207755026639747,"acs":2559722,"articleLive":2,"columnArticles":14383,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4915212,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40918663397525673,"acs":1019689,"articleLive":2,"columnArticles":7245,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2491990,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.381000509717602,"acs":1265473,"articleLive":2,"columnArticles":7556,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3321447,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40880286422438716,"acs":523181,"articleLive":2,"columnArticles":3885,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1279788,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3553228147394037,"acs":751097,"articleLive":2,"columnArticles":4061,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2113844,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5072361936387317,"acs":308252,"articleLive":2,"columnArticles":2501,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":607709,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35251365150774217,"acs":848457,"articleLive":2,"columnArticles":5335,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2406877,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21722044797309575,"acs":352665,"articleLive":2,"columnArticles":2710,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1623535,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5837505431317537,"acs":781907,"articleLive":2,"columnArticles":4976,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1339454,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31615551821137616,"acs":207699,"articleLive":2,"columnArticles":1251,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":656952,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6273790153446202,"acs":544437,"articleLive":2,"columnArticles":3092,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":867796,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.664778818341795,"acs":230062,"articleLive":2,"columnArticles":1798,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":346073,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6319342866353873,"acs":474364,"articleLive":2,"columnArticles":3932,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":750654,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4099967182915439,"acs":633415,"articleLive":2,"columnArticles":3950,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1544927,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3366224200801687,"acs":669645,"articleLive":2,"columnArticles":3161,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1989306,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4590313499235368,"acs":264145,"articleLive":2,"columnArticles":1450,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":575440,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5731341053418005,"acs":345213,"articleLive":2,"columnArticles":3112,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":602325,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39859133206518943,"acs":224837,"articleLive":2,"columnArticles":1545,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":564079,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4296694399804715,"acs":528053,"articleLive":2,"columnArticles":3948,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1228975,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4450186384608542,"acs":795441,"articleLive":2,"columnArticles":5640,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1787433,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.667420984793681,"acs":727011,"articleLive":2,"columnArticles":3524,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1089284,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7727626021083078,"acs":356929,"articleLive":2,"columnArticles":2682,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":461887,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5599845057223953,"acs":331055,"articleLive":2,"columnArticles":2135,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":591186,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7030993321856756,"acs":321431,"articleLive":2,"columnArticles":2551,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":457163,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6577192139946473,"acs":234200,"articleLive":2,"columnArticles":2223,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":356079,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.538965857759265,"acs":825776,"articleLive":2,"columnArticles":4597,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1532149,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.597156039726166,"acs":489616,"articleLive":2,"columnArticles":4141,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":819913,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4057206575229509,"acs":476284,"articleLive":2,"columnArticles":3269,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1173921,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20774871528379238,"acs":111538,"articleLive":2,"columnArticles":905,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":536889,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35893074442855494,"acs":80819,"articleLive":2,"columnArticles":601,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":225166,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3731612656468503,"acs":218546,"articleLive":2,"columnArticles":1761,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":585661,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3567537275725533,"acs":194165,"articleLive":2,"columnArticles":1311,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":544255,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42775952391893757,"acs":372339,"articleLive":2,"columnArticles":2456,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":870440,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4234916679493908,"acs":349409,"articleLive":2,"columnArticles":3353,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":825067,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46308194621140003,"acs":520518,"articleLive":2,"columnArticles":4005,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1124030,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6402022787343945,"acs":206608,"articleLive":2,"columnArticles":1464,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":322723,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706565273160389,"acs":102479,"articleLive":2,"columnArticles":868,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":152804,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5804773447697185,"acs":217917,"articleLive":2,"columnArticles":2289,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":375410,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277143411340156,"acs":341405,"articleLive":2,"columnArticles":1990,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":469147,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6224226016598018,"acs":203699,"articleLive":2,"columnArticles":1417,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":327268,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41977149156874044,"acs":167535,"articleLive":2,"columnArticles":1431,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":399110,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5818786791136203,"acs":331043,"articleLive":2,"columnArticles":2470,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":568921,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.448999565311323,"acs":172498,"articleLive":2,"columnArticles":1166,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":384183,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32830481875807743,"acs":85354,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":259984,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4301275178264717,"acs":206601,"articleLive":2,"columnArticles":1653,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":480325,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7830846243441495,"acs":428944,"articleLive":2,"columnArticles":2744,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":547762,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6380760263026906,"acs":219204,"articleLive":2,"columnArticles":1509,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":343539,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352413979316649,"acs":226011,"articleLive":2,"columnArticles":1904,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":307397,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6652547725110103,"acs":237003,"articleLive":2,"columnArticles":1342,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":356259,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37621086602750203,"acs":219390,"articleLive":2,"columnArticles":1300,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":583157,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7387807204445478,"acs":155684,"articleLive":2,"columnArticles":1557,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":210731,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8228366841090609,"acs":74693,"articleLive":2,"columnArticles":616,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90775,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.552777162737951,"acs":696544,"articleLive":2,"columnArticles":3845,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1260081,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4814406099518459,"acs":191960,"articleLive":2,"columnArticles":2028,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":398720,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4326794672473008,"acs":331458,"articleLive":2,"columnArticles":2544,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":766059,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46966426968631086,"acs":306842,"articleLive":2,"columnArticles":2354,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":653322,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41139291180972565,"acs":87349,"articleLive":2,"columnArticles":937,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":212325,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3765499832110136,"acs":251198,"articleLive":2,"columnArticles":2699,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":667104,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7897819322259786,"acs":129187,"articleLive":2,"columnArticles":1596,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":163573,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5243692726727143,"acs":90869,"articleLive":2,"columnArticles":965,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173292,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4175799545869676,"acs":199351,"articleLive":2,"columnArticles":2026,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":477396,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6623488612255669,"acs":318764,"articleLive":2,"columnArticles":2459,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":481263,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3919843908570167,"acs":184627,"articleLive":2,"columnArticles":1740,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":471006,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883006732281377,"acs":272671,"articleLive":2,"columnArticles":2110,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":396151,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2696107454230952,"acs":46448,"articleLive":2,"columnArticles":644,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":172278,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4573298628434554,"acs":354743,"articleLive":2,"columnArticles":3208,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":775683,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5428610059491618,"acs":196735,"articleLive":2,"columnArticles":1798,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":362404,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5243732301954555,"acs":37962,"articleLive":2,"columnArticles":576,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72395,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3920193726467259,"acs":392411,"articleLive":2,"columnArticles":1972,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1000999,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.530200623030325,"acs":583788,"articleLive":2,"columnArticles":3640,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1101070,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42157145711684907,"acs":94940,"articleLive":2,"columnArticles":836,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":225205,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142637010395253,"acs":178986,"articleLive":2,"columnArticles":1250,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":291383,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6044787506170624,"acs":134696,"articleLive":2,"columnArticles":991,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":222830,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46132317708613113,"acs":171758,"articleLive":2,"columnArticles":1722,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":372316,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5964045943717637,"acs":273436,"articleLive":2,"columnArticles":1892,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":458474,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42714859255562865,"acs":188317,"articleLive":2,"columnArticles":1286,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":440870,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700179477764318,"acs":224384,"articleLive":2,"columnArticles":1322,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":291401,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015657279547679,"acs":316996,"articleLive":2,"columnArticles":2074,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":395471,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45867256583679367,"acs":227658,"articleLive":2,"columnArticles":1434,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":496341,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6167577203030353,"acs":149470,"articleLive":2,"columnArticles":1338,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":242348,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4147987474828969,"acs":125448,"articleLive":2,"columnArticles":1002,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":302431,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5308747584196686,"acs":184316,"articleLive":2,"columnArticles":1706,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":347193,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385532191661414,"acs":321275,"articleLive":2,"columnArticles":1968,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":596552,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4335393059945766,"acs":185296,"articleLive":2,"columnArticles":1170,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":427403,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5159986421912943,"acs":98806,"articleLive":2,"columnArticles":697,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":191485,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6325630318063361,"acs":120879,"articleLive":2,"columnArticles":1113,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":191094,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48708328493437103,"acs":41933,"articleLive":2,"columnArticles":313,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86090,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5173275430683806,"acs":472453,"articleLive":2,"columnArticles":3307,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":913257,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7100757051083036,"acs":59466,"articleLive":2,"columnArticles":483,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":83746,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337231933518608,"acs":140011,"articleLive":2,"columnArticles":1234,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":220934,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30945614986258857,"acs":165525,"articleLive":2,"columnArticles":1535,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":534890,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5488204054537098,"acs":214951,"articleLive":2,"columnArticles":2051,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":391660,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5408149451739542,"acs":155805,"articleLive":2,"columnArticles":1349,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":288093,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556899891845636,"acs":572247,"articleLive":2,"columnArticles":2344,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":757251,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7023495622685906,"acs":101486,"articleLive":2,"columnArticles":635,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":144495,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6995967315366094,"acs":165328,"articleLive":2,"columnArticles":1309,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":236319,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4558499623149591,"acs":62296,"articleLive":2,"columnArticles":549,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":136659,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.350258519540467,"acs":353145,"articleLive":2,"columnArticles":1962,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1008241,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6116485969927101,"acs":72325,"articleLive":2,"columnArticles":595,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":118246,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6020829019736639,"acs":252985,"articleLive":2,"columnArticles":1904,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":420183,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5638954387908843,"acs":417308,"articleLive":2,"columnArticles":2289,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":740045,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420646644211974,"acs":403363,"articleLive":2,"columnArticles":2535,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":628228,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718521786806905,"acs":176266,"articleLive":2,"columnArticles":1603,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":308237,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661771464904179,"acs":521772,"articleLive":2,"columnArticles":2587,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":681007,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7046641530512499,"acs":252305,"articleLive":2,"columnArticles":1449,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":358050,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.721574835152494,"acs":134928,"articleLive":2,"columnArticles":897,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":186991,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6974421953078682,"acs":164694,"articleLive":2,"columnArticles":1321,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":236140,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7602895326429254,"acs":194108,"articleLive":2,"columnArticles":1203,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":255308,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.763030166663988,"acs":94953,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124442,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5635916391180987,"acs":259818,"articleLive":2,"columnArticles":1485,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":461004,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4865408128418322,"acs":274970,"articleLive":2,"columnArticles":1812,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":565153,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5262748360952535,"acs":273244,"articleLive":2,"columnArticles":1712,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":519204,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6276952166697145,"acs":181918,"articleLive":2,"columnArticles":1281,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":289819,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7260527981231634,"acs":180117,"articleLive":2,"columnArticles":1351,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":248077,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5220841180163214,"acs":62376,"articleLive":2,"columnArticles":686,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":119475,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7045595519949678,"acs":161292,"articleLive":2,"columnArticles":1235,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":228926,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6146344748627808,"acs":91264,"articleLive":2,"columnArticles":778,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":148485,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7310082849875491,"acs":218994,"articleLive":2,"columnArticles":1762,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":299578,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6676423253502569,"acs":146440,"articleLive":2,"columnArticles":1218,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":219339,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6815266715622588,"acs":180976,"articleLive":2,"columnArticles":1595,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":265545,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5735334133251668,"acs":571202,"articleLive":2,"columnArticles":3429,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":995935,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6896515683033,"acs":468481,"articleLive":2,"columnArticles":2677,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":679301,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5367568986051394,"acs":132952,"articleLive":2,"columnArticles":826,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":247695,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4449310780383327,"acs":162035,"articleLive":2,"columnArticles":1104,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":364180,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4729983449456798,"acs":280646,"articleLive":2,"columnArticles":1851,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":593334,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39603792932122583,"acs":37464,"articleLive":2,"columnArticles":330,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94597,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46853660189277296,"acs":124463,"articleLive":2,"columnArticles":658,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":265642,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5432885727435246,"acs":173528,"articleLive":2,"columnArticles":1129,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":319403,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6825364905401102,"acs":122187,"articleLive":2,"columnArticles":1127,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":179019,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44527919681892275,"acs":130571,"articleLive":2,"columnArticles":1188,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":293234,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230185092225699,"acs":135391,"articleLive":2,"columnArticles":881,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":187258,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49230754038788166,"acs":49855,"articleLive":2,"columnArticles":440,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101268,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6760060380692905,"acs":73444,"articleLive":2,"columnArticles":528,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":108644,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.576179683604551,"acs":127111,"articleLive":2,"columnArticles":983,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":220610,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4860360556143121,"acs":100643,"articleLive":2,"columnArticles":806,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":207069,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192724199157037,"acs":507182,"articleLive":2,"columnArticles":2297,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":705132,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197354745938865,"acs":101107,"articleLive":2,"columnArticles":760,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":140478,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6614562388171047,"acs":113492,"articleLive":2,"columnArticles":860,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":171579,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5156779006407319,"acs":196941,"articleLive":2,"columnArticles":1221,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":381907,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4902946273830156,"acs":53751,"articleLive":2,"columnArticles":547,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109630,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5125045527441368,"acs":537524,"articleLive":2,"columnArticles":2767,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1048818,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5528869156188762,"acs":301607,"articleLive":2,"columnArticles":1759,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":545513,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6211315524799931,"acs":129073,"articleLive":2,"columnArticles":1090,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":207803,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7038714853505922,"acs":419361,"articleLive":2,"columnArticles":1862,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":595792,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7506431472567651,"acs":305499,"articleLive":2,"columnArticles":1572,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":406983,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5261402222522477,"acs":237536,"articleLive":2,"columnArticles":1398,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":451469,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6817277635691958,"acs":100758,"articleLive":2,"columnArticles":790,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":147798,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671223620244136,"acs":213251,"articleLive":2,"columnArticles":1260,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":319658,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3415906033472682,"acs":47229,"articleLive":2,"columnArticles":516,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138262,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5354891947809656,"acs":134328,"articleLive":2,"columnArticles":1059,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":250851,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48400615516425044,"acs":171737,"articleLive":2,"columnArticles":1438,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":354824,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42142310151102036,"acs":186556,"articleLive":2,"columnArticles":1253,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":442681,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5669850561091803,"acs":213873,"articleLive":2,"columnArticles":1517,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":377211,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5317145665714725,"acs":114132,"articleLive":2,"columnArticles":900,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":214649,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5734428435828165,"acs":290587,"articleLive":2,"columnArticles":1612,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":506741,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7243533537921965,"acs":6609,"articleLive":2,"columnArticles":114,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9124,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5336922041718735,"acs":5552,"articleLive":2,"columnArticles":82,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10403,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5918580375782881,"acs":2835,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4790,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5469422617014007,"acs":16009,"articleLive":2,"columnArticles":193,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29270,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6145319729783932,"acs":340133,"articleLive":2,"columnArticles":1992,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":553483,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33635085252241165,"acs":7654,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22756,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49726702371843917,"acs":162482,"articleLive":2,"columnArticles":1103,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":326750,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3263771781899944,"acs":9290,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28464,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6100437219040581,"acs":59439,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97434,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192420734413801,"acs":86567,"articleLive":2,"columnArticles":925,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":166718,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3310326095639809,"acs":41438,"articleLive":2,"columnArticles":376,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":125178,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5867949900183441,"acs":297170,"articleLive":2,"columnArticles":1946,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":506429,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43242430880682253,"acs":84881,"articleLive":2,"columnArticles":756,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":196291,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6647393545145278,"acs":391582,"articleLive":2,"columnArticles":2213,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":589076,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41866846387137147,"acs":8697,"articleLive":2,"columnArticles":87,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20773,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7181706797357766,"acs":107852,"articleLive":2,"columnArticles":919,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":150176,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4400850238949773,"acs":91719,"articleLive":2,"columnArticles":597,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":208412,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8045828112722716,"acs":75774,"articleLive":2,"columnArticles":633,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94178,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4805467665486925,"acs":38425,"articleLive":2,"columnArticles":408,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":79961,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7395358355201387,"acs":307181,"articleLive":2,"columnArticles":1474,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":415370,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3558945978310745,"acs":254402,"articleLive":2,"columnArticles":1023,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":714824,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46300785104466086,"acs":129507,"articleLive":2,"columnArticles":501,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":279708,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6034788444586906,"acs":120493,"articleLive":2,"columnArticles":674,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":199664,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40962898680864324,"acs":122255,"articleLive":2,"columnArticles":971,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":298453,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4868919650452401,"acs":88144,"articleLive":2,"columnArticles":515,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":181034,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7018265577588332,"acs":165144,"articleLive":2,"columnArticles":679,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":235306,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967105837186982,"acs":182622,"articleLive":2,"columnArticles":589,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":229220,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6768840767287626,"acs":151664,"articleLive":2,"columnArticles":545,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":224062,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4768548197410839,"acs":103395,"articleLive":2,"columnArticles":678,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":216827,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4965602937807613,"acs":71531,"articleLive":2,"columnArticles":632,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":144053,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7565672526170255,"acs":7661,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10126,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5211619021966416,"acs":73525,"articleLive":2,"columnArticles":540,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":141079,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3925621264412556,"acs":90769,"articleLive":2,"columnArticles":700,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":231222,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4504329233768282,"acs":348445,"articleLive":2,"columnArticles":1732,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":773578,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6985528227561933,"acs":133177,"articleLive":2,"columnArticles":836,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":190647,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7492207225460553,"acs":192286,"articleLive":2,"columnArticles":1210,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":256648,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3561431554221584,"acs":21833,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61304,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.325107016564303,"acs":26202,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80595,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34500133475707423,"acs":10339,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29968,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43637229289254587,"acs":35745,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":81914,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653130331553716,"acs":102560,"articleLive":2,"columnArticles":393,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":154153,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5336706191175976,"acs":95146,"articleLive":2,"columnArticles":507,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":178286,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5157931664611526,"acs":394034,"articleLive":2,"columnArticles":2714,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":763938,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6524480678416422,"acs":143412,"articleLive":2,"columnArticles":1603,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":219806,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5573656868854152,"acs":334532,"articleLive":2,"columnArticles":2140,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":600202,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5244113301266937,"acs":50043,"articleLive":2,"columnArticles":327,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95427,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6193732830536949,"acs":171803,"articleLive":2,"columnArticles":1398,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":277382,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5164435904714076,"acs":236526,"articleLive":2,"columnArticles":1682,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":457990,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3778760452030156,"acs":169966,"articleLive":2,"columnArticles":736,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":449793,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5007376627004566,"acs":114720,"articleLive":2,"columnArticles":882,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":229102,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.723311564320213,"acs":721240,"articleLive":2,"columnArticles":7405,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":997136,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5432784113637907,"acs":143959,"articleLive":2,"columnArticles":946,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":264982,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7168131166854843,"acs":146022,"articleLive":2,"columnArticles":987,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":203710,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4729984537770141,"acs":197921,"articleLive":2,"columnArticles":1402,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":418439,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5426229017683493,"acs":90675,"articleLive":2,"columnArticles":680,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":167105,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48260243958272014,"acs":29515,"articleLive":2,"columnArticles":328,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61158,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46278841579448143,"acs":62258,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":134528,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4332019362874128,"acs":168691,"articleLive":2,"columnArticles":1551,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":389405,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37148086087442217,"acs":31259,"articleLive":2,"columnArticles":307,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84147,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6462878305653608,"acs":446740,"articleLive":2,"columnArticles":2328,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":691240,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7368766117400236,"acs":101154,"articleLive":2,"columnArticles":1044,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":137274,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5578976016125824,"acs":373089,"articleLive":2,"columnArticles":1741,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":668741,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5421692940370116,"acs":31641,"articleLive":2,"columnArticles":281,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58360,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4249087449149742,"acs":111867,"articleLive":2,"columnArticles":897,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":263273,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2865643816735215,"acs":64867,"articleLive":2,"columnArticles":422,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":226361,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4769089907798136,"acs":141156,"articleLive":2,"columnArticles":1002,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":295981,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7818629239269582,"acs":117876,"articleLive":2,"columnArticles":884,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":150763,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5231045879924525,"acs":41308,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":78967,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41793321031706765,"acs":71798,"articleLive":2,"columnArticles":660,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":171793,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6753990489907858,"acs":136925,"articleLive":2,"columnArticles":4760,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":202732,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7880043365178576,"acs":309640,"articleLive":2,"columnArticles":1880,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":392942,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4374142652563877,"acs":87052,"articleLive":2,"columnArticles":704,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":199015,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5798924427972929,"acs":57581,"articleLive":2,"columnArticles":650,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99296,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46427322240543645,"acs":37166,"articleLive":2,"columnArticles":319,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80052,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7418951756554845,"acs":139526,"articleLive":2,"columnArticles":881,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":188067,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5045332587705469,"acs":169615,"articleLive":2,"columnArticles":1224,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":336182,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6908735939575955,"acs":161719,"articleLive":2,"columnArticles":1283,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":234079,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4770713015671734,"acs":34612,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72551,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49698876532270675,"acs":314658,"articleLive":2,"columnArticles":2013,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":633129,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660430887207118,"acs":172320,"articleLive":2,"columnArticles":988,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":258722,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6808460817983141,"acs":261690,"articleLive":2,"columnArticles":1407,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":384360,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.848189106883526,"acs":210842,"articleLive":2,"columnArticles":1017,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":248579,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7233579503259345,"acs":140262,"articleLive":2,"columnArticles":883,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":193904,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49683027103847327,"acs":195771,"articleLive":2,"columnArticles":1339,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":394040,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47843932738311745,"acs":170999,"articleLive":2,"columnArticles":774,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":357410,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7381265425691417,"acs":32000,"articleLive":2,"columnArticles":288,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43353,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6456623501618689,"acs":295171,"articleLive":2,"columnArticles":1707,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":457160,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6562913907284769,"acs":8919,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13590,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5512402088772846,"acs":5067,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9192,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.601019143368682,"acs":4364,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7261,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4754621298871258,"acs":5813,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12226,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5250402252614642,"acs":5221,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9944,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4641106442577031,"acs":2651,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5712,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6380139982502188,"acs":5834,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9144,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6349654296599407,"acs":4500,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7087,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5437527856187788,"acs":3660,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6731,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5643513789581205,"acs":12155,"articleLive":2,"columnArticles":158,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21538,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5010675495869047,"acs":32386,"articleLive":2,"columnArticles":349,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":64634,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5697189284145806,"acs":5189,"articleLive":2,"columnArticles":75,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9108,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47488667271078877,"acs":5238,"articleLive":2,"columnArticles":61,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11030,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6407566451051802,"acs":11788,"articleLive":2,"columnArticles":186,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18397,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6827855290542495,"acs":144022,"articleLive":2,"columnArticles":1068,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":210933,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6921573953194957,"acs":78998,"articleLive":2,"columnArticles":656,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114133,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5655724706628608,"acs":7133,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12612,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7231839151690422,"acs":52514,"articleLive":2,"columnArticles":447,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72615,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49431654261150537,"acs":8567,"articleLive":2,"columnArticles":118,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17331,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43452474734970403,"acs":38611,"articleLive":2,"columnArticles":376,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":88858,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152428617445276,"acs":107170,"articleLive":2,"columnArticles":837,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":207999,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5800305929981138,"acs":100865,"articleLive":2,"columnArticles":615,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":173896,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5895305003427005,"acs":6881,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11672,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.673858755369094,"acs":6746,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10011,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44759059618132224,"acs":3446,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7699,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6256717711053623,"acs":153095,"articleLive":2,"columnArticles":1108,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":244689,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33844860206012195,"acs":6440,"articleLive":2,"columnArticles":107,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19028,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5535644064940172,"acs":9854,"articleLive":2,"columnArticles":139,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17801,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5532889258950874,"acs":2658,"articleLive":2,"columnArticles":45,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4804,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6476742013824024,"acs":3467,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5353,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.440052259829339,"acs":53891,"articleLive":2,"columnArticles":563,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122465,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.462037238281533,"acs":51020,"articleLive":2,"columnArticles":416,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110424,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4919393897460735,"acs":7110,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14453,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5701868089973313,"acs":7478,"articleLive":2,"columnArticles":84,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13115,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4533422679813824,"acs":187399,"articleLive":2,"columnArticles":1065,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":413372,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6322188262362023,"acs":204990,"articleLive":2,"columnArticles":1203,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":324239,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6850078778329899,"acs":5652,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8251,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7584583701088555,"acs":2578,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3399,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3915602501445163,"acs":7451,"articleLive":2,"columnArticles":80,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":19029,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6389843444352516,"acs":498149,"articleLive":2,"columnArticles":3404,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":779595,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7714991556695228,"acs":24671,"articleLive":2,"columnArticles":205,"formTitle":"[284]顶端迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":31978,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6347093114857413,"acs":8057,"articleLive":2,"columnArticles":103,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12694,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.509589161608164,"acs":11585,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22734,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6595741570487753,"acs":180474,"articleLive":2,"columnArticles":1231,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":273622,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43191044408906387,"acs":3511,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8129,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533106960950764,"acs":53244,"articleLive":2,"columnArticles":830,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70680,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45664635250105595,"acs":83248,"articleLive":2,"columnArticles":1108,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":182303,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5315635451505016,"acs":2543,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4784,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7083253788881841,"acs":115020,"articleLive":2,"columnArticles":766,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162383,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7116432463435618,"acs":4963,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6974,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5810616929698709,"acs":3645,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6273,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.523285248348938,"acs":64497,"articleLive":2,"columnArticles":505,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123254,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6201647117544298,"acs":2485,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4007,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.560380584491657,"acs":106191,"articleLive":2,"columnArticles":761,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":189498,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5777595884003742,"acs":4941,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8552,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5044921325634111,"acs":30491,"articleLive":2,"columnArticles":362,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60439,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.516730136272562,"acs":365955,"articleLive":2,"columnArticles":2030,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":708213,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5236452042977021,"acs":33385,"articleLive":2,"columnArticles":235,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":63755,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6563719115734721,"acs":2019,"articleLive":2,"columnArticles":38,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3076,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7264101330409193,"acs":129840,"articleLive":2,"columnArticles":797,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":178742,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5468698984413933,"acs":63648,"articleLive":2,"columnArticles":568,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116386,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.38336875664187037,"acs":4329,"articleLive":2,"columnArticles":64,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11292,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3373431690294872,"acs":16966,"articleLive":2,"columnArticles":251,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50293,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5400381208655679,"acs":24083,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44595,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6104525862068966,"acs":2266,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3712,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.608549271992897,"acs":118574,"articleLive":2,"columnArticles":944,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":194847,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37949168908200565,"acs":22009,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":57996,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7611241217798594,"acs":3575,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4697,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6830726937313865,"acs":56652,"articleLive":2,"columnArticles":382,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":82937,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6296478548362294,"acs":40946,"articleLive":2,"columnArticles":355,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65030,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5461465271170314,"acs":4592,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8408,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41823206698840903,"acs":50696,"articleLive":2,"columnArticles":480,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121215,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47647616040416796,"acs":67905,"articleLive":2,"columnArticles":538,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":142515,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48338572070049396,"acs":4306,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8908,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.685113279535402,"acs":20291,"articleLive":2,"columnArticles":180,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29617,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5185235049927073,"acs":23108,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44565,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6770667273969483,"acs":2973,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4391,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4243670785553191,"acs":26719,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62962,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4449241663050733,"acs":308639,"articleLive":2,"columnArticles":1829,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":693689,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6320934806501995,"acs":10927,"articleLive":2,"columnArticles":150,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17287,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784314308657764,"acs":25448,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67246,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5374964193640791,"acs":9382,"articleLive":2,"columnArticles":104,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17455,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044807747165017,"acs":136175,"articleLive":2,"columnArticles":578,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":269931,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42115836426163644,"acs":24738,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58738,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6559479676112542,"acs":129696,"articleLive":2,"columnArticles":1071,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":197723,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4859898982957669,"acs":56577,"articleLive":2,"columnArticles":493,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":116416,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.533866336354935,"acs":18964,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35522,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4799731626534894,"acs":45069,"articleLive":2,"columnArticles":506,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93899,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44966049973538125,"acs":39933,"articleLive":2,"columnArticles":329,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":88807,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46956864289935,"acs":4768,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10154,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41216861081654294,"acs":46641,"articleLive":2,"columnArticles":308,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":113160,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36995980021927155,"acs":3037,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8209,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4013370674857711,"acs":22212,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55345,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6077904789198534,"acs":131490,"articleLive":2,"columnArticles":926,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":216341,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869460538678359,"acs":160814,"articleLive":2,"columnArticles":1379,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":204352,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8092048401037165,"acs":3745,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4628,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.494778717056191,"acs":11940,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24132,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7273864880622272,"acs":51152,"articleLive":2,"columnArticles":489,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70323,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5161981053053809,"acs":87509,"articleLive":2,"columnArticles":771,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":169526,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6061663979783016,"acs":111297,"articleLive":2,"columnArticles":1054,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":183608,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7690202506474957,"acs":372042,"articleLive":2,"columnArticles":1959,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":483787,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5392725669241403,"acs":108843,"articleLive":2,"columnArticles":1032,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":201833,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7060741249142073,"acs":12345,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17484,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223916838548696,"acs":204287,"articleLive":2,"columnArticles":1508,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":328229,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5996827720839434,"acs":4915,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8196,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738952772073922,"acs":215922,"articleLive":2,"columnArticles":1523,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":292200,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5503635223999249,"acs":252001,"articleLive":2,"columnArticles":1410,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":457881,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5900505161432023,"acs":5373,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9106,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6804990326239242,"acs":20400,"articleLive":2,"columnArticles":337,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":29978,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42669753086419754,"acs":2212,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5184,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45381823807344474,"acs":70404,"articleLive":2,"columnArticles":544,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155137,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40741759081049705,"acs":26672,"articleLive":2,"columnArticles":439,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65466,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35285053929121724,"acs":1603,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4543,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5207064555420219,"acs":24795,"articleLive":2,"columnArticles":388,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47618,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.351797708415646,"acs":4452,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12655,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7270680078066356,"acs":4843,"articleLive":2,"columnArticles":57,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6661,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6020130006290627,"acs":2871,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4769,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5658210490229688,"acs":3301,"articleLive":2,"columnArticles":64,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5834,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6911213005418925,"acs":3316,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4798,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48970594783951077,"acs":32991,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67369,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7212406753042796,"acs":1837,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2547,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3657401422107304,"acs":33948,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92820,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7643277986073915,"acs":4281,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5601,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4389239668583595,"acs":77927,"articleLive":2,"columnArticles":620,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":177541,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.458998059274366,"acs":41862,"articleLive":2,"columnArticles":454,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91203,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.617566456563442,"acs":4507,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7298,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7224326130541323,"acs":3243,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4489,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127887400846314,"acs":80806,"articleLive":2,"columnArticles":507,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131866,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.511137415258797,"acs":14250,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27879,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.418057678589626,"acs":20512,"articleLive":2,"columnArticles":208,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49065,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5154016285075309,"acs":83426,"articleLive":2,"columnArticles":568,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":161866,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4692728494193672,"acs":14669,"articleLive":2,"columnArticles":123,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31259,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46446972557522015,"acs":76265,"articleLive":2,"columnArticles":818,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":164198,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5090784140693942,"acs":65188,"articleLive":2,"columnArticles":554,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":128051,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390492387043203,"acs":80039,"articleLive":2,"columnArticles":565,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125247,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6386267817707287,"acs":3181,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4981,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5032486200551978,"acs":35010,"articleLive":2,"columnArticles":220,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":69568,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44143749086429035,"acs":21140,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47889,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6317686670627847,"acs":15949,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25245,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6018660924843637,"acs":70440,"articleLive":2,"columnArticles":770,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":117036,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5792274754091106,"acs":52350,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":90379,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4177036199095023,"acs":7385,"articleLive":2,"columnArticles":85,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17680,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7495161828495162,"acs":22463,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":29970,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5341168383567398,"acs":223780,"articleLive":2,"columnArticles":1212,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":418972,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5277488727020465,"acs":6086,"articleLive":2,"columnArticles":110,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11532,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6916271527392902,"acs":101082,"articleLive":2,"columnArticles":991,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":146151,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46735395189003437,"acs":7072,"articleLive":2,"columnArticles":95,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15132,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3577367205542725,"acs":4647,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12990,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152910318656175,"acs":147736,"articleLive":2,"columnArticles":1584,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":286704,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3911433910376194,"acs":11094,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28363,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5529059759735403,"acs":122702,"articleLive":2,"columnArticles":1310,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":221922,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205059640056485,"acs":51972,"articleLive":2,"columnArticles":429,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":99849,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42904599260749543,"acs":9170,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21373,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37719213488574327,"acs":15615,"articleLive":2,"columnArticles":193,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41398,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6578244533973111,"acs":14532,"articleLive":2,"columnArticles":122,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22091,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5918584318388473,"acs":42309,"articleLive":2,"columnArticles":529,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71485,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41672400447234886,"acs":19381,"articleLive":2,"columnArticles":198,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46508,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6139671989347052,"acs":53945,"articleLive":2,"columnArticles":657,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87863,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3271902192934815,"acs":81330,"articleLive":2,"columnArticles":589,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":248571,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4556108095256964,"acs":45993,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":100948,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5842161139190842,"acs":101254,"articleLive":2,"columnArticles":1130,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":173316,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5619626007046244,"acs":45619,"articleLive":2,"columnArticles":462,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81178,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7375326958535225,"acs":120400,"articleLive":2,"columnArticles":798,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":163247,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48401996920636403,"acs":10374,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21433,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3239966939112866,"acs":3528,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10889,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5561455375698855,"acs":94998,"articleLive":2,"columnArticles":1329,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":170815,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5648456329622403,"acs":39372,"articleLive":2,"columnArticles":319,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69704,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5022321428571429,"acs":900,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1792,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6738965130173444,"acs":74444,"articleLive":2,"columnArticles":379,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":110468,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6883362461679512,"acs":72075,"articleLive":2,"columnArticles":935,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":104709,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3932826757326615,"acs":87107,"articleLive":2,"columnArticles":1134,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":221487,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5383683157524866,"acs":150152,"articleLive":2,"columnArticles":1087,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":278902,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5076495815415916,"acs":175663,"articleLive":2,"columnArticles":992,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":346032,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48085497666510524,"acs":27716,"articleLive":2,"columnArticles":327,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":57639,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36102819237147593,"acs":2177,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6030,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7565420848469921,"acs":12287,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16241,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20780694454951207,"acs":2747,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13219,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223620395857911,"acs":33236,"articleLive":2,"columnArticles":306,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53403,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4272320477306627,"acs":2005,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4693,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.569921376251596,"acs":8481,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14881,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5313158083967662,"acs":51722,"articleLive":2,"columnArticles":450,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97347,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6156941649899397,"acs":1530,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2485,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6685895586962792,"acs":6954,"articleLive":2,"columnArticles":114,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10401,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6132719714964371,"acs":4131,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6736,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6511341222879684,"acs":2641,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4056,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6998542809416057,"acs":59074,"articleLive":2,"columnArticles":475,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":84409,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5876784212142657,"acs":44013,"articleLive":2,"columnArticles":673,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74893,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7322635135135135,"acs":867,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1184,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3790883190883191,"acs":6653,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17550,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.532302946994334,"acs":15877,"articleLive":2,"columnArticles":215,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29827,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3994258373205742,"acs":62610,"articleLive":2,"columnArticles":871,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":156750,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5077082368611373,"acs":97580,"articleLive":2,"columnArticles":859,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":192197,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4885130295851468,"acs":8867,"articleLive":2,"columnArticles":146,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18151,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743299177689067,"acs":124880,"articleLive":2,"columnArticles":1026,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":217436,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5187796727481155,"acs":95940,"articleLive":2,"columnArticles":843,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":184934,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5904276985743381,"acs":2899,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4910,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38015922178631245,"acs":16570,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43587,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4579502935539805,"acs":75271,"articleLive":2,"columnArticles":738,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":164365,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.697359825369258,"acs":43767,"articleLive":2,"columnArticles":444,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62761,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47716809965472884,"acs":56386,"articleLive":2,"columnArticles":693,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118168,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2519100793417573,"acs":3429,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13612,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885697272160154,"acs":83026,"articleLive":2,"columnArticles":939,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141064,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5517270984174226,"acs":19279,"articleLive":2,"columnArticles":172,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34943,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6628900949796472,"acs":48855,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73700,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6488286643731423,"acs":138619,"articleLive":2,"columnArticles":1092,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":213645,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5576867608883761,"acs":15468,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27736,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4866056908956775,"acs":61342,"articleLive":2,"columnArticles":622,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":126061,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7116086321934946,"acs":81909,"articleLive":2,"columnArticles":954,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115104,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5089420989331959,"acs":97752,"articleLive":2,"columnArticles":851,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":192069,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5563157151217937,"acs":27566,"articleLive":2,"columnArticles":311,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49551,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6031671286978316,"acs":79416,"articleLive":2,"columnArticles":497,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":131665,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5769931148651191,"acs":153359,"articleLive":2,"columnArticles":1255,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":265790,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3625073770647849,"acs":57125,"articleLive":2,"columnArticles":460,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157583,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4360971625627685,"acs":28833,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66116,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6117976007937224,"acs":6783,"articleLive":2,"columnArticles":64,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11087,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115553338704933,"acs":79996,"articleLive":2,"columnArticles":643,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":156378,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4378329119123102,"acs":34112,"articleLive":2,"columnArticles":404,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":77911,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8122372121847738,"acs":170383,"articleLive":2,"columnArticles":1359,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":209770,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6050499019022435,"acs":14186,"articleLive":2,"columnArticles":132,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23446,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7090083132694317,"acs":78037,"articleLive":2,"columnArticles":938,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110065,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3560048241716389,"acs":11217,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31508,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5293342122610415,"acs":1606,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3034,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37373088291993317,"acs":11632,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31124,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4408753262397109,"acs":8784,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19924,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25138207155781706,"acs":25146,"articleLive":2,"columnArticles":298,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100031,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4347069065583285,"acs":1498,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3446,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470350185231132,"acs":63938,"articleLive":2,"columnArticles":336,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":116881,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.619161105815062,"acs":1299,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2098,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39963746223564955,"acs":6614,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16550,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42007894422072484,"acs":21072,"articleLive":2,"columnArticles":179,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50162,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6120633946169505,"acs":75771,"articleLive":2,"columnArticles":600,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":123796,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33458397023175385,"acs":21670,"articleLive":2,"columnArticles":240,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64767,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7013435204665411,"acs":38003,"articleLive":2,"columnArticles":486,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54186,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.603825941370704,"acs":38951,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64507,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43815348194910236,"acs":6663,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15207,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41832560676302155,"acs":3068,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7334,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44825915100483105,"acs":29599,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66031,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5410369236655825,"acs":5656,"articleLive":2,"columnArticles":96,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10454,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4722361765015129,"acs":40422,"articleLive":2,"columnArticles":430,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":85597,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.59066884672421,"acs":15534,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26299,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6357730619315721,"acs":1468,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2309,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6072713118711877,"acs":123253,"articleLive":2,"columnArticles":992,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":202962,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5864393088389352,"acs":46463,"articleLive":2,"columnArticles":402,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79229,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5783571077225774,"acs":5879,"articleLive":2,"columnArticles":114,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10165,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.387732628565136,"acs":3521,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9081,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7201773835920178,"acs":1624,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2255,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48325733827301226,"acs":6783,"articleLive":2,"columnArticles":81,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14036,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5466591905159688,"acs":47772,"articleLive":2,"columnArticles":405,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":87389,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5524609573208548,"acs":19598,"articleLive":2,"columnArticles":180,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35474,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3458875585632483,"acs":26578,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76840,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49329890689539385,"acs":151315,"articleLive":2,"columnArticles":1044,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":306741,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5429356581066995,"acs":28648,"articleLive":2,"columnArticles":437,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52765,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6872979767748114,"acs":103338,"articleLive":2,"columnArticles":1064,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":150354,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4048428785199293,"acs":2976,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7351,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4687229379376704,"acs":43842,"articleLive":2,"columnArticles":455,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":93535,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3716302046577276,"acs":2633,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7085,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7091315159329526,"acs":30799,"articleLive":2,"columnArticles":480,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43432,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5129428216283406,"acs":66026,"articleLive":2,"columnArticles":543,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":128720,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44128548182968724,"acs":29289,"articleLive":2,"columnArticles":356,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66372,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.635817927377182,"acs":103590,"articleLive":2,"columnArticles":981,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":162924,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5042884448873568,"acs":30868,"articleLive":2,"columnArticles":323,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61211,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4832490789135464,"acs":5640,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11671,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5638438938145134,"acs":21686,"articleLive":2,"columnArticles":291,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38461,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4130666218412058,"acs":29488,"articleLive":2,"columnArticles":232,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":71388,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6771048880305329,"acs":14725,"articleLive":2,"columnArticles":211,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21747,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6747041830018738,"acs":245929,"articleLive":2,"columnArticles":1490,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":364499,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6074870274277242,"acs":3278,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5396,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7325475974614687,"acs":19392,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26472,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.537844611528822,"acs":18241,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":33915,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7310731728154234,"acs":51344,"articleLive":2,"columnArticles":572,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":70231,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5007128309572302,"acs":19668,"articleLive":2,"columnArticles":240,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39280,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.644570120737694,"acs":38865,"articleLive":2,"columnArticles":426,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60296,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6539122180536093,"acs":86799,"articleLive":2,"columnArticles":622,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":132738,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5101823789014729,"acs":19190,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37614,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6572916603730266,"acs":108789,"articleLive":2,"columnArticles":685,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":165511,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39757805660927925,"acs":2725,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6854,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5639427386822052,"acs":40261,"articleLive":2,"columnArticles":645,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71392,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7132908206074845,"acs":25503,"articleLive":2,"columnArticles":253,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35754,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3617189977798922,"acs":6843,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18918,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27473389534212317,"acs":68992,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":251123,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49536148978435535,"acs":72566,"articleLive":2,"columnArticles":758,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":146491,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5359496456501934,"acs":45299,"articleLive":2,"columnArticles":517,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84521,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7351640576633943,"acs":33250,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45228,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5789626195305708,"acs":1998,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3451,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4769950218735858,"acs":31620,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66290,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6450178513469653,"acs":39746,"articleLive":2,"columnArticles":463,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61620,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6208202686029972,"acs":79000,"articleLive":2,"columnArticles":638,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":127251,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6591144932549291,"acs":3811,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5782,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37480708458881457,"acs":25500,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68035,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5253205128205128,"acs":1639,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3120,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6750526069675006,"acs":14436,"articleLive":2,"columnArticles":139,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21385,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8422004681847202,"acs":15830,"articleLive":2,"columnArticles":102,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18796,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5382599580712788,"acs":3081,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5724,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7125326529372457,"acs":11729,"articleLive":2,"columnArticles":173,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16461,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7009502051651851,"acs":109841,"articleLive":2,"columnArticles":840,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":156703,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5983162704120484,"acs":14143,"articleLive":2,"columnArticles":188,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23638,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5823516170180836,"acs":38805,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66635,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.607343717549325,"acs":73109,"articleLive":2,"columnArticles":803,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":120375,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4580315435889361,"acs":69815,"articleLive":2,"columnArticles":649,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":152424,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5524761255615899,"acs":150763,"articleLive":2,"columnArticles":1241,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":272886,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7108359133126935,"acs":2296,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3230,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.418488824101069,"acs":3445,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8232,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6282687575593277,"acs":15064,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23977,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.618723964042973,"acs":163676,"articleLive":2,"columnArticles":1144,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":264538,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3553846153846154,"acs":1617,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4550,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48124306326304106,"acs":2168,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4505,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43861883778573396,"acs":12741,"articleLive":2,"columnArticles":179,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29048,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5678171767561009,"acs":58961,"articleLive":2,"columnArticles":758,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103838,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.577702459075503,"acs":24033,"articleLive":2,"columnArticles":286,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41601,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.605335505549333,"acs":5945,"articleLive":2,"columnArticles":86,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9821,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5030136626666812,"acs":45984,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91417,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3429368029739777,"acs":1107,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3228,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32598903902904436,"acs":14692,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45069,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7455500064028685,"acs":163016,"articleLive":2,"columnArticles":1337,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":218652,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5043207742827515,"acs":2918,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5786,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7283152676644292,"acs":61413,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84322,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44661952574864383,"acs":151902,"articleLive":2,"columnArticles":933,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":340115,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7749096496725069,"acs":90270,"articleLive":2,"columnArticles":752,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116491,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4665309543767214,"acs":3896,"articleLive":2,"columnArticles":61,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8351,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6061472346786249,"acs":32441,"articleLive":2,"columnArticles":325,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53520,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17944075638704485,"acs":4460,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24855,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6108982545764154,"acs":14350,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23490,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6893210602809883,"acs":69720,"articleLive":2,"columnArticles":649,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":101143,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4318674461969047,"acs":119740,"articleLive":2,"columnArticles":1094,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":277261,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5076595744680851,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2350,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.564793152639087,"acs":9898,"articleLive":2,"columnArticles":156,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17525,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6610186844125928,"acs":12913,"articleLive":2,"columnArticles":113,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19535,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4878327267537287,"acs":6836,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14013,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47316593361761106,"acs":84665,"articleLive":2,"columnArticles":741,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":178933,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6640776699029126,"acs":1026,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1545,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6473348635552155,"acs":12691,"articleLive":2,"columnArticles":113,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19605,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6832683075638617,"acs":42556,"articleLive":2,"columnArticles":438,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62283,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.468670134672201,"acs":25857,"articleLive":2,"columnArticles":280,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55171,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7025648161031492,"acs":15148,"articleLive":2,"columnArticles":85,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21561,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49610972568578554,"acs":9947,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20050,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41058867086264345,"acs":7763,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18907,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5232431309406327,"acs":10074,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19253,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40513391037866564,"acs":99415,"articleLive":2,"columnArticles":861,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":245388,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40805833411236797,"acs":8730,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21394,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6189237383360203,"acs":50675,"articleLive":2,"columnArticles":492,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":81876,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744213417026284,"acs":13818,"articleLive":2,"columnArticles":61,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17843,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5958560214977724,"acs":8426,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14141,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7461864190602521,"acs":14626,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19601,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3845878777042732,"acs":2151,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5593,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42704420687662525,"acs":1478,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3461,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7451940027870586,"acs":88769,"articleLive":2,"columnArticles":567,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119122,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7611786773159073,"acs":62900,"articleLive":2,"columnArticles":464,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82635,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34219586840091815,"acs":1789,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5228,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5230948225712624,"acs":4496,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8595,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44178678916521463,"acs":8367,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18939,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5183368907548201,"acs":29384,"articleLive":2,"columnArticles":270,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56689,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7967997538272175,"acs":103576,"articleLive":2,"columnArticles":238,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":129990,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42115432175095835,"acs":81741,"articleLive":2,"columnArticles":286,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":194088,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4416347381864623,"acs":10374,"articleLive":2,"columnArticles":82,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23490,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5179642629227824,"acs":16233,"articleLive":2,"columnArticles":210,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31340,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5223209467966473,"acs":29040,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55598,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4814703900576477,"acs":19293,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40071,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5003080812070464,"acs":31667,"articleLive":2,"columnArticles":375,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63295,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6291682785299807,"acs":8132,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12925,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6711073666473593,"acs":12745,"articleLive":2,"columnArticles":112,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":18991,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37393031784841074,"acs":2447,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6544,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33374829550988605,"acs":109651,"articleLive":2,"columnArticles":1260,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":328544,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5693358014370733,"acs":28604,"articleLive":2,"columnArticles":314,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50241,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6600945087176144,"acs":12153,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18411,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.656045470203238,"acs":7618,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11612,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4858465904847263,"acs":6505,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13389,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6664136142215474,"acs":10534,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15807,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319560939160817,"acs":50547,"articleLive":2,"columnArticles":393,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95021,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6679655641141822,"acs":7371,"articleLive":2,"columnArticles":64,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11035,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8176342881154143,"acs":11675,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14279,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3453880190605854,"acs":8118,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23504,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4248402555910543,"acs":5319,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12520,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46064098959797584,"acs":3277,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7114,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7877448172225128,"acs":189763,"articleLive":2,"columnArticles":1251,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":240894,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6192189790750366,"acs":4646,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7503,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46573941501329513,"acs":11385,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24445,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7736308114996938,"acs":93484,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":120838,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5711008671639283,"acs":78174,"articleLive":2,"columnArticles":499,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":136883,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43704138930247777,"acs":65457,"articleLive":2,"columnArticles":424,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":149773,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5461656517649388,"acs":11032,"articleLive":2,"columnArticles":189,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20199,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41965828373968134,"acs":2186,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5209,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3428649237472767,"acs":2518,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7344,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6840258429842924,"acs":45420,"articleLive":2,"columnArticles":355,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66401,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8082739079102715,"acs":85576,"articleLive":2,"columnArticles":339,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":105875,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5248824694812965,"acs":80275,"articleLive":2,"columnArticles":761,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":152939,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4066117323916029,"acs":4145,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10194,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.368451452665627,"acs":6379,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17313,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28810853950518756,"acs":1083,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3759,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5978722056867836,"acs":18882,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31582,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39791876071660853,"acs":94220,"articleLive":2,"columnArticles":769,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":236782,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.440530058177117,"acs":1363,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3094,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5537201365187713,"acs":4056,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7325,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5517996518614184,"acs":9827,"articleLive":2,"columnArticles":112,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17809,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900624029262286,"acs":75085,"articleLive":2,"columnArticles":652,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":108809,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5923478081272268,"acs":11472,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19367,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37691630945472926,"acs":20136,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53423,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4248953893082007,"acs":10865,"articleLive":2,"columnArticles":212,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25571,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5328011107254426,"acs":21490,"articleLive":2,"columnArticles":241,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40334,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4891412631998406,"acs":2455,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5019,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45053859076983893,"acs":63826,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":141666,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4011220196353436,"acs":1144,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2852,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4339122866765051,"acs":68802,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":158562,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5776823368088795,"acs":22328,"articleLive":2,"columnArticles":200,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38651,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6567219947583913,"acs":124789,"articleLive":2,"columnArticles":918,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":190018,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5847628933566433,"acs":21407,"articleLive":2,"columnArticles":280,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36608,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48190658904472083,"acs":29138,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60464,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5670974727578502,"acs":49232,"articleLive":2,"columnArticles":653,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86814,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5842488008664707,"acs":3776,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6463,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5716335637413597,"acs":32666,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57145,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.598119926757883,"acs":41485,"articleLive":2,"columnArticles":393,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69359,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8108443150887973,"acs":60176,"articleLive":2,"columnArticles":608,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":74214,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5979290314433641,"acs":9470,"articleLive":2,"columnArticles":138,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15838,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3079446064139942,"acs":845,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2744,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7833063209076175,"acs":82161,"articleLive":2,"columnArticles":626,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":104890,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4550321017770324,"acs":26861,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59031,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419917218227249,"acs":28415,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52427,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6556914393226717,"acs":697,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1063,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5607505070993914,"acs":16587,"articleLive":2,"columnArticles":213,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29580,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4089718355729882,"acs":28882,"articleLive":2,"columnArticles":274,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":70621,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4641185647425897,"acs":1785,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3846,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6538564105603129,"acs":22067,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33749,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2707895743559761,"acs":75032,"articleLive":2,"columnArticles":940,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":277086,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.618006993006993,"acs":2121,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3432,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6243963234148622,"acs":8016,"articleLive":2,"columnArticles":120,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12838,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.508261387317654,"acs":6829,"articleLive":2,"columnArticles":67,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13436,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6657111557421946,"acs":36461,"articleLive":2,"columnArticles":308,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54770,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4515165876777251,"acs":19054,"articleLive":2,"columnArticles":285,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42200,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4861691686961579,"acs":53500,"articleLive":2,"columnArticles":669,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110044,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5485603461136804,"acs":3677,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6703,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4350838970716123,"acs":47529,"articleLive":2,"columnArticles":417,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":109241,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4966610750804013,"acs":92968,"articleLive":2,"columnArticles":767,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":187186,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4012413793103448,"acs":2909,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7250,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5876660652780056,"acs":7166,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12194,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6174867899603699,"acs":14958,"articleLive":2,"columnArticles":252,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24224,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3856623275488261,"acs":43581,"articleLive":2,"columnArticles":479,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113003,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5414295541241949,"acs":25974,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47973,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4016335095958289,"acs":86891,"articleLive":2,"columnArticles":824,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":216344,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5032958511050795,"acs":2596,"articleLive":2,"columnArticles":63,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5158,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6951127479095601,"acs":46054,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66254,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4341539663931223,"acs":2222,"articleLive":2,"columnArticles":51,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5118,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658984643339907,"acs":60100,"articleLive":2,"columnArticles":606,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90254,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43114673083947486,"acs":20066,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46541,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35598032962284726,"acs":17301,"articleLive":2,"columnArticles":195,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48601,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44134966638625445,"acs":38299,"articleLive":2,"columnArticles":273,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86777,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108274591985775,"acs":8044,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15747,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.486986098787341,"acs":3293,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6762,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6476731276310311,"acs":56003,"articleLive":2,"columnArticles":566,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86468,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.491430138488962,"acs":3584,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7293,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5778237323185667,"acs":68178,"articleLive":2,"columnArticles":737,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":117991,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6097692020183143,"acs":26103,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42808,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5349540078843626,"acs":4071,"articleLive":2,"columnArticles":78,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7610,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6649204530991473,"acs":130607,"articleLive":2,"columnArticles":1295,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":196425,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6318410967515746,"acs":52264,"articleLive":2,"columnArticles":475,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82717,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6049439833083866,"acs":66686,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110235,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44679391589621237,"acs":29962,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67060,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47776628748707345,"acs":2772,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5802,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7604287743768565,"acs":82432,"articleLive":2,"columnArticles":520,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":108402,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7232697857041487,"acs":76446,"articleLive":2,"columnArticles":565,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":105695,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7402464065708418,"acs":4326,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5844,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5128597152855638,"acs":60380,"articleLive":2,"columnArticles":551,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117732,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.555992014327013,"acs":292141,"articleLive":2,"columnArticles":1447,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":525441,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6452510215435379,"acs":67270,"articleLive":2,"columnArticles":434,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":104254,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6443146753376024,"acs":58257,"articleLive":2,"columnArticles":391,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":90417,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3215794849200945,"acs":64231,"articleLive":2,"columnArticles":441,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":199736,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3390925480769231,"acs":2257,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6656,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7587494117143713,"acs":70937,"articleLive":2,"columnArticles":510,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93492,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.35237838566230967,"acs":5230,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14842,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5600624024960998,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1282,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6719150818222026,"acs":15192,"articleLive":2,"columnArticles":170,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22610,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41411021533521797,"acs":23731,"articleLive":2,"columnArticles":220,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":57306,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7218012712320896,"acs":100500,"articleLive":2,"columnArticles":672,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":139235,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40981330041660236,"acs":2656,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6481,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4606651376146789,"acs":4017,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8720,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115726907111592,"acs":31673,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61913,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.564502821249867,"acs":84838,"articleLive":2,"columnArticles":589,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":150288,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3699455595727881,"acs":8902,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24063,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4850986001360002,"acs":20688,"articleLive":2,"columnArticles":274,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42647,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4692256569029518,"acs":28947,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61691,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3220230473751601,"acs":5030,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15620,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7203947368421053,"acs":1314,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1824,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46259114003329105,"acs":138120,"articleLive":2,"columnArticles":864,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":298579,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6086013462976814,"acs":48822,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80220,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524943023550266,"acs":21818,"articleLive":2,"columnArticles":397,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39490,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4094035087719298,"acs":2917,"articleLive":2,"columnArticles":49,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7125,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7601047401638243,"acs":33963,"articleLive":2,"columnArticles":310,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44682,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5134345067794501,"acs":8255,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16078,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4903990024937656,"acs":3933,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8020,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.505524861878453,"acs":4026,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7964,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6103429700125695,"acs":3399,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5569,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804143882881152,"acs":66447,"articleLive":2,"columnArticles":570,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":114482,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4808730344989439,"acs":2049,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4261,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40650500831496306,"acs":21022,"articleLive":2,"columnArticles":263,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51714,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4632768361581921,"acs":1558,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3363,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4611801242236025,"acs":3861,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8372,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017781931615425,"acs":41340,"articleLive":2,"columnArticles":589,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82387,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6799952788960273,"acs":213169,"articleLive":2,"columnArticles":1521,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":313486,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6296986946707234,"acs":51328,"articleLive":2,"columnArticles":595,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":81512,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3670594733934819,"acs":3987,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10862,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49498868412544456,"acs":1531,"articleLive":2,"columnArticles":44,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3093,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5202892363035164,"acs":57275,"articleLive":2,"columnArticles":525,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":110083,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4589319175515303,"acs":41146,"articleLive":2,"columnArticles":365,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89656,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3926572949365361,"acs":2877,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7327,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5880027940838312,"acs":135527,"articleLive":2,"columnArticles":1300,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":230487,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41661474748955507,"acs":45471,"articleLive":2,"columnArticles":404,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109144,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6021825873756069,"acs":12526,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20801,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5055637982195845,"acs":1363,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2696,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.721820809248555,"acs":1998,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2768,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027046520014424,"acs":1394,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2773,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5303694474621854,"acs":69812,"articleLive":2,"columnArticles":591,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":131629,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5913426265590609,"acs":3224,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5452,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4308196369105167,"acs":8021,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18618,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49884881043745205,"acs":1300,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2606,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5654739948358539,"acs":4599,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8133,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41997593261131166,"acs":2443,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5817,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.46184262554369315,"acs":3504,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7587,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6606765327695561,"acs":1875,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2838,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8395744680851064,"acs":3946,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4700,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5904869124683366,"acs":2098,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3553,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7001216783765749,"acs":17837,"articleLive":2,"columnArticles":142,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25477,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631441714934908,"acs":81951,"articleLive":2,"columnArticles":987,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":107386,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4934451399551199,"acs":4178,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8467,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6651378240233662,"acs":29149,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43824,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080526973252115,"acs":54981,"articleLive":2,"columnArticles":635,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77651,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47792933089893674,"acs":40050,"articleLive":2,"columnArticles":497,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83799,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5057940729483282,"acs":5325,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10528,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5873626889493945,"acs":12512,"articleLive":2,"columnArticles":149,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21302,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5548837209302325,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2150,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513182113920601,"acs":153090,"articleLive":2,"columnArticles":1115,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":179827,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49308718932310397,"acs":6170,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12513,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.713163845260649,"acs":23339,"articleLive":2,"columnArticles":333,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32726,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5896351136964569,"acs":1115,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1891,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4600798403193613,"acs":5071,"articleLive":2,"columnArticles":80,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11022,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5690095846645368,"acs":1781,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3130,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3235600880750956,"acs":5584,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17258,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5941469080625205,"acs":23530,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39603,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4364377504490811,"acs":18951,"articleLive":2,"columnArticles":235,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43422,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2872573987880917,"acs":3271,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11387,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6172070003280512,"acs":43273,"articleLive":2,"columnArticles":661,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70111,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42783945345858243,"acs":1503,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3513,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5959112508974053,"acs":69724,"articleLive":2,"columnArticles":670,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117004,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6869336405816959,"acs":44119,"articleLive":2,"columnArticles":486,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64226,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5122028405782425,"acs":40463,"articleLive":2,"columnArticles":405,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":78998,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4721388054721388,"acs":4245,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8991,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3910823784023751,"acs":42285,"articleLive":2,"columnArticles":399,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108123,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.608110332115467,"acs":18475,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30381,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6922287681207387,"acs":20915,"articleLive":2,"columnArticles":295,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30214,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4501503585473051,"acs":3892,"articleLive":2,"columnArticles":66,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8646,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948305291392344,"acs":11398,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16404,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46417429550452616,"acs":9076,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19553,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39310774988305003,"acs":5042,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12826,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3409903011740684,"acs":7348,"articleLive":2,"columnArticles":104,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21549,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5331031276977223,"acs":8028,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15059,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5303414677951642,"acs":23623,"articleLive":2,"columnArticles":281,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44543,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7930725644306342,"acs":43389,"articleLive":2,"columnArticles":537,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":54710,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46408286000668225,"acs":1389,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2993,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4087585623027784,"acs":5311,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12993,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7059401080019637,"acs":1438,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2037,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.419748093367229,"acs":7265,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17308,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5766948290843209,"acs":31194,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54091,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4820663916715773,"acs":12271,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25455,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7714280173751163,"acs":39781,"articleLive":2,"columnArticles":400,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51568,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29071170084439085,"acs":2651,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9119,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6569254037176172,"acs":13465,"articleLive":2,"columnArticles":151,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20497,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8453771227497577,"acs":16577,"articleLive":2,"columnArticles":218,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19609,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4810403234619167,"acs":4402,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9151,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4190044474854601,"acs":4899,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11692,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7337220602526725,"acs":16610,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22638,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.705,"acs":15651,"articleLive":2,"columnArticles":199,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22200,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6304992154355785,"acs":10849,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17207,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5501263024944743,"acs":6969,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12668,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6996306809510728,"acs":22922,"articleLive":2,"columnArticles":355,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32763,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4335870923758664,"acs":26712,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61607,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5103151862464184,"acs":3562,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6980,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914039613484325,"acs":13526,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22871,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43326220957799905,"acs":3655,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8436,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4214066102997694,"acs":21930,"articleLive":2,"columnArticles":249,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52040,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5075104426965671,"acs":55039,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108449,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6927734159018025,"acs":25059,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36172,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5023646873357857,"acs":2868,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5709,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42842550707719246,"acs":2936,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6853,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6153733635632268,"acs":16828,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27346,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39147676827463745,"acs":6614,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16895,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3741199320223355,"acs":7705,"articleLive":2,"columnArticles":112,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20595,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39071250107693634,"acs":9070,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23214,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49264705882352944,"acs":3216,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6528,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36602900988017656,"acs":8706,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23785,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.54331869510665,"acs":51963,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95640,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40545808966861596,"acs":7488,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18468,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7957647801193359,"acs":85754,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107763,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4301596589484243,"acs":5146,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11963,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5283725698962893,"acs":13399,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25359,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5742124933262146,"acs":4302,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7492,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47934314634425124,"acs":37743,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78739,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39595464296659516,"acs":19380,"articleLive":2,"columnArticles":244,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48945,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.49982526036206054,"acs":7151,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14307,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5746443363947416,"acs":19146,"articleLive":2,"columnArticles":269,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33318,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35962812225680313,"acs":9013,"articleLive":2,"columnArticles":113,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25062,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6578012925218379,"acs":55575,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84486,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4881800350985857,"acs":28374,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58122,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3798502382573179,"acs":2790,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7345,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5127512340823329,"acs":89954,"articleLive":2,"columnArticles":987,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":175434,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42119610756700593,"acs":37700,"articleLive":2,"columnArticles":556,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89507,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5115895987763266,"acs":8696,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16998,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6812390797903319,"acs":18715,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27472,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4495217326659067,"acs":9070,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20177,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42686575137560767,"acs":15981,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37438,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4491603616903488,"acs":2434,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5419,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.48141118678128836,"acs":4312,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8957,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7144428648795018,"acs":84430,"articleLive":2,"columnArticles":730,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":118176,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38405797101449274,"acs":10229,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26634,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.359881031064111,"acs":4356,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12104,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.408734220402593,"acs":4792,"articleLive":2,"columnArticles":57,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11724,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6269149548857746,"acs":16328,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26045,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46661514683153016,"acs":3019,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6470,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5553633217993079,"acs":2889,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5202,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30210957689521317,"acs":27940,"articleLive":2,"columnArticles":364,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92483,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5869943836715524,"acs":89988,"articleLive":2,"columnArticles":775,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":153303,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085128257852259,"acs":31456,"articleLive":2,"columnArticles":439,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38906,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19229540965380204,"acs":16258,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84547,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6045730348633918,"acs":35272,"articleLive":2,"columnArticles":563,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58342,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45617200420989323,"acs":3034,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6651,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6578334304018637,"acs":9036,"articleLive":2,"columnArticles":130,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13736,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2246120663830807,"acs":7498,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33382,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702354775516731,"acs":83823,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125065,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6242984231224467,"acs":16351,"articleLive":2,"columnArticles":236,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26191,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5511285909712722,"acs":6446,"articleLive":2,"columnArticles":96,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11696,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4294048337500359,"acs":14942,"articleLive":2,"columnArticles":191,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34797,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34207681775599913,"acs":9494,"articleLive":2,"columnArticles":126,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27754,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521856245488142,"acs":60530,"articleLive":2,"columnArticles":722,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92811,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5111327534674414,"acs":15220,"articleLive":2,"columnArticles":112,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29777,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41493265585934347,"acs":20579,"articleLive":2,"columnArticles":228,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49596,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47957019197805967,"acs":44765,"articleLive":2,"columnArticles":354,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":93344,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7060949982874017,"acs":152549,"articleLive":2,"columnArticles":1650,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":216046,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7572645207137385,"acs":68200,"articleLive":2,"columnArticles":484,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90061,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2813617782319877,"acs":4405,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15656,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5543122341111254,"acs":21499,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38785,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528104133209365,"acs":5982,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23662,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5377067179029712,"acs":47016,"articleLive":2,"columnArticles":573,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87438,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48541041723479683,"acs":1780,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3667,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6889803673210892,"acs":10879,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15790,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6620411209879894,"acs":19513,"articleLive":2,"columnArticles":253,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29474,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6916778323656394,"acs":4646,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6717,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4266771824320994,"acs":8656,"articleLive":2,"columnArticles":115,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20287,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29146450115482614,"acs":51361,"articleLive":2,"columnArticles":337,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":176217,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6404969849423436,"acs":54489,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85073,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6759036671183181,"acs":15464,"articleLive":2,"columnArticles":148,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22879,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7265097910153036,"acs":8830,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12154,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33047409296395036,"acs":2851,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8627,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385629936354574,"acs":33310,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52164,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7248905355338497,"acs":10761,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14845,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7745276911305986,"acs":13160,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16991,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5454684512428298,"acs":7132,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13075,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867301749758892,"acs":59620,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101614,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7441874379255465,"acs":62191,"articleLive":2,"columnArticles":710,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83569,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33817726276229254,"acs":5399,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15965,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.536913611894386,"acs":4189,"articleLive":2,"columnArticles":46,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7802,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.492988606485539,"acs":3375,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6846,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5457108336689489,"acs":18970,"articleLive":2,"columnArticles":233,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34762,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32958024691358023,"acs":3337,"articleLive":2,"columnArticles":77,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10125,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5309222423146474,"acs":2936,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5530,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45355058365758755,"acs":20515,"articleLive":2,"columnArticles":280,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":45232,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7005760701889703,"acs":58131,"articleLive":2,"columnArticles":605,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":82976,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27765151515151515,"acs":2199,"articleLive":2,"columnArticles":39,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7920,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3174527907171348,"acs":11381,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35851,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6987168749371838,"acs":20856,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29849,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45948776001132025,"acs":16236,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35335,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3189261873889449,"acs":6641,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20823,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4258698940998487,"acs":4504,"articleLive":2,"columnArticles":68,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10576,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.560507880910683,"acs":230436,"articleLive":2,"columnArticles":1059,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":411120,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40331139885374656,"acs":1900,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4711,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888395547239225,"acs":49042,"articleLive":2,"columnArticles":618,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126124,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46969621389734123,"acs":9416,"articleLive":2,"columnArticles":115,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20047,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44185564159292035,"acs":6391,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14464,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5701669442615331,"acs":29440,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51634,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3575697381714814,"acs":20881,"articleLive":2,"columnArticles":224,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":58397,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6326386435888378,"acs":5373,"articleLive":2,"columnArticles":101,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8493,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48391281785158274,"acs":1865,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3854,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7376606052095767,"acs":21013,"articleLive":2,"columnArticles":310,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28486,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140023170557521,"acs":89980,"articleLive":2,"columnArticles":826,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126022,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33890330953926023,"acs":6267,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18492,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35891712454212454,"acs":6271,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17472,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3874400295239267,"acs":50392,"articleLive":2,"columnArticles":677,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130064,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5233292269787496,"acs":6797,"articleLive":2,"columnArticles":123,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":12988,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3390996658148221,"acs":3450,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10174,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4196360879454132,"acs":2214,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5276,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6440474102287819,"acs":25702,"articleLive":2,"columnArticles":232,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39907,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5448753105139207,"acs":33779,"articleLive":2,"columnArticles":342,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":61994,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6647389660322202,"acs":20920,"articleLive":2,"columnArticles":270,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31471,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6323485967503693,"acs":8562,"articleLive":2,"columnArticles":82,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13540,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.725117818108894,"acs":36158,"articleLive":2,"columnArticles":310,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49865,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47412891285105013,"acs":23568,"articleLive":2,"columnArticles":264,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49708,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4750737692188228,"acs":6118,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12878,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37848315968015506,"acs":1562,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4127,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5877369116998874,"acs":12001,"articleLive":2,"columnArticles":127,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20419,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8187504214714411,"acs":97130,"articleLive":2,"columnArticles":801,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118632,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45361943725473824,"acs":5433,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11977,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42126978780734253,"acs":5003,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11876,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39250233827953185,"acs":62108,"articleLive":2,"columnArticles":615,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158236,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7302007358161751,"acs":22626,"articleLive":2,"columnArticles":213,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30986,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4700530705079606,"acs":1860,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3957,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.689533261976582,"acs":21259,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30831,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4861318672278816,"acs":35457,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72937,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.624461552561635,"acs":27254,"articleLive":2,"columnArticles":300,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43644,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6126830186902689,"acs":26028,"articleLive":2,"columnArticles":336,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42482,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39189578650066287,"acs":6799,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17349,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.370521100592763,"acs":8376,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22606,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7744734558649523,"acs":9818,"articleLive":2,"columnArticles":146,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12677,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6641394543609337,"acs":11125,"articleLive":2,"columnArticles":168,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16751,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.35219981668194317,"acs":3074,"articleLive":2,"columnArticles":59,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8728,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5529188419553868,"acs":13980,"articleLive":2,"columnArticles":169,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25284,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3005580880160184,"acs":7055,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23473,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3299284984678243,"acs":3230,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9790,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43775753632617653,"acs":4037,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9222,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3608307700129649,"acs":14194,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39337,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5362121800681946,"acs":24847,"articleLive":2,"columnArticles":230,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46338,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.743373220236292,"acs":19631,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26408,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5563616071428571,"acs":1994,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3584,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768294930875576,"acs":36718,"articleLive":2,"columnArticles":303,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54250,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4426315962951976,"acs":13429,"articleLive":2,"columnArticles":131,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30339,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5029844807003582,"acs":2528,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5026,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43169722057953874,"acs":1460,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3382,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6835362079636889,"acs":33131,"articleLive":2,"columnArticles":393,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48470,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.403596272476703,"acs":3075,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7619,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46377772420443586,"acs":7695,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16592,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4989644734745898,"acs":25056,"articleLive":2,"columnArticles":328,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50216,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6512457026442001,"acs":15344,"articleLive":2,"columnArticles":196,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23561,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4140841899902454,"acs":11037,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26654,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4402527890630038,"acs":6827,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15507,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4105263157894737,"acs":1287,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3135,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.641143701682583,"acs":67674,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105552,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4662608760595989,"acs":37458,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80337,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44752333094041635,"acs":3117,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6965,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5974414927965441,"acs":53661,"articleLive":2,"columnArticles":501,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89818,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7103830525048586,"acs":172898,"articleLive":2,"columnArticles":1350,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":243387,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735021023125438,"acs":43244,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91328,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.712334541775567,"acs":8449,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11861,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7345881628885014,"acs":14323,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19498,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5322898724381537,"acs":21323,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40059,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5448320136956987,"acs":2546,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4673,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6342927535098354,"acs":32439,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51142,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41714680802028115,"acs":9050,"articleLive":2,"columnArticles":144,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21695,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6005018635373999,"acs":16273,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27099,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.67805096582075,"acs":25730,"articleLive":2,"columnArticles":249,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":37947,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5329608424731553,"acs":23179,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43491,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4981893705399936,"acs":9355,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18778,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47122711196669204,"acs":52629,"articleLive":2,"columnArticles":595,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111685,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5028291097333414,"acs":33414,"articleLive":2,"columnArticles":502,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66452,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5200142534742843,"acs":8756,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16838,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.452885443583118,"acs":23661,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52245,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570577627192743,"acs":50968,"articleLive":2,"columnArticles":805,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91495,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5093110901734744,"acs":55137,"articleLive":2,"columnArticles":1407,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":108258,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5399376288919069,"acs":21469,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39762,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49546862452678675,"acs":4319,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8717,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5104912642461058,"acs":36640,"articleLive":2,"columnArticles":396,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":71774,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6147916164779571,"acs":7656,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12453,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906261326567597,"acs":30487,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44144,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4094315692378646,"acs":3551,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8673,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29212238681988095,"acs":2110,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7223,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7354866139297586,"acs":57087,"articleLive":2,"columnArticles":600,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77618,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5768284605922982,"acs":12193,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21138,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5970116302687237,"acs":67605,"articleLive":2,"columnArticles":715,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113239,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5313911472448057,"acs":25883,"articleLive":2,"columnArticles":420,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":48708,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6274195833923764,"acs":44277,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70570,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4652926021347074,"acs":6321,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13585,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7225792988313856,"acs":17313,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23960,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928516228748067,"acs":15343,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25880,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45227484205886676,"acs":18470,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40838,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6267604173148321,"acs":60436,"articleLive":2,"columnArticles":579,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96426,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3343474953819407,"acs":3077,"articleLive":2,"columnArticles":65,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9203,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3969881502377554,"acs":47003,"articleLive":2,"columnArticles":920,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118399,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5506919719765706,"acs":38359,"articleLive":2,"columnArticles":452,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":69656,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35526027597284077,"acs":4866,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13697,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.584045904590459,"acs":5191,"articleLive":2,"columnArticles":80,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8888,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5611921369689283,"acs":3540,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6308,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.516171795262843,"acs":43999,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85241,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5978875114648362,"acs":20208,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33799,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5370743792129976,"acs":9322,"articleLive":2,"columnArticles":138,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17357,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7831660336408031,"acs":57735,"articleLive":2,"columnArticles":655,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73720,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7049279487635652,"acs":19812,"articleLive":2,"columnArticles":266,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28105,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5647124333784106,"acs":7099,"articleLive":2,"columnArticles":156,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12571,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5572936644263963,"acs":33417,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59963,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096164159304524,"acs":75423,"articleLive":2,"columnArticles":649,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106287,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6708681585332974,"acs":9953,"articleLive":2,"columnArticles":169,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14836,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4345294560204115,"acs":13284,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30571,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319130528820158,"acs":20304,"articleLive":2,"columnArticles":424,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27741,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6557971014492754,"acs":16833,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25668,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105595509559727,"acs":40509,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57010,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5673335673335673,"acs":4849,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8547,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3980521520578071,"acs":2534,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6366,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3908414343196952,"acs":10976,"articleLive":2,"columnArticles":167,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28083,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43231483272094373,"acs":4471,"articleLive":2,"columnArticles":98,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10342,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6332478723783072,"acs":35567,"articleLive":2,"columnArticles":387,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56166,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.30001843997787203,"acs":3254,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10846,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43837362837499433,"acs":9628,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21963,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7934881388862774,"acs":25321,"articleLive":2,"columnArticles":318,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31911,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5552689756816507,"acs":4521,"articleLive":2,"columnArticles":60,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8142,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5211739216072484,"acs":2646,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5077,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48269096005606166,"acs":6888,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14270,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5299307159353349,"acs":11473,"articleLive":2,"columnArticles":152,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21650,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6913746630727763,"acs":7695,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11130,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.2088422438382213,"acs":5711,"articleLive":2,"columnArticles":72,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27346,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6398333964407421,"acs":8449,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13205,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599438371276702,"acs":65803,"articleLive":2,"columnArticles":913,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99710,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.724849197773188,"acs":105986,"articleLive":2,"columnArticles":983,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":146218,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4554312354312354,"acs":9769,"articleLive":2,"columnArticles":134,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21450,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.64496996996997,"acs":42955,"articleLive":2,"columnArticles":403,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":66600,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7576323156912411,"acs":11366,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15002,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.753599690245142,"acs":31141,"articleLive":2,"columnArticles":371,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41323,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5812850783820399,"acs":48056,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82672,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.459102494786437,"acs":5944,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12947,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37633388664927675,"acs":7935,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21085,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5875613747954174,"acs":4667,"articleLive":2,"columnArticles":86,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7943,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.40976851290752636,"acs":3381,"articleLive":2,"columnArticles":65,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8251,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46549618320610686,"acs":3049,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6550,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3418759610456176,"acs":1334,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3902,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36304104775594953,"acs":2273,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6261,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5312730854469343,"acs":4315,"articleLive":2,"columnArticles":63,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8122,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6055724858511101,"acs":2782,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4594,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5427811669012983,"acs":3470,"articleLive":2,"columnArticles":47,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6393,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7053195560658247,"acs":1843,"articleLive":2,"columnArticles":39,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2613,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6506532389765922,"acs":4781,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7348,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5421392039137203,"acs":2438,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4497,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47398843930635837,"acs":2050,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4325,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4225855901890649,"acs":827,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1957,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.864388961892247,"acs":13156,"articleLive":2,"columnArticles":63,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15220,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8191528545119705,"acs":11120,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13575,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4807964112333313,"acs":7824,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16273,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865817726148949,"acs":34640,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59054,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5805040252012601,"acs":3317,"articleLive":2,"columnArticles":54,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5714,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33542014468558706,"acs":2411,"articleLive":2,"columnArticles":53,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7188,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6692263112141408,"acs":18476,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27608,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6936201239518776,"acs":9513,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13715,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4964325583652866,"acs":10228,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20603,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7206446661550269,"acs":7512,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10424,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6224327757781072,"acs":11759,"articleLive":2,"columnArticles":182,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18892,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7345362497566041,"acs":11317,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15407,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4904103219807044,"acs":4219,"articleLive":2,"columnArticles":90,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8603,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5707534379236878,"acs":14734,"articleLive":2,"columnArticles":145,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25815,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7603833865814696,"acs":11424,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15024,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.527701039730775,"acs":10506,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19909,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5365317131933169,"acs":10244,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19093,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7731936725096195,"acs":3617,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4678,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6893547508848353,"acs":5064,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7346,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.533801580333626,"acs":1824,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3417,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45055889939810834,"acs":1048,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2326,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.585351840091929,"acs":19357,"articleLive":2,"columnArticles":288,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33069,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5449243160672129,"acs":3924,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7201,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3786987030128352,"acs":28118,"articleLive":2,"columnArticles":285,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":74249,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48994787788533134,"acs":2632,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5372,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37939905330314877,"acs":3687,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9718,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6088168631006347,"acs":26861,"articleLive":2,"columnArticles":377,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44120,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3728023643528342,"acs":19678,"articleLive":2,"columnArticles":385,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52784,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5480078380143697,"acs":1678,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3062,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.519334229993275,"acs":6178,"articleLive":2,"columnArticles":110,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11896,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4716309762567122,"acs":7290,"articleLive":2,"columnArticles":102,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15457,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5808383233532934,"acs":4850,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8350,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6995760973608642,"acs":5116,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7313,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6666666666666666,"acs":2398,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3597,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37082045518404044,"acs":5279,"articleLive":2,"columnArticles":66,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14236,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6368065631325345,"acs":35551,"articleLive":2,"columnArticles":1103,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55827,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.761172998697259,"acs":28630,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37613,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5590909090909091,"acs":5166,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9240,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5765556768558951,"acs":4225,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7328,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41000496524329694,"acs":6606,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16112,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.839620397380842,"acs":67063,"articleLive":2,"columnArticles":682,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79873,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5770501178256968,"acs":58525,"articleLive":2,"columnArticles":584,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101421,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.629984856133266,"acs":11232,"articleLive":2,"columnArticles":202,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17829,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712132341200141,"acs":24149,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31313,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6450378433540267,"acs":7585,"articleLive":2,"columnArticles":86,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11759,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5405596604307499,"acs":6877,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12722,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653595046899251,"acs":77485,"articleLive":2,"columnArticles":580,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118552,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619447122274042,"acs":43136,"articleLive":2,"columnArticles":479,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76762,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5198827194429173,"acs":22696,"articleLive":2,"columnArticles":369,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43656,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5212797887028033,"acs":17368,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33318,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6428767499313752,"acs":2342,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3643,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8666458463460337,"acs":8325,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9606,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6095194085027726,"acs":2638,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4328,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5756940806705081,"acs":1099,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1909,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070786077434493,"acs":65088,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92052,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7023271969433831,"acs":8088,"articleLive":2,"columnArticles":103,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11516,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.318152390438247,"acs":12777,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40160,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49093851132686084,"acs":3034,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6180,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6934581573238954,"acs":6074,"articleLive":2,"columnArticles":92,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8759,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.413510101010101,"acs":3930,"articleLive":2,"columnArticles":73,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9504,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448408447190385,"acs":37126,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68141,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37997919598604907,"acs":6210,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16343,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.628812113457027,"acs":5897,"articleLive":2,"columnArticles":102,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9378,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4550170446124203,"acs":3070,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6747,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3898277004638834,"acs":4706,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12072,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6469026548672566,"acs":2924,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4520,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7763061074319353,"acs":3165,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4077,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.535756853396901,"acs":6293,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11746,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5708418891170431,"acs":2780,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4870,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.608164594755985,"acs":78421,"articleLive":2,"columnArticles":867,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":128947,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4329315570592796,"acs":6142,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14187,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47794005394127526,"acs":9392,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19651,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6521403779406093,"acs":6764,"articleLive":2,"columnArticles":95,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10372,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5100715746421268,"acs":9977,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19560,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3703187037235755,"acs":6902,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18638,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6368961472250575,"acs":167226,"articleLive":2,"columnArticles":1134,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":262564,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4418006430868167,"acs":10305,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23325,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46902717661250265,"acs":6610,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14093,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28704395679054284,"acs":4225,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14719,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5609621993127147,"acs":4081,"articleLive":2,"columnArticles":82,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7275,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7149304596113106,"acs":7762,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10857,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4424247477695322,"acs":5306,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":11993,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6050213536948363,"acs":4675,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7727,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48621728051887886,"acs":4198,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8634,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38572234762979685,"acs":1367,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3544,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.371111594518164,"acs":1706,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4597,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5694928684627575,"acs":14374,"articleLive":2,"columnArticles":223,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25240,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.478096081905887,"acs":9713,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20316,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43193876663477426,"acs":4966,"articleLive":2,"columnArticles":82,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11497,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32010443864229765,"acs":3065,"articleLive":2,"columnArticles":46,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9575,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5509235893812456,"acs":5458,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9907,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48857622305408543,"acs":3785,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7747,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6869642568332525,"acs":59465,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86562,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6335280303486481,"acs":10521,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16607,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4692618435549027,"acs":38334,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81690,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2673997646845868,"acs":5909,"articleLive":2,"columnArticles":101,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22098,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6091065292096219,"acs":5672,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9312,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8370476610767873,"acs":7587,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9064,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4838593974175036,"acs":2698,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5576,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.434198245286541,"acs":2326,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5357,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.570404872805446,"acs":1592,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2791,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224308016473518,"acs":6733,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20882,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166524068987256,"acs":13694,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22207,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47465826217612783,"acs":12952,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27287,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2678050362044742,"acs":2478,"articleLive":2,"columnArticles":54,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9253,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7579294117647059,"acs":8053,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10625,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6184897491404558,"acs":4857,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7853,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49101836844948676,"acs":7271,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14808,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45027105921601335,"acs":4319,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9592,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2653950718508609,"acs":6150,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23173,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46189043344192177,"acs":18574,"articleLive":2,"columnArticles":183,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40213,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6365662625505145,"acs":30559,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48006,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7761527020327219,"acs":3131,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4034,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3724756918474196,"acs":1494,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4011,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.398073520739139,"acs":2025,"articleLive":2,"columnArticles":41,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5087,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5990740740740741,"acs":647,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1080,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5854908660796425,"acs":13365,"articleLive":2,"columnArticles":260,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22827,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6081782778018174,"acs":11244,"articleLive":2,"columnArticles":204,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18488,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39405439595192915,"acs":7476,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18972,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4415954415954416,"acs":1860,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4212,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6938428874734607,"acs":3268,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4710,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.645514898872935,"acs":20905,"articleLive":2,"columnArticles":326,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32385,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6510220296135789,"acs":45067,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69225,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26725521669341895,"acs":5994,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22428,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4976043005726306,"acs":4258,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8557,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6047707626654996,"acs":5527,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9139,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5074454243169004,"acs":3510,"articleLive":2,"columnArticles":63,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6917,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6365971107544142,"acs":13881,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21805,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6932958651144119,"acs":3454,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4982,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.37004506224700223,"acs":4845,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13093,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7464924082260235,"acs":3884,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5203,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43857566765578637,"acs":739,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1685,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.686033562459199,"acs":17865,"articleLive":2,"columnArticles":251,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26041,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24697386237741578,"acs":6019,"articleLive":2,"columnArticles":85,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24371,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5034290211362614,"acs":26867,"articleLive":2,"columnArticles":294,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53368,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6217823812942262,"acs":12126,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19502,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7266252266252267,"acs":5611,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7722,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46776298616549206,"acs":5376,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11493,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6132356929753187,"acs":6783,"articleLive":2,"columnArticles":88,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11061,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304334040633156,"acs":59897,"articleLive":2,"columnArticles":830,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82002,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49685692997093056,"acs":47345,"articleLive":2,"columnArticles":613,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95289,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5289725339504825,"acs":12114,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22901,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44900371496116176,"acs":2659,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5922,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6551477810518797,"acs":7337,"articleLive":2,"columnArticles":61,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11199,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5105123494590733,"acs":5002,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9798,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7746423415146345,"acs":5902,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7619,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6351478621209268,"acs":3372,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5309,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4121110176619008,"acs":1960,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4756,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.54006586169045,"acs":1476,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2733,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6941520653798454,"acs":21829,"articleLive":2,"columnArticles":354,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31447,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42256670902160104,"acs":8314,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19675,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6305699211199917,"acs":12071,"articleLive":2,"columnArticles":171,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19143,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5266793066088841,"acs":3889,"articleLive":2,"columnArticles":73,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7384,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439002867857931,"acs":76508,"articleLive":2,"columnArticles":1109,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90660,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6722043996333639,"acs":5867,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8728,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47502805836139167,"acs":3386,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7128,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32719694338311917,"acs":4710,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14395,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5389086212463674,"acs":3338,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6194,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5974084904709085,"acs":11849,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19834,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6627476882430647,"acs":10034,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15140,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5397935980409305,"acs":3086,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5717,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41807519834425666,"acs":2424,"articleLive":2,"columnArticles":44,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5798,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4940181847184559,"acs":3097,"articleLive":2,"columnArticles":62,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6269,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5629781675685762,"acs":3017,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5359,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4695997555759242,"acs":33814,"articleLive":2,"columnArticles":421,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72006,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.481899360444069,"acs":7987,"articleLive":2,"columnArticles":115,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16574,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34355506325424123,"acs":5893,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17153,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.463157128294743,"acs":6361,"articleLive":2,"columnArticles":110,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13734,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5627376425855514,"acs":1184,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2104,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7106957860842783,"acs":10153,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14286,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6596194503171248,"acs":3120,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4730,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4910999350153985,"acs":34763,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70786,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49425063340479436,"acs":2536,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5131,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5952336273221993,"acs":6344,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10658,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47105864432597105,"acs":1237,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2626,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5406139068699102,"acs":2589,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4789,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6205583756345178,"acs":2445,"articleLive":2,"columnArticles":41,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3940,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5109510086455331,"acs":3546,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6940,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4813603662524526,"acs":2944,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6116,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.617320819112628,"acs":8682,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14064,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5596630041323638,"acs":34942,"articleLive":2,"columnArticles":479,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62434,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5750006327031609,"acs":22720,"articleLive":2,"columnArticles":320,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39513,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5622672734795201,"acs":2718,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4834,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7721262426406718,"acs":8000,"articleLive":2,"columnArticles":95,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10361,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7485389812243545,"acs":18060,"articleLive":2,"columnArticles":315,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24127,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39337099811676085,"acs":5222,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13275,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5988009198423128,"acs":14582,"articleLive":2,"columnArticles":228,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24352,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6813312058354228,"acs":2989,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4387,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6671012603215993,"acs":1535,"articleLive":2,"columnArticles":36,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2301,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5633281972265023,"acs":1828,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3245,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5565099457504521,"acs":1231,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2212,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4798543689320388,"acs":1977,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4120,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6042718446601941,"acs":12448,"articleLive":2,"columnArticles":252,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20600,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7277995887081697,"acs":7786,"articleLive":2,"columnArticles":98,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10698,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5257943699407998,"acs":13056,"articleLive":2,"columnArticles":199,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24831,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4194680707438909,"acs":3107,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7407,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5679287305122495,"acs":4845,"articleLive":2,"columnArticles":85,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8531,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.921832884097035,"acs":2736,"articleLive":2,"columnArticles":67,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2968,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8240577474101829,"acs":29910,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36296,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071289695398574,"acs":9368,"articleLive":2,"columnArticles":146,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15430,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5849374222352338,"acs":7992,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13663,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49143749288490624,"acs":30218,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61489,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8037206794284174,"acs":5962,"articleLive":2,"columnArticles":84,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7418,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5072463768115942,"acs":2450,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4830,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5192121407814013,"acs":1608,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3097,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5440360610263523,"acs":1569,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2884,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6009852216748769,"acs":976,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1624,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5414566197930486,"acs":8163,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15076,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5016501650165016,"acs":6536,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13029,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7248370471426406,"acs":19127,"articleLive":2,"columnArticles":235,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26388,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5976859504132231,"acs":3616,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6050,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6201095461658842,"acs":1585,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2556,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5064170315566964,"acs":6708,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13246,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318408690546095,"acs":45332,"articleLive":2,"columnArticles":616,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54496,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8108477666362808,"acs":12453,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15358,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41823748349141554,"acs":6967,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16658,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6602090237063472,"acs":2590,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3923,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8129163582531458,"acs":4393,"articleLive":2,"columnArticles":60,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5404,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6458700664587007,"acs":4762,"articleLive":2,"columnArticles":93,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7373,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6035295492617554,"acs":15492,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25669,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.563080735081561,"acs":13635,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24215,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6261834178062542,"acs":6548,"articleLive":2,"columnArticles":98,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10457,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8096443259366385,"acs":53745,"articleLive":2,"columnArticles":699,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66381,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5200652770565982,"acs":7011,"articleLive":2,"columnArticles":156,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13481,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4698625858838226,"acs":6018,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12808,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35958090300280837,"acs":13316,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37032,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6563822782428747,"acs":6978,"articleLive":2,"columnArticles":72,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10631,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8084043787519548,"acs":48075,"articleLive":2,"columnArticles":637,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59469,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45432084240249426,"acs":7723,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16999,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45813261547180506,"acs":6467,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14116,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5974382433668801,"acs":2612,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4372,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7866008170864146,"acs":30421,"articleLive":2,"columnArticles":433,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38674,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46683559974466604,"acs":24134,"articleLive":2,"columnArticles":363,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51697,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3609925892656636,"acs":3215,"articleLive":2,"columnArticles":75,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8906,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8186113989637306,"acs":19749,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24125,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8217738936407587,"acs":8839,"articleLive":2,"columnArticles":83,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10756,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7240134826870042,"acs":21265,"articleLive":2,"columnArticles":383,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29371,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7471092503987241,"acs":14990,"articleLive":2,"columnArticles":226,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20064,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5754359363153905,"acs":17457,"articleLive":2,"columnArticles":272,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30337,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33134920634920634,"acs":1837,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5544,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7512029436739315,"acs":5308,"articleLive":2,"columnArticles":60,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7066,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7556262786997044,"acs":16620,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21995,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129495987529588,"acs":37047,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51963,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3781318082788671,"acs":5554,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14688,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6668552747390921,"acs":10607,"articleLive":2,"columnArticles":151,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15906,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8319866920152091,"acs":35010,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42080,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7399760055566079,"acs":11719,"articleLive":2,"columnArticles":193,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15837,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8099210110584518,"acs":12817,"articleLive":2,"columnArticles":263,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15825,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4406833280607403,"acs":2786,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6322,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6145412926932112,"acs":10202,"articleLive":2,"columnArticles":193,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16601,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6549932453496831,"acs":6303,"articleLive":2,"columnArticles":113,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9623,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6169048949932124,"acs":30902,"articleLive":2,"columnArticles":512,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50092,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5892007611798288,"acs":2477,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4204,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6139222812412636,"acs":4392,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7154,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5941071028456195,"acs":5303,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8926,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7550009289651328,"acs":24382,"articleLive":2,"columnArticles":478,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32294,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5891202550562917,"acs":5913,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10037,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.729135432283858,"acs":10213,"articleLive":2,"columnArticles":181,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14007,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47245971719829005,"acs":5747,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12164,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6890703517587939,"acs":5485,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7960,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46253691901134775,"acs":5951,"articleLive":2,"columnArticles":121,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12866,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7717439293598234,"acs":6992,"articleLive":2,"columnArticles":157,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9060,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3788517677586766,"acs":1168,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3083,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5354519902076345,"acs":11811,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22058,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6868047982551799,"acs":9447,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13755,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5436254594699168,"acs":5620,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10338,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4900069516857838,"acs":5639,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11508,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5852025443588885,"acs":3496,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5974,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4222116978451338,"acs":1783,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4223,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7059623298225259,"acs":38943,"articleLive":2,"columnArticles":623,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55163,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6397427743622359,"acs":9053,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14151,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3985344125676517,"acs":8321,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20879,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5740133735413662,"acs":4378,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7627,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.479920814479638,"acs":3394,"articleLive":2,"columnArticles":47,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7072,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8203167774736019,"acs":41951,"articleLive":2,"columnArticles":638,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51140,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5446287688174336,"acs":12771,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23449,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5922167487684729,"acs":6011,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10150,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36657409745013886,"acs":5808,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15844,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4348427812223206,"acs":15710,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36128,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7399621212121212,"acs":7814,"articleLive":2,"columnArticles":116,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10560,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3051917459719212,"acs":3239,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10613,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5062026743998711,"acs":3142,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6207,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.847979797979798,"acs":8395,"articleLive":2,"columnArticles":84,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9900,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7545876798903526,"acs":29730,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39399,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44473455178416016,"acs":6643,"articleLive":2,"columnArticles":71,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14937,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.283981670568312,"acs":11403,"articleLive":2,"columnArticles":154,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40154,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2816600252697055,"acs":2898,"articleLive":2,"columnArticles":71,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10289,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6611712175854371,"acs":3850,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5823,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7316216388835665,"acs":45820,"articleLive":2,"columnArticles":506,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62628,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5298898793917147,"acs":4042,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7628,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49459150470495117,"acs":5624,"articleLive":2,"columnArticles":111,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11371,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5511319281811085,"acs":2824,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5124,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5051381998582566,"acs":8553,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16932,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40225300490486715,"acs":7463,"articleLive":2,"columnArticles":201,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18553,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5255561047948591,"acs":5316,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10115,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36522901046692896,"acs":4920,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13471,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6736905478627333,"acs":3357,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4983,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250591475002909,"acs":85090,"articleLive":2,"columnArticles":1089,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103132,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5383448380490025,"acs":7097,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13183,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4181778156902672,"acs":15197,"articleLive":2,"columnArticles":222,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36341,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5251021599532983,"acs":3598,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6852,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6083352005377549,"acs":2715,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4463,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900498003057048,"acs":48069,"articleLive":2,"columnArticles":577,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60843,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799290005461496,"acs":21237,"articleLive":2,"columnArticles":265,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36620,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5133182560623194,"acs":8171,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15918,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4038598607379791,"acs":7366,"articleLive":2,"columnArticles":167,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18239,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7395310248460766,"acs":16936,"articleLive":2,"columnArticles":226,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22901,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5745075933417335,"acs":8663,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15079,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5030108390204737,"acs":7518,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14946,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32435579012728966,"acs":4179,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12884,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.861157617794786,"acs":7201,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8362,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8373425896028415,"acs":10373,"articleLive":2,"columnArticles":161,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12388,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7276894865525673,"acs":16667,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22904,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7317374136229022,"acs":11860,"articleLive":2,"columnArticles":155,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16208,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6921788748992123,"acs":11160,"articleLive":2,"columnArticles":174,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16123,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32284299858557286,"acs":4565,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14140,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.543957577449065,"acs":1949,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3583,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7009882547731153,"acs":13548,"articleLive":2,"columnArticles":203,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19327,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3120035742652899,"acs":6285,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20144,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6951651779384659,"acs":9806,"articleLive":2,"columnArticles":170,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14106,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5411322710195621,"acs":4177,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7719,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8311918475852902,"acs":28140,"articleLive":2,"columnArticles":479,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33855,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3537191004966241,"acs":6339,"articleLive":2,"columnArticles":115,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17921,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39950862895493766,"acs":6667,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16688,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4036815509951531,"acs":7829,"articleLive":2,"columnArticles":143,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19394,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8560908899642331,"acs":4069,"articleLive":2,"columnArticles":60,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4753,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6649947509623235,"acs":17103,"articleLive":2,"columnArticles":274,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25719,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7484356102434664,"acs":14233,"articleLive":2,"columnArticles":211,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19017,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4127086007702182,"acs":10288,"articleLive":2,"columnArticles":143,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":24928,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3738590726542534,"acs":1024,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2739,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7618381967499563,"acs":4360,"articleLive":2,"columnArticles":66,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5723,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6709746519100321,"acs":9397,"articleLive":2,"columnArticles":150,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14005,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6052294557097119,"acs":5671,"articleLive":2,"columnArticles":97,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9370,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4167375584857507,"acs":3919,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9404,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7530535546507986,"acs":9618,"articleLive":2,"columnArticles":175,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12772,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.691149812249126,"acs":21351,"articleLive":2,"columnArticles":362,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30892,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4929192036669631,"acs":7205,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14617,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5077160493827161,"acs":5593,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11016,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.568514828273356,"acs":4850,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8531,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6665906759375356,"acs":5848,"articleLive":2,"columnArticles":66,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8773,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6152219873150105,"acs":13386,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21758,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8067729083665338,"acs":8100,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10040,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4752987793187192,"acs":7437,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15647,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5506557958170861,"acs":7767,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14105,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5560573335951305,"acs":2832,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5093,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.693330787832506,"acs":10895,"articleLive":2,"columnArticles":222,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15714,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6032471240923554,"acs":7394,"articleLive":2,"columnArticles":148,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12257,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6849656893325016,"acs":6588,"articleLive":2,"columnArticles":178,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9618,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4086678301337987,"acs":2810,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6876,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.519096872861915,"acs":12898,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24847,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7326413440054304,"acs":25904,"articleLive":2,"columnArticles":415,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35357,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4188542884472314,"acs":7882,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18818,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5969965534219597,"acs":2425,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4062,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7485760781122864,"acs":2760,"articleLive":2,"columnArticles":34,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3687,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5404226941623064,"acs":10535,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19494,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5540489104577029,"acs":34935,"articleLive":2,"columnArticles":510,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63054,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3977864583333333,"acs":6721,"articleLive":2,"columnArticles":144,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16896,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4390076754385965,"acs":3203,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7296,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7087144920558498,"acs":1472,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2077,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6562874251497006,"acs":1096,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1670,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5932553337921541,"acs":862,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1453,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5049250535331906,"acs":1179,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2335,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5846538782318599,"acs":701,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1199,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8463237988489642,"acs":78527,"articleLive":2,"columnArticles":1031,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92786,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3937860010473032,"acs":4512,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11458,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6409245845760545,"acs":6017,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9388,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4654260171501551,"acs":2551,"articleLive":2,"columnArticles":45,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5481,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6197437829691033,"acs":4112,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6635,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8217245197999007,"acs":43037,"articleLive":2,"columnArticles":636,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":52374,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5866726447346299,"acs":10468,"articleLive":2,"columnArticles":175,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17843,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48275508410009965,"acs":32949,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68252,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5618860510805501,"acs":3718,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6617,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.69824193125164,"acs":2661,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3811,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6474812355658198,"acs":17943,"articleLive":2,"columnArticles":375,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27712,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916190911166933,"acs":34665,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43790,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4109298412466164,"acs":5617,"articleLive":2,"columnArticles":140,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13669,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5267267267267267,"acs":2631,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4995,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8570196247573862,"acs":3974,"articleLive":2,"columnArticles":52,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4637,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5730286333664529,"acs":12688,"articleLive":2,"columnArticles":215,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22142,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6170968753265754,"acs":5905,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9569,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7111273792093704,"acs":9714,"articleLive":2,"columnArticles":155,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13660,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6278440489347917,"acs":16474,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26239,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8026592022393282,"acs":24087,"articleLive":2,"columnArticles":342,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30009,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5228659331490848,"acs":10027,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19177,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49895213345628303,"acs":5952,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11929,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36473214285714284,"acs":1634,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4480,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.396128012643224,"acs":5013,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12655,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6329795659749723,"acs":11988,"articleLive":2,"columnArticles":205,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18939,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5229056824838899,"acs":13389,"articleLive":2,"columnArticles":209,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25605,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6322673259430577,"acs":7928,"articleLive":2,"columnArticles":138,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12539,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44232437120555074,"acs":5610,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12683,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5964360587002097,"acs":2276,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3816,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7457173447537473,"acs":15323,"articleLive":2,"columnArticles":310,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20548,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5008088548318433,"acs":5882,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11745,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42768977576630324,"acs":6237,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14583,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5911492734478203,"acs":2685,"articleLive":2,"columnArticles":64,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4542,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7684405475012298,"acs":26555,"articleLive":2,"columnArticles":370,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34557,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3094288216405566,"acs":6360,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20554,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4845345116562548,"acs":6360,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13126,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6172839506172839,"acs":1650,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2673,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7076372315035799,"acs":2965,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4190,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7950377562028047,"acs":2211,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2781,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8428389169777442,"acs":53511,"articleLive":2,"columnArticles":724,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63489,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.543912690804513,"acs":7376,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13561,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6164896462138,"acs":8068,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13087,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6744448789814452,"acs":15521,"articleLive":2,"columnArticles":165,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23013,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7176514584891548,"acs":1919,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2674,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7214457831325302,"acs":14970,"articleLive":2,"columnArticles":232,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20750,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8652331712661782,"acs":12635,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14603,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2901984009475866,"acs":4900,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16885,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5801177240026161,"acs":2661,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4587,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5648766328011611,"acs":1946,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3445,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692817970963532,"acs":128552,"articleLive":2,"columnArticles":1288,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147883,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5140248541719503,"acs":10134,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19715,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5866056462700341,"acs":31147,"articleLive":2,"columnArticles":404,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53097,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.300286584273688,"acs":3353,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11166,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8079673135852911,"acs":791,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":979,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6600838867528837,"acs":3777,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5722,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585324541770007,"acs":70962,"articleLive":2,"columnArticles":681,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82655,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3105800670084366,"acs":7694,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24773,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23729254799869834,"acs":7292,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30730,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6910189672709867,"acs":11549,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16713,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8552727272727273,"acs":1176,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1375,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6716810577441986,"acs":19914,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29648,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6620805701276848,"acs":6689,"articleLive":2,"columnArticles":79,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10103,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5678568810030061,"acs":7745,"articleLive":2,"columnArticles":147,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13639,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3697976640894884,"acs":2248,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6079,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428218501235246,"acs":3955,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7286,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5372724149776709,"acs":10948,"articleLive":2,"columnArticles":166,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20377,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39062719894919545,"acs":8327,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21317,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3346141530579571,"acs":5225,"articleLive":2,"columnArticles":66,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15615,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3752603082049146,"acs":2703,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7203,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.302099533437014,"acs":777,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2572,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5903597122302159,"acs":4103,"articleLive":2,"columnArticles":60,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6950,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7171643054693233,"acs":25412,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35434,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5130267739224397,"acs":8546,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16658,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5947330505082846,"acs":7430,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12493,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36320598921061326,"acs":3299,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9083,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8408104196816208,"acs":581,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":691,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5898168988381288,"acs":9696,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16439,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5527153643227508,"acs":6076,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10993,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5469361837231453,"acs":5168,"articleLive":2,"columnArticles":77,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9449,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.577896897810219,"acs":5067,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8768,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.678658635845678,"acs":4169,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6143,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488705058860961,"acs":58696,"articleLive":2,"columnArticles":745,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69146,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37982206038954347,"acs":11057,"articleLive":2,"columnArticles":149,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29111,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.32330332552308133,"acs":7865,"articleLive":2,"columnArticles":137,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24327,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34277620396600567,"acs":3146,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9178,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7332049636285837,"acs":3427,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4674,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6746285652315367,"acs":24883,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36884,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2975939443092728,"acs":5504,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18495,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33280360217189775,"acs":2513,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7551,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3967848557692308,"acs":2641,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6656,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7086538461538462,"acs":737,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1040,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5774174869716271,"acs":9972,"articleLive":2,"columnArticles":171,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17270,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4276129032258065,"acs":4971,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11625,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.661963190184049,"acs":5395,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8150,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6155646576945583,"acs":3156,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5127,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5027383794410898,"acs":3580,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7121,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851259181532004,"acs":29929,"articleLive":2,"columnArticles":359,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38120,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6908441407160053,"acs":8896,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12877,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5672587175133864,"acs":8687,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15314,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3281417830290011,"acs":1833,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5586,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6148555708390646,"acs":2682,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4362,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6189473684210526,"acs":294,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":475,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7893090440702917,"acs":17158,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21738,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4532310011649421,"acs":13228,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29186,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4402360515021459,"acs":4103,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9320,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36628529097045026,"acs":4450,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12149,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5990566037735849,"acs":127,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":212,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5392243785505533,"acs":16421,"articleLive":2,"columnArticles":247,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30453,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3175931981687377,"acs":4856,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15290,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4611038006037619,"acs":5957,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12919,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3839616810877627,"acs":2485,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6472,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.55175652827353,"acs":2937,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5323,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5461759663772604,"acs":19753,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36166,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.553921206297583,"acs":7494,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13529,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41412520064205455,"acs":5160,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12460,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5368950013224015,"acs":4060,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7562,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7119675456389453,"acs":351,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":493,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6686632180778656,"acs":2456,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3673,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6592636248022581,"acs":21254,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32239,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8168664133294359,"acs":11178,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13684,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.511070007286587,"acs":9118,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17841,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29578488372093026,"acs":7733,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26144,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7101063829787234,"acs":534,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":752,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43853290808930123,"acs":3025,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6898,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5788042028908208,"acs":10852,"articleLive":2,"columnArticles":165,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18749,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7682772083943387,"acs":7871,"articleLive":2,"columnArticles":107,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10245,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6227886892324836,"acs":4471,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7179,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36603853037161804,"acs":3477,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9499,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5750066613375966,"acs":8632,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15012,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7800013430931435,"acs":11615,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14891,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3095429029671211,"acs":4246,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13717,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3783757992174826,"acs":3965,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10479,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5412844036697247,"acs":649,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1199,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7252232142857142,"acs":3249,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4480,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44556019406521497,"acs":7898,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17726,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3986469477658905,"acs":12669,"articleLive":2,"columnArticles":202,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":31780,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45617459190915544,"acs":2571,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5636,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47370848708487084,"acs":2054,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4336,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8975903614457831,"acs":1639,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1826,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7586206896551724,"acs":3410,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4495,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048986486486487,"acs":19060,"articleLive":2,"columnArticles":321,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23680,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29503414440098125,"acs":4450,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15083,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3265670004114662,"acs":4762,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14582,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5955631399317406,"acs":4188,"articleLive":2,"columnArticles":67,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7032,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47618921285119253,"acs":17949,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37693,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32497773253594603,"acs":5108,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15718,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5825081625006691,"acs":10883,"articleLive":2,"columnArticles":203,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18683,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.618835115795953,"acs":16086,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25994,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.632420091324201,"acs":277,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":438,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8075052119527449,"acs":3486,"articleLive":2,"columnArticles":46,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4317,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6711167620258529,"acs":9501,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14157,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6852599882491187,"acs":18661,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27232,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.664302298879902,"acs":26036,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39193,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299656605819628,"acs":2379,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5533,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6254071661237784,"acs":384,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":614,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8253400143163923,"acs":3459,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4191,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8391976134929438,"acs":43885,"articleLive":2,"columnArticles":697,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52294,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2935870977604525,"acs":3841,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13083,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26849456802897054,"acs":3633,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13531,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5786458333333333,"acs":1111,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1920,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44503372341038794,"acs":7720,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17347,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5312345312345312,"acs":5366,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10101,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3138313831383138,"acs":4184,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13332,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46505905511811024,"acs":1890,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4064,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7491525423728813,"acs":2431,"articleLive":2,"columnArticles":41,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3245,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628959276018099,"acs":293,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":442,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6724232623421005,"acs":11019,"articleLive":2,"columnArticles":149,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16387,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4194984257952448,"acs":3864,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9211,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6787825177918058,"acs":16882,"articleLive":2,"columnArticles":206,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24871,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4898739873987399,"acs":2177,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4444,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7835400225479143,"acs":695,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":887,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443773316752532,"acs":57036,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67548,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41531990259021473,"acs":3752,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9034,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7358003442340791,"acs":3420,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4648,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3412531539108494,"acs":1623,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4756,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5459047619047619,"acs":2866,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5250,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6393581631987476,"acs":9802,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15331,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.512002279364627,"acs":7188,"articleLive":2,"columnArticles":124,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14039,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2701215317587709,"acs":2356,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8722,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6100262314194113,"acs":2093,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3431,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7355371900826446,"acs":445,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":605,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7223906453009961,"acs":1668,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2309,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.821190765492102,"acs":16896,"articleLive":2,"columnArticles":286,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20575,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49682717431877566,"acs":5324,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10716,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27575957727873185,"acs":5010,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18168,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6210675150229763,"acs":1757,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2829,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5910780669144982,"acs":318,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":538,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6740027510316369,"acs":7350,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10905,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37154447115384615,"acs":2473,"articleLive":2,"columnArticles":43,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6656,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44086288122985373,"acs":1778,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4033,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.1497335916686849,"acs":2473,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16516,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7835240274599542,"acs":3424,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4370,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6256903811450757,"acs":11442,"articleLive":2,"columnArticles":197,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18287,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5429680280909259,"acs":2938,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5411,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38650004919807146,"acs":3928,"articleLive":2,"columnArticles":84,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10163,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3811673151750973,"acs":2449,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6425,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8417721518987342,"acs":399,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":474,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5241210139002453,"acs":8333,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15899,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7682283586720446,"acs":7428,"articleLive":2,"columnArticles":115,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9669,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49341261513349655,"acs":25392,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51462,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3188028627195836,"acs":1470,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4611,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6563557274045433,"acs":2716,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4138,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5242718446601942,"acs":432,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":824,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5482807348092322,"acs":1164,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2123,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7071022062836205,"acs":9070,"articleLive":2,"columnArticles":177,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12827,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8066023515224601,"acs":5351,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6634,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7116455696202532,"acs":2811,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3950,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40114249444620753,"acs":1264,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3151,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6602644180720383,"acs":12685,"articleLive":2,"columnArticles":217,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19212,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.770814739257937,"acs":12091,"articleLive":2,"columnArticles":278,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15686,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45111312722450975,"acs":6464,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14329,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45197513535191497,"acs":2254,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4987,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5471882640586797,"acs":1119,"articleLive":2,"columnArticles":23,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2045,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.41030927835051545,"acs":796,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1940,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5365759950822192,"acs":34915,"articleLive":2,"columnArticles":356,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65070,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5149396058486968,"acs":7290,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14157,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2776045414567842,"acs":3472,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12507,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4740271830199218,"acs":2546,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5371,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.795369211514393,"acs":1271,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1598,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6823529411764706,"acs":754,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1105,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.656497175141243,"acs":6972,"articleLive":2,"columnArticles":177,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10620,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.506805994775196,"acs":3686,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7273,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27381518465683946,"acs":3455,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12618,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3832699619771863,"acs":2016,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5260,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7812966835972512,"acs":7845,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10041,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46472184531886024,"acs":5480,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11792,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29960277385040057,"acs":8900,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29706,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4125230202578269,"acs":1344,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3258,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7420560747663552,"acs":397,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":535,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7241086587436333,"acs":2559,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3534,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8122277596829258,"acs":20698,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25483,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725498990805113,"acs":7659,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13377,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5449682042999899,"acs":5399,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9907,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6635514018691588,"acs":5183,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7811,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6029858999170583,"acs":2181,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3617,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4438107582631238,"acs":6848,"articleLive":2,"columnArticles":129,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15430,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7584253083869444,"acs":12850,"articleLive":2,"columnArticles":236,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16943,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5268088253420437,"acs":4274,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8113,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46745832381822333,"acs":2047,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4379,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.850949883193018,"acs":38611,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45374,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35421844956150633,"acs":7553,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21323,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3640980989696706,"acs":2509,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6891,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4365702824669898,"acs":2612,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5983,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7632311977715878,"acs":822,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1077,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.38958776853106253,"acs":2013,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5167,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8300756170637752,"acs":17454,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21027,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49713302752293576,"acs":6936,"articleLive":2,"columnArticles":112,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13952,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4645527197731374,"acs":5406,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11637,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38450339695891295,"acs":2377,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6182,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5206349206349207,"acs":328,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":630,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8957688338493293,"acs":3472,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3876,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8280547409579667,"acs":16942,"articleLive":2,"columnArticles":356,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20460,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5995456758072367,"acs":3695,"articleLive":2,"columnArticles":85,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6163,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4711126961483595,"acs":2642,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5608,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.40277194456110876,"acs":959,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2381,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8057219164778245,"acs":19911,"articleLive":2,"columnArticles":267,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24712,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8671208530805687,"acs":14637,"articleLive":2,"columnArticles":191,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16880,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5173602853745541,"acs":4351,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8410,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4889911929543635,"acs":2443,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4996,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6510791366906474,"acs":181,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":278,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8002827854365501,"acs":2264,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2829,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6355293346443789,"acs":7756,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12204,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4618181818181818,"acs":6223,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13475,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.398128103909334,"acs":6253,"articleLive":2,"columnArticles":112,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15706,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5258829221093372,"acs":2174,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4134,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5246636771300448,"acs":468,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":892,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7982062780269058,"acs":1780,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2230,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7098997493734336,"acs":7931,"articleLive":2,"columnArticles":181,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11172,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6101694915254238,"acs":3888,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6372,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47766990291262135,"acs":2952,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6180,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3834834834834835,"acs":1277,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3330,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.781785392245266,"acs":12138,"articleLive":2,"columnArticles":185,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15526,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3469227041434456,"acs":5727,"articleLive":2,"columnArticles":120,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16508,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5852797392721347,"acs":4310,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7364,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.503141305505271,"acs":14175,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28173,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6997759522031367,"acs":937,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1339,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.703232125367287,"acs":1436,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2042,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6943076738321124,"acs":11563,"articleLive":2,"columnArticles":184,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16654,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3591242617669868,"acs":30100,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83815,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2623782974119997,"acs":6306,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24034,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4960525064206221,"acs":15645,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31539,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.638961038961039,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":385,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7294067434912506,"acs":1709,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2343,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.674642711310739,"acs":8261,"articleLive":2,"columnArticles":193,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12245,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4329244163039177,"acs":2188,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5054,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4908863920099875,"acs":1966,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4005,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.36965436438195665,"acs":631,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1707,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8691961029975503,"acs":46482,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53477,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6459355920028732,"acs":10791,"articleLive":2,"columnArticles":167,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16706,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5151054118669854,"acs":4740,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9202,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5064932235150564,"acs":23245,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45894,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5621890547263682,"acs":339,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":603,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.788234431159686,"acs":10746,"articleLive":2,"columnArticles":146,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13633,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4801459727170041,"acs":5526,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11509,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5750461177259768,"acs":3429,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5963,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3578099838969404,"acs":1111,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3105,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6220040427375109,"acs":2154,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3463,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.531523642732049,"acs":607,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1142,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4720785935884178,"acs":1826,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3868,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7921688752746887,"acs":11896,"articleLive":2,"columnArticles":204,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15017,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45857668180834954,"acs":2120,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4623,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.723256776329402,"acs":27964,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38664,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48861480075901326,"acs":1030,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2108,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4492188114605787,"acs":28551,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63557,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31060018944286577,"acs":3607,"articleLive":2,"columnArticles":103,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11613,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539274716183298,"acs":28455,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43514,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4708653175157013,"acs":2699,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5732,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7019464720194647,"acs":577,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":822,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8410947712418301,"acs":2059,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2448,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7093902234167646,"acs":8446,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11906,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.696917808219178,"acs":22385,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32120,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36279171098665913,"acs":28309,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78031,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4847919655667145,"acs":3379,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6970,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5940730530668504,"acs":862,"articleLive":2,"columnArticles":36,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1451,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7030916844349681,"acs":1319,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1876,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7491097225021837,"acs":11149,"articleLive":2,"columnArticles":222,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14883,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5321671244759288,"acs":3681,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6917,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4572511582198512,"acs":3257,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7123,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4705503009458297,"acs":2189,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4652,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6806053650839191,"acs":9489,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13942,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6294858342077649,"acs":5999,"articleLive":2,"columnArticles":128,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9530,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4221442885771543,"acs":4213,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9980,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.40758228023885573,"acs":2935,"articleLive":2,"columnArticles":50,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7201,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7966457023060797,"acs":380,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":477,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9205917874396136,"acs":3049,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3312,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6378113879003559,"acs":7169,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11240,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42922459643556965,"acs":4600,"articleLive":2,"columnArticles":96,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10717,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5389778007227671,"acs":4176,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7748,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43015925680159256,"acs":2593,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6028,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6877551020408164,"acs":674,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":980,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6098434004474272,"acs":4089,"articleLive":2,"columnArticles":81,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6705,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4755573736960524,"acs":2325,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4889,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5520976353928299,"acs":3619,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6555,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37606837606837606,"acs":1408,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3744,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7884250474383302,"acs":831,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1054,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7657548940734782,"acs":11422,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14916,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8562823449563078,"acs":10093,"articleLive":2,"columnArticles":171,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11787,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37018756169792694,"acs":4125,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11143,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3656891955464952,"acs":2332,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6377,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5186846038863976,"acs":347,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":669,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8426689065042784,"acs":16052,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19049,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5507726269315674,"acs":5988,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10872,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.474390243902439,"acs":4279,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9020,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46149830331506136,"acs":1768,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3831,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7813360382553253,"acs":5392,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6901,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.515850144092219,"acs":179,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":347,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.647787610619469,"acs":5490,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8475,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6650840029218408,"acs":5463,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8214,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5194624064916952,"acs":4097,"articleLive":2,"columnArticles":60,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7887,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29228522754928205,"acs":1201,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4109,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7980066445182724,"acs":1201,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1505,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4213467048710602,"acs":8823,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20940,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34980572429267226,"acs":6392,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18273,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34170097399337285,"acs":3403,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9959,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541345032487366,"acs":11779,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18007,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7169230769230769,"acs":233,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":325,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7119889756545705,"acs":1550,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2177,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6451771896101336,"acs":13090,"articleLive":2,"columnArticles":143,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20289,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8091115067162972,"acs":9999,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12358,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5137750721923047,"acs":6583,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12813,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4143646408839779,"acs":3900,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9412,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5807560137457045,"acs":169,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":291,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7861075815332487,"acs":1856,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2361,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48833604015945664,"acs":6615,"articleLive":2,"columnArticles":121,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13546,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5739252455670366,"acs":4499,"articleLive":2,"columnArticles":71,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7839,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5213921901528014,"acs":3071,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5890,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5184286029574046,"acs":2349,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4531,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6833543682512971,"acs":9746,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14262,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3789184234647113,"acs":4134,"articleLive":2,"columnArticles":109,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10910,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2625187781672509,"acs":4194,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15976,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40925747348119573,"acs":2122,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5185,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.57125,"acs":457,"articleLive":2,"columnArticles":27,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":800,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48841623883687824,"acs":11321,"articleLive":2,"columnArticles":148,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23179,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6627787746731607,"acs":5171,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7802,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5862280971411005,"acs":5721,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9759,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2679100383982447,"acs":2442,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9115,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6255924170616114,"acs":1716,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2743,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6216216216216216,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":296,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6617760617760617,"acs":857,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1295,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7945529899348727,"acs":8052,"articleLive":2,"columnArticles":190,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10134,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5135342676137454,"acs":5350,"articleLive":2,"columnArticles":73,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10418,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3449078564500485,"acs":3556,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10310,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2985341437254201,"acs":1670,"articleLive":2,"columnArticles":39,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5594,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7530631479736098,"acs":10387,"articleLive":2,"columnArticles":153,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13793,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6985517402476057,"acs":5981,"articleLive":2,"columnArticles":96,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8562,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3736738075167863,"acs":25711,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68806,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3681782020684169,"acs":2314,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6285,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5049019607843137,"acs":103,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":204,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.901946382666177,"acs":2456,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2723,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8097885637758208,"acs":19954,"articleLive":2,"columnArticles":199,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24641,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7149275239467662,"acs":8434,"articleLive":2,"columnArticles":104,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11797,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.657055630936228,"acs":7748,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11792,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2860394537177542,"acs":2639,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9226,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4386252045826514,"acs":268,"articleLive":2,"columnArticles":21,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":611,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7952549814251942,"acs":9419,"articleLive":2,"columnArticles":138,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11844,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8673766816143498,"acs":7737,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8920,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6826295914864401,"acs":3977,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5826,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4875141884222474,"acs":859,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1762,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7385129490392648,"acs":884,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1197,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8247511899610558,"acs":13342,"articleLive":2,"columnArticles":212,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16177,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6845203522597052,"acs":43606,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63703,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35113964308852114,"acs":5962,"articleLive":2,"columnArticles":129,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16979,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5097155730780062,"acs":3620,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7102,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7094017094017094,"acs":415,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":585,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.795784061696658,"acs":7739,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9725,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4294014503090823,"acs":28897,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67296,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5748010610079576,"acs":6501,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11310,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3895175699821322,"acs":1962,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5037,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5137872819358469,"acs":913,"articleLive":2,"columnArticles":28,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1777,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6555555555555556,"acs":118,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":180,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5076551168412571,"acs":630,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1241,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8006299580027998,"acs":6863,"articleLive":2,"columnArticles":112,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8572,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5345937912813739,"acs":6475,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12112,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336553945249598,"acs":27545,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43470,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36048848353686813,"acs":2332,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6469,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6829031973927596,"acs":7753,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11353,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3283337239278181,"acs":5604,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17068,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6095750128008193,"acs":2381,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3906,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40104690960338235,"acs":1992,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4967,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7142857142857143,"acs":190,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":266,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6460396039603961,"acs":1044,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1616,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7889858602259657,"acs":11662,"articleLive":2,"columnArticles":121,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14781,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6813779655508613,"acs":10483,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15385,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3566960705693665,"acs":4448,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12470,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45115600916475734,"acs":2166,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4801,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6338289962825279,"acs":341,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":538,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7667970933482392,"acs":6859,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8945,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7716369218959892,"acs":4021,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5211,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6185778108711839,"acs":3323,"articleLive":2,"columnArticles":68,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5372,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31274292059966685,"acs":2253,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7204,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9058874086807047,"acs":12648,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13962,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38695113314447593,"acs":4371,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11296,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5129000969932105,"acs":5288,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10310,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5975215517241379,"acs":2218,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3712,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7433234421364985,"acs":501,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":674,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5467128027681661,"acs":158,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":289,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.788373247301154,"acs":12707,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16118,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4556762332382744,"acs":7510,"articleLive":2,"columnArticles":71,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16481,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2763559087129262,"acs":5982,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21646,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6210171568627451,"acs":2027,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3264,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8119858989424207,"acs":2073,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2553,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.893491124260355,"acs":302,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":338,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7463768115942029,"acs":412,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":552,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7277771077071523,"acs":6034,"articleLive":2,"columnArticles":94,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8291,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8202704130136262,"acs":31062,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37868,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4291433146517214,"acs":2144,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4996,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41298066236941544,"acs":1858,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4499,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7717617659308621,"acs":7412,"articleLive":2,"columnArticles":99,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9604,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3530480656506448,"acs":6023,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17060,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2782052258703436,"acs":3652,"articleLive":2,"columnArticles":110,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13127,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3757562662057044,"acs":1739,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4628,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6892959770114943,"acs":1919,"articleLive":2,"columnArticles":37,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2784,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5211864406779662,"acs":246,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":472,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5712462781794981,"acs":5372,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9404,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6457755359394703,"acs":5121,"articleLive":2,"columnArticles":65,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7930,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31714580231359524,"acs":2769,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8731,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2705791704122255,"acs":2107,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7787,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7070631970260223,"acs":951,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1345,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4693200663349917,"acs":283,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":603,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.33725761772853186,"acs":487,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1444,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5912753699589562,"acs":31405,"articleLive":2,"columnArticles":409,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53114,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45819179029807416,"acs":37092,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":80953,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5310647073988142,"acs":2060,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3879,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5056784219964137,"acs":846,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1673,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5311203319502075,"acs":6272,"articleLive":2,"columnArticles":78,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11809,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30994597062628415,"acs":4073,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13141,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6292153872225047,"acs":3713,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5901,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43608498780912575,"acs":1252,"articleLive":2,"columnArticles":35,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2871,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6619469026548672,"acs":748,"articleLive":2,"columnArticles":27,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1130,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.44886363636363635,"acs":79,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":176,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6436542953542694,"acs":7440,"articleLive":2,"columnArticles":102,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11559,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2788753176489876,"acs":3402,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12199,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.570357833655706,"acs":4718,"articleLive":2,"columnArticles":94,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8272,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4233390119250426,"acs":2485,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5870,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5899632802937577,"acs":482,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":817,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6666666666666666,"acs":166,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":249,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3256611165523996,"acs":4655,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14294,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.675411047478293,"acs":3656,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5413,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.571604938271605,"acs":3241,"articleLive":2,"columnArticles":69,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5670,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.26941707031902457,"acs":1613,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":5987,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8370971053171833,"acs":8155,"articleLive":2,"columnArticles":83,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9742,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44060416383181383,"acs":3238,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7349,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3912804291019117,"acs":2845,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7271,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5517403574788335,"acs":1173,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2126,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.288117770767613,"acs":274,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":951,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.48880597014925375,"acs":131,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":268,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3922924901185771,"acs":397,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1012,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9150894252474387,"acs":10540,"articleLive":2,"columnArticles":92,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11518,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34405445915563326,"acs":5509,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16012,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3609093039606281,"acs":4620,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12801,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23691767708998085,"acs":1485,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6268,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.37579617834394907,"acs":59,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":157,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6945496939667736,"acs":4766,"articleLive":2,"columnArticles":59,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6862,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3442088091353997,"acs":3587,"articleLive":2,"columnArticles":60,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10421,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4126874279123414,"acs":1789,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4335,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3965272856130404,"acs":2238,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5644,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9141496801071269,"acs":12288,"articleLive":2,"columnArticles":107,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13442,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.47942708333333334,"acs":5523,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11520,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5605479452054795,"acs":2046,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3650,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3272235576923077,"acs":1089,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3328,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5440993788819876,"acs":438,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":805,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7382198952879581,"acs":282,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":382,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7395466549295775,"acs":6721,"articleLive":2,"columnArticles":94,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9088,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44991579116208197,"acs":5610,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12469,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2423636223743941,"acs":3150,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12997,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34537177541729897,"acs":1138,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3295,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6259097525473072,"acs":430,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":687,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7954070981210856,"acs":381,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":479,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7723091818621913,"acs":4786,"articleLive":2,"columnArticles":84,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6197,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3921030984370716,"acs":2860,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7294,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4077922077922078,"acs":1884,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4620,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5780193946517779,"acs":1967,"articleLive":2,"columnArticles":52,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3403,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6641920065086953,"acs":6531,"articleLive":2,"columnArticles":75,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9833,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3041640486662478,"acs":5325,"articleLive":2,"columnArticles":81,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17507,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5414245168265982,"acs":4006,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7399,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5149572649572649,"acs":964,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1872,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5379464285714286,"acs":241,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":448,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5523012552301255,"acs":132,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":239,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6681514476614699,"acs":300,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":449,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5458849522607118,"acs":6918,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12673,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3253797759705386,"acs":4241,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13034,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4809452102397776,"acs":4152,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8633,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49617737003058104,"acs":2596,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5232,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4440894568690096,"acs":139,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":313,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6056872037914692,"acs":4473,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7385,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42333163525216505,"acs":2493,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5889,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41386138613861384,"acs":1463,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3535,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27742805755395683,"acs":617,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2224,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5347725520431765,"acs":6936,"articleLive":2,"columnArticles":64,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12970,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4306382978723404,"acs":5566,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12925,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6146853146853147,"acs":4395,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7150,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38328424153166424,"acs":3123,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8148,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7369519832985386,"acs":353,"articleLive":2,"columnArticles":13,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":479,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7241379310344828,"acs":42,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":58,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7779207411219763,"acs":6046,"articleLive":2,"columnArticles":57,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7772,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35799044536908614,"acs":4646,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12978,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27943153447282504,"acs":2910,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10414,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47966768692610406,"acs":2194,"articleLive":2,"columnArticles":49,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4574,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5551763367463026,"acs":488,"articleLive":2,"columnArticles":19,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":879,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4552238805970149,"acs":183,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":402,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7405159332321699,"acs":3904,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5272,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3814883474576271,"acs":2881,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7552,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28911764705882353,"acs":1966,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6800,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24689284514612025,"acs":735,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2977,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5354166666666667,"acs":257,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":480,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8126509993410937,"acs":7400,"articleLive":2,"columnArticles":83,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9106,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5808359226220307,"acs":5795,"articleLive":2,"columnArticles":92,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9977,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2984213319182807,"acs":4499,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15076,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4573816155988858,"acs":821,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1795,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6621621621621622,"acs":49,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":74,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5804784107034259,"acs":5727,"articleLive":2,"columnArticles":63,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9866,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4126541397533764,"acs":5622,"articleLive":2,"columnArticles":79,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13624,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2755204705518149,"acs":3560,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12921,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4609604704344985,"acs":1411,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3061,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6764705882352942,"acs":184,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":272,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.449438202247191,"acs":40,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":89,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6066666666666667,"acs":182,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":300,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6604987932421561,"acs":4105,"articleLive":2,"columnArticles":57,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6215,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5942205942205943,"acs":2920,"articleLive":2,"columnArticles":56,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4914,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38466494845360827,"acs":1791,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4656,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.36292032717358375,"acs":1198,"articleLive":2,"columnArticles":35,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3301,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5513766959297686,"acs":5527,"articleLive":2,"columnArticles":46,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10024,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2466663207596119,"acs":4754,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19273,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34123998036970393,"acs":2086,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6113,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.41906005221932113,"acs":1605,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3830,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6588235294117647,"acs":56,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":85,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7783783783783784,"acs":6624,"articleLive":2,"columnArticles":85,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8510,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3580866471858722,"acs":5637,"articleLive":2,"columnArticles":124,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15742,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5711245703061057,"acs":3489,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6109,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3920908708456037,"acs":1864,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4754,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.40669856459330145,"acs":85,"articleLive":2,"columnArticles":4,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":209,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6829268292682927,"acs":28,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":41,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8845022069641981,"acs":3607,"articleLive":2,"columnArticles":48,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4078,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.29654017857142856,"acs":2657,"articleLive":2,"columnArticles":49,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":8960,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.41879111842105265,"acs":2037,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4864,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4138817480719794,"acs":1288,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3112,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6444444444444445,"acs":58,"articleLive":2,"columnArticles":3,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":90,"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.9048580077843448,"acs":6277,"articleLive":2,"columnArticles":51,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":6937,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.35502133960456406,"acs":4076,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11481,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32697416083071723,"acs":2708,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8282,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5202115602568946,"acs":1377,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2647,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8648648648648649,"acs":32,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":37,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5542777300085985,"acs":5157,"articleLive":2,"columnArticles":65,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9304,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34598765432098766,"acs":3363,"articleLive":2,"columnArticles":89,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9720,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.4094922737306843,"acs":1855,"articleLive":2,"columnArticles":48,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4530,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34310051107325384,"acs":1007,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2935,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8403361344537815,"acs":100,"articleLive":2,"columnArticles":4,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":119,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.76,"acs":38,"articleLive":2,"columnArticles":4,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":50,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6583374567046016,"acs":2661,"articleLive":2,"columnArticles":32,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4042,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7576584774037003,"acs":2498,"articleLive":2,"columnArticles":36,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3297,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4755145493257629,"acs":2010,"articleLive":2,"columnArticles":52,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4227,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2543366150961088,"acs":1085,"articleLive":2,"columnArticles":37,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4266,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9103448275862069,"acs":132,"articleLive":2,"columnArticles":8,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":145,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.547309573724668,"acs":3916,"articleLive":2,"columnArticles":40,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7155,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.42075801749271136,"acs":3608,"articleLive":2,"columnArticles":52,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":8575,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.21514729761076318,"acs":1855,"articleLive":2,"columnArticles":65,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8622,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.33840052875082616,"acs":1024,"articleLive":2,"columnArticles":36,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3026,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.7222222222222222,"acs":13,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":18,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6709462672372801,"acs":4233,"articleLive":2,"columnArticles":64,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":6309,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.37398785425101216,"acs":2956,"articleLive":2,"columnArticles":56,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":7904,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.2816247582205029,"acs":2184,"articleLive":2,"columnArticles":54,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"notac","submitted":7755,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.2530746105493304,"acs":926,"articleLive":2,"columnArticles":28,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":3659,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.8451224717112729,"acs":81185,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96063,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.690824434434941,"acs":13650,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19759,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21927577918751723,"acs":11130,"articleLive":2,"columnArticles":183,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50758,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3774245296777016,"acs":2588,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6857,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.2001169704649576,"acs":2053,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10259,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8397524600246002,"acs":43694,"articleLive":2,"columnArticles":659,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52032,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7695095528855623,"acs":39068,"articleLive":2,"columnArticles":470,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50770,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28815969062784347,"acs":5067,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17584,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27539994974453474,"acs":6576,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23878,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5888707037643208,"acs":1799,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3055,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6894167167769092,"acs":6879,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9978,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4105500160823416,"acs":6382,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15545,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6119886069394096,"acs":9454,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15448,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21078279702970298,"acs":2725,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12928,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5768194070080862,"acs":856,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1484,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3113496932515337,"acs":609,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1956,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7989929370416681,"acs":23643,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29591,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2865508587175828,"acs":17469,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":60963,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163635409285358,"acs":19675,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38103,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3123571805238179,"acs":1777,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5689,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3355426677713339,"acs":810,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2414,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3333953765402226,"acs":8956,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26863,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33806085611139763,"acs":2622,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7756,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2817985833076686,"acs":915,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3247,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33200114187838997,"acs":1163,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3503,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3351482153660012,"acs":554,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1653,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32886435331230285,"acs":1251,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3804,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28212576424046254,"acs":10198,"articleLive":2,"columnArticles":173,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36147,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1866146657345745,"acs":5072,"articleLive":2,"columnArticles":123,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27179,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34921426789723126,"acs":5600,"articleLive":2,"columnArticles":97,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16036,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2521611721611722,"acs":1721,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6825,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40488182874854706,"acs":1045,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2581,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21702332291416207,"acs":4513,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20795,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4828944640265395,"acs":2329,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4823,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3979310344827586,"acs":1154,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2900,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2614290551981036,"acs":772,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2953,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19264448336252188,"acs":770,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3997,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5645355850422196,"acs":468,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":829,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5035002692514808,"acs":3740,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7428,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.231496062992126,"acs":2793,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12065,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.41644993498049415,"acs":1281,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3076,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19902248289345065,"acs":1018,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5115,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.39570552147239263,"acs":387,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":978,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8564650059311981,"acs":2166,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2529,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18517165814463113,"acs":1014,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5476,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.36589620584387267,"acs":839,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2293,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3526989935956084,"acs":771,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2186,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15146396396396397,"acs":269,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1776,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22396694214876034,"acs":271,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1210,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5444867919568932,"acs":4143,"articleLive":2,"columnArticles":96,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7609,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6974928072338676,"acs":3394,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4866,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4136664217487142,"acs":1689,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4083,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678146196076843,"acs":401824,"articleLive":2,"columnArticles":2796,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":592533,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40319150900429596,"acs":262039,"articleLive":2,"columnArticles":2093,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":649912,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7608464263586827,"acs":287358,"articleLive":2,"columnArticles":1945,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":377682,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7514694012963412,"acs":303523,"articleLive":2,"columnArticles":2087,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":403906,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6977951429128543,"acs":189667,"articleLive":2,"columnArticles":1449,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":271809,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7155177546016919,"acs":264411,"articleLive":2,"columnArticles":1668,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":369538,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600633927390219,"acs":264001,"articleLive":2,"columnArticles":1859,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":733207,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44381962648372236,"acs":195890,"articleLive":2,"columnArticles":1314,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":441373,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4930718841320042,"acs":262545,"articleLive":2,"columnArticles":1635,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":532468,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.452266580658124,"acs":171073,"articleLive":2,"columnArticles":1143,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":378257,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5265463091550048,"acs":177444,"articleLive":2,"columnArticles":1711,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":336996,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5693203771725014,"acs":158250,"articleLive":2,"columnArticles":1310,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":277963,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3119614970382337,"acs":83421,"articleLive":2,"columnArticles":491,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":267408,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7472061916631112,"acs":199652,"articleLive":2,"columnArticles":1254,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":267198,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3397785223527354,"acs":124327,"articleLive":2,"columnArticles":760,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":365906,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7772417707150965,"acs":150645,"articleLive":2,"columnArticles":1130,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":193820,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.596693162549404,"acs":189320,"articleLive":2,"columnArticles":1461,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":317282,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37677539398381776,"acs":66823,"articleLive":2,"columnArticles":446,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":177355,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2419340139966501,"acs":76988,"articleLive":2,"columnArticles":858,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":318219,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6431694007154747,"acs":194351,"articleLive":2,"columnArticles":1636,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":302177,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7980241057874619,"acs":261795,"articleLive":2,"columnArticles":2449,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":328054,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7427670900379792,"acs":293162,"articleLive":2,"columnArticles":1830,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":394689,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7285993935138146,"acs":185728,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":254911,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4655626093732037,"acs":145790,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":313148,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.791907395265018,"acs":192032,"articleLive":2,"columnArticles":1406,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":242493,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801252493604411,"acs":150347,"articleLive":2,"columnArticles":1087,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":259163,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4400906207521522,"acs":145692,"articleLive":2,"columnArticles":1484,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":331050,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5686328743511114,"acs":141854,"articleLive":2,"columnArticles":941,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":249465,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6156990160222919,"acs":113131,"articleLive":2,"columnArticles":949,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":183744,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.644509212227991,"acs":137546,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":213412,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6866109539470396,"acs":137373,"articleLive":2,"columnArticles":1097,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":200074,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5888829518659954,"acs":120128,"articleLive":2,"columnArticles":1139,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":203993,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5513916389765944,"acs":113338,"articleLive":2,"columnArticles":952,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":205549,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5768481484035584,"acs":133838,"articleLive":2,"columnArticles":872,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":232016,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7202355608062321,"acs":120100,"articleLive":2,"columnArticles":829,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":166751,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6545940097440163,"acs":104665,"articleLive":2,"columnArticles":901,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":159893,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5612295883268764,"acs":77503,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138095,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792682703674019,"acs":158281,"articleLive":2,"columnArticles":1116,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":273243,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6912013571045159,"acs":168687,"articleLive":2,"columnArticles":1026,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":244049,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5703419955026005,"acs":248052,"articleLive":2,"columnArticles":1814,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":434918,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5814164815596717,"acs":63343,"articleLive":2,"columnArticles":461,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":108946,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054899718148768,"acs":222345,"articleLive":2,"columnArticles":1526,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":367215,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4859768892041257,"acs":49332,"articleLive":2,"columnArticles":512,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":101511,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41512626337914793,"acs":55695,"articleLive":2,"columnArticles":464,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":134164,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5611532625189681,"acs":109091,"articleLive":2,"columnArticles":806,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":194405,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5359831739142084,"acs":120027,"articleLive":2,"columnArticles":1442,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":223938,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6890453028576716,"acs":119138,"articleLive":2,"columnArticles":994,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":172903,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4645352653567025,"acs":151445,"articleLive":2,"columnArticles":1039,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":326014,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514460565118737,"acs":88140,"articleLive":2,"columnArticles":518,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":135299,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6145989028382748,"acs":153375,"articleLive":2,"columnArticles":1058,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":249553,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48291437084683236,"acs":102105,"articleLive":2,"columnArticles":848,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":211435,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6498569119674975,"acs":175308,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":269764,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5379974987125726,"acs":190138,"articleLive":2,"columnArticles":1589,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":353418,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44728194111359854,"acs":168229,"articleLive":2,"columnArticles":1473,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":376114,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7567488358461689,"acs":162673,"articleLive":2,"columnArticles":1143,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":214963,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7900103752454658,"acs":177415,"articleLive":2,"columnArticles":1269,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":224573,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5881591024112405,"acs":137134,"articleLive":2,"columnArticles":939,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":233158,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.69871822065998,"acs":115292,"articleLive":2,"columnArticles":1032,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":165005,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.800258817064199,"acs":90286,"articleLive":2,"columnArticles":698,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":112821,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6661705758622058,"acs":134284,"articleLive":2,"columnArticles":844,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":201576,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7073310540038755,"acs":139439,"articleLive":2,"columnArticles":1859,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":197134,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.441841149458936,"acs":129801,"articleLive":2,"columnArticles":978,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":293773,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.857894209577239,"acs":205524,"articleLive":2,"columnArticles":1788,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":239568,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4442579433697179,"acs":131543,"articleLive":2,"columnArticles":1190,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":296096,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4752740903015747,"acs":94590,"articleLive":2,"columnArticles":1066,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":199022,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5615429513149763,"acs":65422,"articleLive":2,"columnArticles":591,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":116504,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45969306913065927,"acs":103282,"articleLive":2,"columnArticles":982,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":224676,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6555184742324464,"acs":110192,"articleLive":2,"columnArticles":766,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":168099,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6339641844573146,"acs":130809,"articleLive":2,"columnArticles":954,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":206335,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8569101951252868,"acs":137852,"articleLive":2,"columnArticles":1299,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":160871,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5841310029402156,"acs":71521,"articleLive":2,"columnArticles":495,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":122440,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5976951197521352,"acs":72920,"articleLive":2,"columnArticles":526,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":122002,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28659708526924493,"acs":68593,"articleLive":2,"columnArticles":555,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":239336,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6941353507209574,"acs":118087,"articleLive":2,"columnArticles":690,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":170121,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7006156436790532,"acs":117330,"articleLive":2,"columnArticles":690,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":167467,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2020012353304509,"acs":8176,"articleLive":2,"columnArticles":109,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":40475,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5744196631770596,"acs":7572,"articleLive":2,"columnArticles":125,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":13182,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7828794420458319,"acs":9429,"articleLive":2,"columnArticles":143,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":12044,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6876951905059338,"acs":7707,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":11207,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7137249936692833,"acs":5637,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":7898,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6648077487525682,"acs":6795,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":10221,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4548787146088449,"acs":5832,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":12821,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5083137459737094,"acs":5839,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":11487,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5505955822828726,"acs":4761,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":8647,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.435146097177386,"acs":5257,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12081,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5657776445909499,"acs":3776,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6674,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6608396618426708,"acs":4612,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":6979,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6533497234173326,"acs":3189,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":4881,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5053008398733306,"acs":3670,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7263,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6401564537157758,"acs":2946,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4602,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4973695747479176,"acs":4538,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9124,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5192066805845511,"acs":2487,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4790,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5305770887166236,"acs":4312,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8127,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4749739311783107,"acs":3644,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":7672,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7040437585465912,"acs":3604,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5119,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5364691872581125,"acs":5406,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10077,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5225396301188904,"acs":6329,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":12112,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7036690085870414,"acs":4507,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6405,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7706923477355544,"acs":11844,"articleLive":2,"columnArticles":121,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":15368,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6041269841269842,"acs":3806,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6300,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6487865203277168,"acs":4197,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6469,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6070094800344729,"acs":6339,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":10443,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6238332296204107,"acs":2005,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3214,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2948700686683722,"acs":2190,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":7427,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5447968836950473,"acs":1958,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3594,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5598526703499079,"acs":2432,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4344,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6030042918454935,"acs":3091,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5126,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7973061760840998,"acs":2427,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3044,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5813953488372093,"acs":2225,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":3827,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6862980769230769,"acs":2284,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3328,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5824150058616647,"acs":2484,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4265,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4400386847195358,"acs":2730,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6204,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7793038124556003,"acs":3291,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4223,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5187896534895071,"acs":2126,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4098,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5703616352201258,"acs":1451,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2544,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7867095391211146,"acs":2936,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3732,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8470020675396278,"acs":2458,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2902,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6543052003410059,"acs":1535,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2346,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6457765667574932,"acs":2844,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4404,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8090497737556561,"acs":2682,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3315,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7248454187745925,"acs":2579,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3558,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.686922430691683,"acs":2453,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3571,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.674428633031479,"acs":1564,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2319,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7530864197530864,"acs":2623,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3483,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6194155189788377,"acs":1844,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":2977,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4176917037424758,"acs":1596,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3821,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.739693446088795,"acs":2799,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3784,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6348547717842323,"acs":2601,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4097,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8494117647058823,"acs":2166,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2550,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8921119592875318,"acs":1753,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1965,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7335692618806876,"acs":2902,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":3956,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.359061438715653,"acs":1163,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3239,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5938155136268344,"acs":1133,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1908,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.624283305227656,"acs":1851,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":2965,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6683400267737617,"acs":1997,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":2988,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5372065260644647,"acs":1350,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2513,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7635658914728682,"acs":1576,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2064,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.722384570426651,"acs":1236,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1711,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6336448598130842,"acs":1017,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1605,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6265697290152016,"acs":948,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1513,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6469453376205788,"acs":1006,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1555,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6543026706231454,"acs":882,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1348,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.508180755746007,"acs":2609,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5134,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7279329608938547,"acs":2606,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3580,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6696173615077099,"acs":2345,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3502,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5010482180293501,"acs":956,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1908,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4206276858966011,"acs":3230,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":7679,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5439798125450613,"acs":1509,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2774,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5495,"acs":2198,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4000,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7117403754374801,"acs":2237,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3143,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6718007537276749,"acs":4100,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6103,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.585031847133758,"acs":3674,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6280,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6337183474011551,"acs":2853,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4502,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8533077660594439,"acs":2670,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3129,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8063479308959421,"acs":2007,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2489,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7822482321385028,"acs":3208,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4101,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.640245529757139,"acs":2399,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3747,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.856020942408377,"acs":2943,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3438,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6768345323741007,"acs":2352,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3475,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8566822977725674,"acs":2923,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3412,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.764825345247766,"acs":1883,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2462,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6391376451077944,"acs":1927,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3015,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7413618912911699,"acs":3669,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":4949,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.626155138616634,"acs":2236,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3571,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5210343496719413,"acs":1350,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2591,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7650780261493041,"acs":1814,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2371,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6779904306220096,"acs":1417,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2090,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5744283714419038,"acs":1231,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2143,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5905649388468258,"acs":1014,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1717,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6636251541307029,"acs":5382,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8110,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4990448901623687,"acs":1045,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2094,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5410144020037571,"acs":864,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1597,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7768805779855503,"acs":1828,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2353,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.692071468453378,"acs":2479,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3582,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7349857006673022,"acs":1542,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2098,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48183603338242514,"acs":1963,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4074,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5936329588014981,"acs":1268,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2136,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49586943381019544,"acs":2461,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":4963,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5824175824175825,"acs":1060,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1820,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6985244040862656,"acs":3077,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4405,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5532837670384139,"acs":893,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1614,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5406046235921754,"acs":912,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1687,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5622406639004149,"acs":542,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":964,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6093845216331505,"acs":1000,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1641,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8382687927107062,"acs":1472,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1756,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6912751677852349,"acs":515,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":745,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5603070175438597,"acs":1022,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1824,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5872747747747747,"acs":1043,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1776,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.42294220665499127,"acs":483,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1142,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2878495660559306,"acs":597,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2074,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.637270621770889,"acs":3577,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5613,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6320346320346321,"acs":584,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":924,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6957695769576958,"acs":773,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1111,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4594775619557937,"acs":2744,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":5972,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7198537288668014,"acs":89372,"articleLive":2,"columnArticles":1536,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":124153,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6478339350180505,"acs":57424,"articleLive":2,"columnArticles":1106,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":88640,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5792206767806904,"acs":44059,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76066,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510676790658151,"acs":40207,"articleLive":2,"columnArticles":774,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":72962,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3323537600148483,"acs":32232,"articleLive":2,"columnArticles":555,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":96981,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47192891760904687,"acs":73031,"articleLive":2,"columnArticles":1172,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":154750,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7538479302580683,"acs":65287,"articleLive":2,"columnArticles":958,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":86605,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6212628865979382,"acs":43389,"articleLive":2,"columnArticles":487,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":69840,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5502457581470509,"acs":32689,"articleLive":2,"columnArticles":414,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":59408,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.682814339565579,"acs":63217,"articleLive":2,"columnArticles":690,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":92583,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7799937563037318,"acs":64961,"articleLive":2,"columnArticles":945,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83284,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8547150630867667,"acs":71467,"articleLive":2,"columnArticles":681,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83615,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6554602184087364,"acs":25209,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38460,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46675808827263954,"acs":36760,"articleLive":2,"columnArticles":522,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78756,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4834146099957918,"acs":39057,"articleLive":2,"columnArticles":505,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":80794,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6849332759362893,"acs":47733,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":69690,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5319885741117546,"acs":27191,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51112,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5378572130020622,"acs":10954,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20366,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6136352823635758,"acs":25796,"articleLive":2,"columnArticles":294,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42038,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3866672895449874,"acs":8277,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21406,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7123853211009175,"acs":23295,"articleLive":2,"columnArticles":342,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32700,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5431615404886496,"acs":14428,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26563,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5877049180327869,"acs":10755,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18300,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5317698391055359,"acs":17550,"articleLive":2,"columnArticles":244,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33003,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7902760609806345,"acs":34524,"articleLive":2,"columnArticles":421,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43686,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8061811938188062,"acs":23946,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29703,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5845057943792749,"acs":32986,"articleLive":2,"columnArticles":384,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56434,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3516462215822557,"acs":25398,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72226,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5904523353469869,"acs":20037,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33935,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7167809548453875,"acs":16620,"articleLive":2,"columnArticles":176,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23187,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47641915137614677,"acs":6647,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13952,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7167507300238917,"acs":16200,"articleLive":2,"columnArticles":252,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22602,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48626419274439214,"acs":17559,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36110,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5054797464274202,"acs":9409,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18614,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6901294498381877,"acs":7677,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11124,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38680257510729615,"acs":10815,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":27960,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38649362076550814,"acs":5271,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13638,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5271793473320607,"acs":11599,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22002,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7036050545094152,"acs":11359,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16144,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5528544542032622,"acs":3525,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6376,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36320995641514575,"acs":42667,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117472,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3608971521322119,"acs":12229,"articleLive":2,"columnArticles":197,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33885,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6758164487733737,"acs":51900,"articleLive":2,"columnArticles":433,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76796,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8202233933768583,"acs":20855,"articleLive":2,"columnArticles":327,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25426,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6788754515470394,"acs":21612,"articleLive":2,"columnArticles":478,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31835,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6565956744262836,"acs":23862,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36342,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8128196385952949,"acs":21456,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26397,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.718467780637843,"acs":16468,"articleLive":2,"columnArticles":237,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22921,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.813454287527532,"acs":21790,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26787,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5587934351082552,"acs":13653,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24433,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49463787491281097,"acs":34039,"articleLive":2,"columnArticles":326,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68816,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7603588015663418,"acs":16699,"articleLive":2,"columnArticles":296,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21962,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013948025253266,"acs":6830,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13622,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5339233038348082,"acs":4163,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7797,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5548040541865161,"acs":56600,"articleLive":2,"columnArticles":2373,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102018,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7398070272808778,"acs":34657,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46846,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39584021129085506,"acs":13189,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33319,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.55316108380016,"acs":19354,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":34988,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45505578555890813,"acs":12970,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28502,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6240520043336945,"acs":4608,"articleLive":2,"columnArticles":84,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7384,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6667822168298813,"acs":7694,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11539,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.831819821001213,"acs":25373,"articleLive":2,"columnArticles":402,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30503,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7657741801577418,"acs":14758,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19272,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4424701158443716,"acs":9587,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21667,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46030729833546735,"acs":7190,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15620,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4642995314447836,"acs":10801,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23263,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4240908789825793,"acs":12805,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30194,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329940881538577,"acs":19590,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26726,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3729615133724723,"acs":2287,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6132,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5485424588086185,"acs":2164,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3945,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6818061790335358,"acs":10328,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15148,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409183280193406,"acs":50337,"articleLive":2,"columnArticles":581,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114164,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43041293423639937,"acs":1970,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4577,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.548698315467075,"acs":3583,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6530,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5033730604902181,"acs":8954,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17788,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4534146415460696,"acs":14945,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32961,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6003684201379837,"acs":34547,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57543,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.343870382959438,"acs":15175,"articleLive":2,"columnArticles":313,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44130,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6116700201207244,"acs":20368,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33299,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7213462952373172,"acs":8830,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12241,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4648072429906542,"acs":9549,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20544,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5836184773310522,"acs":2729,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4676,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4716981132075472,"acs":10800,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22896,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5455089104174142,"acs":31927,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58527,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38786076520723256,"acs":14608,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37663,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5968267873655522,"acs":12263,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20547,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6440284262091488,"acs":28003,"articleLive":2,"columnArticles":453,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":43481,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3875123885034688,"acs":5474,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14126,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45009633911368013,"acs":4672,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10380,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4119202795881742,"acs":8722,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21174,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27157991106460894,"acs":8306,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30584,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5488433885589247,"acs":14046,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25592,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5706005377950404,"acs":66843,"articleLive":2,"columnArticles":927,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117145,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6867951463240543,"acs":14433,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21015,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6315725635271999,"acs":20828,"articleLive":2,"columnArticles":289,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":32978,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5527191011235955,"acs":24596,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44500,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5971543769868962,"acs":77015,"articleLive":2,"columnArticles":760,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":128970,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4024867761214536,"acs":5859,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14557,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184807545245985,"acs":61020,"articleLive":2,"columnArticles":1138,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117690,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4451291244188001,"acs":7946,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17851,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44537398525128585,"acs":7187,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16137,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5789614740368509,"acs":8641,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14925,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5706577220358757,"acs":3913,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6857,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359950138266015,"acs":44388,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69793,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3752070327430246,"acs":8835,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23547,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3787511493772465,"acs":4531,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11963,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5244562590623489,"acs":10851,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20690,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5038486209108403,"acs":1571,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3118,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3415576694411415,"acs":3447,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10092,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.21318096385887889,"acs":118868,"articleLive":2,"columnArticles":961,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":557592,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.5208388358256746,"acs":2563575,"articleLive":2,"columnArticles":14399,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4922012,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4092251336598347,"acs":1021074,"articleLive":2,"columnArticles":7254,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2495140,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38103160096924754,"acs":1267265,"articleLive":2,"columnArticles":7565,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3325879,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.408848037284457,"acs":524070,"articleLive":2,"columnArticles":3892,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1281821,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35538862037522617,"acs":752212,"articleLive":2,"columnArticles":4067,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2116590,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5072840149444351,"acs":308625,"articleLive":2,"columnArticles":2504,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":608387,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35246209056775984,"acs":849557,"articleLive":2,"columnArticles":5347,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2410350,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21719673866836137,"acs":353047,"articleLive":2,"columnArticles":2715,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1625471,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5837205141204187,"acs":782956,"articleLive":2,"columnArticles":4983,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1341320,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3160573956132484,"acs":207931,"articleLive":2,"columnArticles":1252,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":657890,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.627287329025607,"acs":545198,"articleLive":2,"columnArticles":3094,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":869136,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.664815659291499,"acs":230344,"articleLive":2,"columnArticles":1799,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":346478,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6319294035005562,"acs":474991,"articleLive":2,"columnArticles":3935,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":751652,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4100755286423077,"acs":634263,"articleLive":2,"columnArticles":3955,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1546698,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3366705306665877,"acs":670611,"articleLive":2,"columnArticles":3164,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1991891,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4590473711608537,"acs":264549,"articleLive":2,"columnArticles":1453,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":576300,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5731372926088514,"acs":345721,"articleLive":2,"columnArticles":3115,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":603208,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3985967694546021,"acs":225200,"articleLive":2,"columnArticles":1546,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":564982,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4297038550429128,"acs":528959,"articleLive":2,"columnArticles":3952,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1230985,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44505630193975465,"acs":796568,"articleLive":2,"columnArticles":5646,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1789814,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6674919654822818,"acs":728179,"articleLive":2,"columnArticles":3528,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1090918,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.772772870157779,"acs":357443,"articleLive":2,"columnArticles":2683,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":462546,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5599397325802158,"acs":331500,"articleLive":2,"columnArticles":2136,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":592028,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7031892048942356,"acs":321894,"articleLive":2,"columnArticles":2552,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":457763,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6577211697008446,"acs":234546,"articleLive":2,"columnArticles":2229,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":356604,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5389559442026803,"acs":827057,"articleLive":2,"columnArticles":4602,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1534554,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5970949426876893,"acs":490492,"articleLive":2,"columnArticles":4149,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":821464,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4056846819951332,"acs":476972,"articleLive":2,"columnArticles":3273,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1175721,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.35893215985662763,"acs":80913,"articleLive":2,"columnArticles":602,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":225427,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37313987397758047,"acs":218929,"articleLive":2,"columnArticles":1766,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":586721,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3567568261937925,"acs":194405,"articleLive":2,"columnArticles":1311,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":544923,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4277994696079871,"acs":372959,"articleLive":2,"columnArticles":2459,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":871808,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42350372820677185,"acs":350155,"articleLive":2,"columnArticles":3355,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":826805,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46302275911575835,"acs":521816,"articleLive":2,"columnArticles":4009,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1126977,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6402173374919551,"acs":206908,"articleLive":2,"columnArticles":1465,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":323184,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707056447659941,"acs":102624,"articleLive":2,"columnArticles":868,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":153009,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5804230044599614,"acs":218116,"articleLive":2,"columnArticles":2291,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":375788,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277578404703218,"acs":341905,"articleLive":2,"columnArticles":1993,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":469806,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.622328204095457,"acs":203955,"articleLive":2,"columnArticles":1418,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":327729,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4197507689920385,"acs":167711,"articleLive":2,"columnArticles":1433,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":399549,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5819914413797703,"acs":331571,"articleLive":2,"columnArticles":2473,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":569718,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44900910273081923,"acs":172644,"articleLive":2,"columnArticles":1165,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":384500,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3283809231005726,"acs":85448,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":260210,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.43026782042281314,"acs":207149,"articleLive":2,"columnArticles":1657,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":481442,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7831395359435068,"acs":429628,"articleLive":2,"columnArticles":2747,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":548597,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6380782390544104,"acs":219497,"articleLive":2,"columnArticles":1511,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":343997,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352877159128195,"acs":226337,"articleLive":2,"columnArticles":1905,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":307821,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6653080446495148,"acs":237338,"articleLive":2,"columnArticles":1344,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":356734,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3763049329502735,"acs":219919,"articleLive":2,"columnArticles":1303,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":584417,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7388243659634984,"acs":155855,"articleLive":2,"columnArticles":1559,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":210950,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.822684813343749,"acs":74773,"articleLive":2,"columnArticles":616,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90889,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5527487232273645,"acs":698094,"articleLive":2,"columnArticles":3849,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1262950,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48149001786237705,"acs":192193,"articleLive":2,"columnArticles":2028,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":399163,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43274485735060714,"acs":332091,"articleLive":2,"columnArticles":2545,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":767406,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4697537346399414,"acs":307319,"articleLive":2,"columnArticles":2357,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":654213,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4113969014203784,"acs":87442,"articleLive":2,"columnArticles":937,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":212549,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37668432733230106,"acs":251540,"articleLive":2,"columnArticles":2703,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":667774,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7898142439429363,"acs":129385,"articleLive":2,"columnArticles":1598,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":163817,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5243961519828362,"acs":90924,"articleLive":2,"columnArticles":965,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173388,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41762172253290025,"acs":199543,"articleLive":2,"columnArticles":2030,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":477808,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6623431326981176,"acs":319207,"articleLive":2,"columnArticles":2462,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":481936,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3920361883473691,"acs":184858,"articleLive":2,"columnArticles":1743,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":471533,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6882842498304496,"acs":272999,"articleLive":2,"columnArticles":2110,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":396637,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26958735091696573,"acs":46496,"articleLive":2,"columnArticles":644,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":172471,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45731636680044585,"acs":355290,"articleLive":2,"columnArticles":3211,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":776902,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5428585602742859,"acs":196967,"articleLive":2,"columnArticles":1800,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":362833,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5242959690778576,"acs":37980,"articleLive":2,"columnArticles":576,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72440,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.391981971556719,"acs":392929,"articleLive":2,"columnArticles":1975,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1002416,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5302548608176656,"acs":584764,"articleLive":2,"columnArticles":3644,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1102798,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42157271477358405,"acs":95052,"articleLive":2,"columnArticles":836,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":225470,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142790563787645,"acs":179254,"articleLive":2,"columnArticles":1252,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":291812,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6045861197267691,"acs":134888,"articleLive":2,"columnArticles":992,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":223108,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4613325393568254,"acs":171988,"articleLive":2,"columnArticles":1725,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":372807,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5964194050207637,"acs":273741,"articleLive":2,"columnArticles":1892,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":458974,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42716847972567434,"acs":188603,"articleLive":2,"columnArticles":1286,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":441519,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7699927361438518,"acs":224727,"articleLive":2,"columnArticles":1323,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":291856,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015950381081778,"acs":317414,"articleLive":2,"columnArticles":2076,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":395978,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45865168494107184,"acs":227932,"articleLive":2,"columnArticles":1437,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":496961,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6167971536117879,"acs":149606,"articleLive":2,"columnArticles":1338,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":242553,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4148180689144911,"acs":125587,"articleLive":2,"columnArticles":1002,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":302752,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5308257097088691,"acs":184575,"articleLive":2,"columnArticles":1707,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":347713,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.538555544023062,"acs":321704,"articleLive":2,"columnArticles":1970,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":597346,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43353542813870216,"acs":185489,"articleLive":2,"columnArticles":1172,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":427852,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5159853317823554,"acs":98918,"articleLive":2,"columnArticles":698,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":191707,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6326085706369163,"acs":121006,"articleLive":2,"columnArticles":1115,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":191281,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4870663632563972,"acs":41952,"articleLive":2,"columnArticles":313,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86132,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5173994896587011,"acs":473256,"articleLive":2,"columnArticles":3308,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":914682,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7100733583825372,"acs":59529,"articleLive":2,"columnArticles":484,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":83835,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6336834113627736,"acs":140224,"articleLive":2,"columnArticles":1234,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":221284,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3095164266981478,"acs":165699,"articleLive":2,"columnArticles":1536,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":535348,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5489055599188095,"acs":215261,"articleLive":2,"columnArticles":2053,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":392164,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5408925606082142,"acs":156021,"articleLive":2,"columnArticles":1350,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":288451,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7557454517645755,"acs":573177,"articleLive":2,"columnArticles":2348,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":758426,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.702441385987966,"acs":101566,"articleLive":2,"columnArticles":635,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":144590,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.699626503071632,"acs":165589,"articleLive":2,"columnArticles":1309,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":236682,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4558929941892336,"acs":62373,"articleLive":2,"columnArticles":550,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":136815,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35031092069962355,"acs":353724,"articleLive":2,"columnArticles":1962,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1009743,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6115213057141892,"acs":72387,"articleLive":2,"columnArticles":595,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":118372,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6020445513490902,"acs":253297,"articleLive":2,"columnArticles":1904,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":420728,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5639435715018272,"acs":417907,"articleLive":2,"columnArticles":2292,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":741044,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420849359483772,"acs":403987,"articleLive":2,"columnArticles":2540,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":629180,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718605864754749,"acs":176431,"articleLive":2,"columnArticles":1605,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":308521,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661914287055069,"acs":522469,"articleLive":2,"columnArticles":2587,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":681904,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7047355236804079,"acs":252635,"articleLive":2,"columnArticles":1451,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":358482,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7217279388204131,"acs":135145,"articleLive":2,"columnArticles":897,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":187252,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6974867780833509,"acs":164851,"articleLive":2,"columnArticles":1321,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":236350,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7603493682179795,"acs":194305,"articleLive":2,"columnArticles":1203,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":255547,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7630374379647624,"acs":95018,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124526,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5636201318751801,"acs":260109,"articleLive":2,"columnArticles":1486,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":461497,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48653591629808823,"acs":275337,"articleLive":2,"columnArticles":1813,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":565913,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5263323933258184,"acs":273616,"articleLive":2,"columnArticles":1715,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":519854,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6276840596488327,"acs":182174,"articleLive":2,"columnArticles":1282,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":290232,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.726093624832439,"acs":180374,"articleLive":2,"columnArticles":1355,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":248417,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.522111019138636,"acs":62445,"articleLive":2,"columnArticles":686,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":119601,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7046082044795324,"acs":161542,"articleLive":2,"columnArticles":1235,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":229265,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6147086902152721,"acs":91433,"articleLive":2,"columnArticles":778,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":148742,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7310700610197056,"acs":219370,"articleLive":2,"columnArticles":1769,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":300067,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6676759582198829,"acs":146639,"articleLive":2,"columnArticles":1222,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":219626,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6815867987494028,"acs":181161,"articleLive":2,"columnArticles":1597,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":265793,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5734746505336994,"acs":571971,"articleLive":2,"columnArticles":3435,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":997378,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6896413844808197,"acs":469132,"articleLive":2,"columnArticles":2678,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":680255,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5368804852865255,"acs":133112,"articleLive":2,"columnArticles":827,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":247936,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4449437894159583,"acs":162271,"articleLive":2,"columnArticles":1105,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":364700,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47292957718032697,"acs":280993,"articleLive":2,"columnArticles":1854,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":594154,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39605874894336435,"acs":37483,"articleLive":2,"columnArticles":330,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94640,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46856540878136876,"acs":124540,"articleLive":2,"columnArticles":659,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":265790,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5432404308574964,"acs":173844,"articleLive":2,"columnArticles":1133,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":320013,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6826108786610878,"acs":122358,"articleLive":2,"columnArticles":1129,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":179250,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.445310531298313,"acs":130769,"articleLive":2,"columnArticles":1188,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":293658,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7229338920074418,"acs":135613,"articleLive":2,"columnArticles":883,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":187587,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49232317650773605,"acs":49894,"articleLive":2,"columnArticles":442,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101344,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6760743417846075,"acs":73517,"articleLive":2,"columnArticles":529,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":108741,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5762139351239745,"acs":127258,"articleLive":2,"columnArticles":983,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":220852,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48603489347748513,"acs":100791,"articleLive":2,"columnArticles":807,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":207374,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192382743356566,"acs":507916,"articleLive":2,"columnArticles":2301,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":706186,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197507504516937,"acs":101184,"articleLive":2,"columnArticles":760,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":140582,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6615018225436421,"acs":113605,"articleLive":2,"columnArticles":860,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":171738,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5158303964527363,"acs":197301,"articleLive":2,"columnArticles":1224,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":382492,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4904606072760089,"acs":53805,"articleLive":2,"columnArticles":547,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109703,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5124914909720999,"acs":538298,"articleLive":2,"columnArticles":2773,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1050355,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5529149205337903,"acs":302006,"articleLive":2,"columnArticles":1763,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":546207,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.621267840575321,"acs":129238,"articleLive":2,"columnArticles":1092,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":208023,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7038631858843004,"acs":420093,"articleLive":2,"columnArticles":1868,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":596839,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.750637830199788,"acs":305984,"articleLive":2,"columnArticles":1573,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":407632,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5260454911397556,"acs":237842,"articleLive":2,"columnArticles":1400,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":452132,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6818252492817306,"acs":100859,"articleLive":2,"columnArticles":790,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":147925,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671540965986139,"acs":213520,"articleLive":2,"columnArticles":1260,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":320046,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3417442465595004,"acs":47281,"articleLive":2,"columnArticles":517,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138352,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5354563335642674,"acs":134482,"articleLive":2,"columnArticles":1060,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":251154,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48409647370050374,"acs":172014,"articleLive":2,"columnArticles":1438,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":355330,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42143572485474035,"acs":186841,"articleLive":2,"columnArticles":1254,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":443344,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5669202114844418,"acs":214132,"articleLive":2,"columnArticles":1518,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":377711,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5316413867570197,"acs":114229,"articleLive":2,"columnArticles":900,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":214861,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5734799311689259,"acs":290943,"articleLive":2,"columnArticles":1615,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":507329,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7244775139511982,"acs":6621,"articleLive":2,"columnArticles":115,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9139,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5333333333333333,"acs":5560,"articleLive":2,"columnArticles":82,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10425,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5919048612559983,"acs":2837,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4793,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5470744862429167,"acs":16026,"articleLive":2,"columnArticles":193,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29294,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6145727319316024,"acs":340579,"articleLive":2,"columnArticles":1993,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":554172,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3363464829523016,"acs":7665,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22789,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49722855414250183,"acs":162726,"articleLive":2,"columnArticles":1103,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":327266,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3263489838822705,"acs":9314,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28540,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6099156940370454,"acs":59468,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97502,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192276576236449,"acs":86643,"articleLive":2,"columnArticles":926,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":166869,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3310107307428608,"acs":41520,"articleLive":2,"columnArticles":377,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":125434,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5867750028082526,"acs":297749,"articleLive":2,"columnArticles":1955,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":507433,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325334011960809,"acs":84982,"articleLive":2,"columnArticles":759,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":196475,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6647563206736173,"acs":392054,"articleLive":2,"columnArticles":2214,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":589771,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41868295733320504,"acs":8704,"articleLive":2,"columnArticles":88,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20789,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7181573799289355,"acs":107929,"articleLive":2,"columnArticles":920,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":150286,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.44013886957480786,"acs":91787,"articleLive":2,"columnArticles":597,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":208541,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8046317218845146,"acs":75847,"articleLive":2,"columnArticles":634,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94263,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4806113395233751,"acs":38459,"articleLive":2,"columnArticles":409,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":80021,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7395100818133079,"acs":307597,"articleLive":2,"columnArticles":1475,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":415947,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35586956916581325,"acs":254714,"articleLive":2,"columnArticles":1023,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":715751,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46296243414195354,"acs":129698,"articleLive":2,"columnArticles":501,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":280148,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6034958739684921,"acs":120669,"articleLive":2,"columnArticles":675,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":199950,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096241577941487,"acs":122383,"articleLive":2,"columnArticles":971,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":298769,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.486859381033817,"acs":88253,"articleLive":2,"columnArticles":515,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":181270,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7017473141092008,"acs":165385,"articleLive":2,"columnArticles":680,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":235676,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7966728683656707,"acs":182842,"articleLive":2,"columnArticles":592,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":229507,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6768268767938959,"acs":151861,"articleLive":2,"columnArticles":546,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":224372,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47701167960561175,"acs":103533,"articleLive":2,"columnArticles":678,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":217045,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4966336853345167,"acs":71626,"articleLive":2,"columnArticles":633,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":144223,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7567114093959731,"acs":7667,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10132,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5212064290153099,"acs":73807,"articleLive":2,"columnArticles":543,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":141608,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3926733469012094,"acs":90876,"articleLive":2,"columnArticles":702,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":231429,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45023112321756537,"acs":349084,"articleLive":2,"columnArticles":1737,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":775344,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6986254709713933,"acs":133318,"articleLive":2,"columnArticles":837,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":190829,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7492915972535771,"acs":192505,"articleLive":2,"columnArticles":1214,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":256916,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3562300319488818,"acs":21854,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61348,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32510385020770044,"acs":26218,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80645,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3450058362514591,"acs":10345,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29985,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4363833705289089,"acs":35783,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":81999,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.665288988507832,"acs":102698,"articleLive":2,"columnArticles":394,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":154366,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5337748863897435,"acs":95258,"articleLive":2,"columnArticles":508,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":178461,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5158842415147221,"acs":394637,"articleLive":2,"columnArticles":2717,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":764972,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6525231598220816,"acs":143621,"articleLive":2,"columnArticles":1604,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":220101,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.557533802055165,"acs":335036,"articleLive":2,"columnArticles":2142,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":600925,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5244712041884817,"acs":50087,"articleLive":2,"columnArticles":327,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95500,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6193951395139514,"acs":172037,"articleLive":2,"columnArticles":1400,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":277750,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5165255031538385,"acs":236985,"articleLive":2,"columnArticles":1682,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":458806,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37786732658311084,"acs":170100,"articleLive":2,"columnArticles":737,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":450158,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5007237025669643,"acs":114854,"articleLive":2,"columnArticles":884,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":229376,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7233606885668742,"acs":722429,"articleLive":2,"columnArticles":7408,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":998712,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5432104348743692,"acs":144136,"articleLive":2,"columnArticles":948,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":265341,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167121863676259,"acs":146167,"articleLive":2,"columnArticles":989,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":203941,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47310571184589034,"acs":198342,"articleLive":2,"columnArticles":1407,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":419234,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.542586071870535,"acs":90760,"articleLive":2,"columnArticles":680,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":167273,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4827298869354944,"acs":29545,"articleLive":2,"columnArticles":328,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61204,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4628048237146167,"acs":62325,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":134668,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4332454894561712,"acs":169003,"articleLive":2,"columnArticles":1552,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":390086,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37159962937445057,"acs":31282,"articleLive":2,"columnArticles":307,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84182,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.646274659362757,"acs":447372,"articleLive":2,"columnArticles":2328,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":692232,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7368233462808594,"acs":101297,"articleLive":2,"columnArticles":1045,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":137478,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5578641034476072,"acs":373996,"articleLive":2,"columnArticles":1745,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":670407,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5421862154014798,"acs":31655,"articleLive":2,"columnArticles":281,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58384,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4248855234055791,"acs":111996,"articleLive":2,"columnArticles":900,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":263591,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28654475151290437,"acs":64917,"articleLive":2,"columnArticles":424,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":226551,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47696996493264976,"acs":141320,"articleLive":2,"columnArticles":1006,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":296287,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7819256040695209,"acs":118052,"articleLive":2,"columnArticles":887,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":150976,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5232128392061564,"acs":41338,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":79008,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4178934327542183,"acs":71848,"articleLive":2,"columnArticles":660,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":171929,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6752804230719991,"acs":137140,"articleLive":2,"columnArticles":4761,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":203086,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7879761953163116,"acs":310097,"articleLive":2,"columnArticles":1880,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":393536,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43754297731801456,"acs":87173,"articleLive":2,"columnArticles":704,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":199233,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5798904026946861,"acs":57673,"articleLive":2,"columnArticles":650,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99455,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4644393193293025,"acs":37255,"articleLive":2,"columnArticles":319,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80215,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7419610134381474,"acs":139689,"articleLive":2,"columnArticles":882,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":188270,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5045027111342197,"acs":169803,"articleLive":2,"columnArticles":1226,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":336575,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6909483328570271,"acs":161988,"articleLive":2,"columnArticles":1283,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":234443,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4771152707188408,"acs":34640,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72603,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49709311956784114,"acs":315078,"articleLive":2,"columnArticles":2017,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":633841,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.666025841469111,"acs":172528,"articleLive":2,"columnArticles":988,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":259041,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6809015914257875,"acs":262062,"articleLive":2,"columnArticles":1410,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":384875,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481662768548212,"acs":211056,"articleLive":2,"columnArticles":1018,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":248838,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7233999804231687,"acs":140417,"articleLive":2,"columnArticles":883,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":194107,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4969244299360555,"acs":196067,"articleLive":2,"columnArticles":1340,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":394561,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.478523201091027,"acs":171229,"articleLive":2,"columnArticles":774,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":357828,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7381616240753969,"acs":32034,"articleLive":2,"columnArticles":288,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43397,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.645755264973839,"acs":295712,"articleLive":2,"columnArticles":1713,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":457932,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6565233370084528,"acs":8932,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13605,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5514729861941515,"acs":5073,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9199,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.601019143368682,"acs":4364,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7261,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4756853785900783,"acs":5830,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12256,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5243926922304758,"acs":5224,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9962,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46416083916083917,"acs":2655,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5720,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6376637554585153,"acs":5841,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9160,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6349295774647887,"acs":4508,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7100,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.54386225322844,"acs":3664,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6737,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5644592839918382,"acs":12172,"articleLive":2,"columnArticles":158,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21564,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5011042300505012,"acs":32447,"articleLive":2,"columnArticles":349,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":64751,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5701129262142309,"acs":5200,"articleLive":2,"columnArticles":77,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9121,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47508606631636163,"acs":5244,"articleLive":2,"columnArticles":61,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11038,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.640968565068679,"acs":11806,"articleLive":2,"columnArticles":187,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18419,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6828636507853825,"acs":144201,"articleLive":2,"columnArticles":1071,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":211171,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.692184449444498,"acs":79062,"articleLive":2,"columnArticles":656,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114221,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5656997939451577,"acs":7138,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12618,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7231867708562624,"acs":52567,"articleLive":2,"columnArticles":449,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72688,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49407091871977893,"acs":8583,"articleLive":2,"columnArticles":118,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17372,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43444493149453195,"acs":38653,"articleLive":2,"columnArticles":376,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":88971,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152411927764673,"acs":107249,"articleLive":2,"columnArticles":838,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":208153,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.580042511633251,"acs":100968,"articleLive":2,"columnArticles":615,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":174070,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5895133008296981,"acs":6892,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11691,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6742492267784097,"acs":6758,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10023,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44742990654205606,"acs":3447,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7704,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6257598582550511,"acs":153278,"articleLive":2,"columnArticles":1109,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":244947,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3385495982775823,"acs":6447,"articleLive":2,"columnArticles":108,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19043,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5538280197575214,"acs":9867,"articleLive":2,"columnArticles":139,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17816,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5536382536382536,"acs":2663,"articleLive":2,"columnArticles":46,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4810,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6477060798209623,"acs":3473,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5362,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3672648596989567,"acs":27669,"articleLive":2,"columnArticles":340,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":75338,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44000326290888325,"acs":53940,"articleLive":2,"columnArticles":564,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122590,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46211298207495927,"acs":51045,"articleLive":2,"columnArticles":418,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110460,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4920821519950211,"acs":7116,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14461,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5700806574341805,"acs":7492,"articleLive":2,"columnArticles":85,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13142,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45330910440531075,"acs":188092,"articleLive":2,"columnArticles":1068,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":414931,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6322779761043057,"acs":205276,"articleLive":2,"columnArticles":1207,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":324661,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6850460494425594,"acs":5653,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8252,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7586713697824808,"acs":2581,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3402,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.391773079338497,"acs":7486,"articleLive":2,"columnArticles":81,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":19108,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6390294157169641,"acs":499328,"articleLive":2,"columnArticles":3411,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":781385,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7711943647924199,"acs":24743,"articleLive":2,"columnArticles":207,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32084,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6348469347603684,"acs":8067,"articleLive":2,"columnArticles":103,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12707,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5096212986556542,"acs":11600,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22762,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6594846783437863,"acs":180650,"articleLive":2,"columnArticles":1232,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":273926,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4320972495088409,"acs":3519,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8144,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533332390741867,"acs":53281,"articleLive":2,"columnArticles":831,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70727,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4565660439379828,"acs":83337,"articleLive":2,"columnArticles":1109,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":182530,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5315635451505016,"acs":2543,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4784,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7083123084686104,"acs":115105,"articleLive":2,"columnArticles":767,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162506,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7117259174311926,"acs":4965,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6976,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5811284666879184,"acs":3646,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6274,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5232698590270516,"acs":64549,"articleLive":2,"columnArticles":505,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123357,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6203542030431529,"acs":2487,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4009,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5604982393994982,"acs":106331,"articleLive":2,"columnArticles":762,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":189708,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5773448436770882,"acs":4949,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8572,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5045627376425855,"acs":30521,"articleLive":2,"columnArticles":362,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60490,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5167496841012681,"acs":366421,"articleLive":2,"columnArticles":2031,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":709088,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5237782057907017,"acs":33449,"articleLive":2,"columnArticles":235,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":63861,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6556527372853903,"acs":2024,"articleLive":2,"columnArticles":39,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3087,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7264936241104223,"acs":129953,"articleLive":2,"columnArticles":797,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":178877,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5470849323065564,"acs":63725,"articleLive":2,"columnArticles":568,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116481,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3836077181802089,"acs":4334,"articleLive":2,"columnArticles":65,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11298,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33741234430560796,"acs":16985,"articleLive":2,"columnArticles":252,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50339,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5398436274839259,"acs":24097,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44637,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6104525862068966,"acs":2266,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3712,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6086568724946433,"acs":118738,"articleLive":2,"columnArticles":945,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":195082,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3794065956786933,"acs":22020,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":58038,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7611146564560731,"acs":3578,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4701,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6831192925812591,"acs":56703,"articleLive":2,"columnArticles":383,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":83006,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6292611018979178,"acs":40980,"articleLive":2,"columnArticles":355,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65124,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5463281528057895,"acs":4605,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8429,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.418167580266249,"acs":50730,"articleLive":2,"columnArticles":481,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121315,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4763502862067274,"acs":67989,"articleLive":2,"columnArticles":538,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":142729,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48338572070049396,"acs":4306,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8908,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6852894568259214,"acs":20325,"articleLive":2,"columnArticles":180,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29659,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.51848198874717,"acs":23130,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44611,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6771402550091075,"acs":2974,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4392,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42436654600876356,"acs":26730,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62988,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4449372692133279,"acs":309069,"articleLive":2,"columnArticles":1832,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":694635,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6320711152158854,"acs":10950,"articleLive":2,"columnArticles":150,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17324,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784261583943666,"acs":25473,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67313,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.537479241825574,"acs":9386,"articleLive":2,"columnArticles":104,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17463,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044711264425675,"acs":136297,"articleLive":2,"columnArticles":581,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":270178,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4210293492131008,"acs":24746,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58775,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6559193572836137,"acs":129813,"articleLive":2,"columnArticles":1072,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":197910,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4860505442433815,"acs":56621,"articleLive":2,"columnArticles":493,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":116492,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5339092751013057,"acs":18973,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35536,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47994295262726566,"acs":45094,"articleLive":2,"columnArticles":506,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93957,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4496962879640045,"acs":39978,"articleLive":2,"columnArticles":330,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":88900,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4694138473642801,"acs":4773,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10168,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.412091062245861,"acs":46720,"articleLive":2,"columnArticles":309,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":113373,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3700595889578013,"acs":3043,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8223,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40137651968134114,"acs":22219,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55357,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6079193478401359,"acs":131696,"articleLive":2,"columnArticles":929,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":216634,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869789501992519,"acs":160949,"articleLive":2,"columnArticles":1384,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":204515,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8092048401037165,"acs":3745,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4628,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4947407652807686,"acs":11947,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24148,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7273696025916085,"acs":51193,"articleLive":2,"columnArticles":489,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70381,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5162168853676653,"acs":87570,"articleLive":2,"columnArticles":772,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":169638,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6061407087106687,"acs":111442,"articleLive":2,"columnArticles":1057,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":183855,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7691634628679209,"acs":372722,"articleLive":2,"columnArticles":1962,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":484581,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5393107135431621,"acs":108944,"articleLive":2,"columnArticles":1034,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":202006,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7060502283105022,"acs":12370,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17520,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223933054393306,"acs":204534,"articleLive":2,"columnArticles":1508,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":328625,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5997807017543859,"acs":4923,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8208,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7389192865418331,"acs":216210,"articleLive":2,"columnArticles":1527,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":292603,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5503954723430974,"acs":252462,"articleLive":2,"columnArticles":1413,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":458692,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5900505161432023,"acs":5373,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9106,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6800198150594452,"acs":20591,"articleLive":2,"columnArticles":341,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":30280,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4267564966313763,"acs":2217,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5195,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45394520706781155,"acs":70470,"articleLive":2,"columnArticles":545,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155239,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4074356821131384,"acs":26685,"articleLive":2,"columnArticles":439,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65495,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3529929577464789,"acs":1604,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4544,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.520653177734867,"acs":24806,"articleLive":2,"columnArticles":388,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47644,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35161366685078516,"acs":4456,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12673,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.72702743216909,"acs":4850,"articleLive":2,"columnArticles":57,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6671,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6019681742043551,"acs":2875,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4776,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5661928412399383,"acs":3306,"articleLive":2,"columnArticles":65,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5839,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6915557404326124,"acs":3325,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4808,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4895785429245353,"acs":33002,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67409,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7212406753042796,"acs":1837,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2547,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36574622525685485,"acs":33961,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92854,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7644959857270295,"acs":4285,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5605,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4388989154452072,"acs":78063,"articleLive":2,"columnArticles":621,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":177861,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4590334637685925,"acs":41879,"articleLive":2,"columnArticles":454,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91233,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6176712328767123,"acs":4509,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7300,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7222963951935915,"acs":3246,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4494,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127677637463427,"acs":80840,"articleLive":2,"columnArticles":507,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131926,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5109481216457961,"acs":14281,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27950,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.417938698253755,"acs":20535,"articleLive":2,"columnArticles":208,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49134,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5154196984564873,"acs":83515,"articleLive":2,"columnArticles":568,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":162033,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4695710541456242,"acs":14691,"articleLive":2,"columnArticles":124,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31286,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4645485844982177,"acs":76369,"articleLive":2,"columnArticles":818,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":164394,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5091792867229985,"acs":65261,"articleLive":2,"columnArticles":554,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":128169,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6391087213198455,"acs":80111,"articleLive":2,"columnArticles":565,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125348,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.638716148445336,"acs":3184,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4985,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5033026047500072,"acs":35051,"articleLive":2,"columnArticles":220,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":69642,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44132621124233196,"acs":21151,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47926,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.63201424614167,"acs":15971,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25270,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.602176191409412,"acs":70672,"articleLive":2,"columnArticles":775,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":117361,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.579443278471225,"acs":52457,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":90530,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4176893061132161,"acs":7386,"articleLive":2,"columnArticles":85,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17683,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7496250374962504,"acs":22491,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30003,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5341569455634109,"acs":224097,"articleLive":2,"columnArticles":1214,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":419534,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.527628615970899,"acs":6092,"articleLive":2,"columnArticles":110,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11546,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6916267337494104,"acs":101176,"articleLive":2,"columnArticles":993,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":146287,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46710656548993734,"acs":7079,"articleLive":2,"columnArticles":96,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15155,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3576810702752576,"acs":4652,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13006,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152330061238566,"acs":147910,"articleLive":2,"columnArticles":1585,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":287074,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39104551218824857,"acs":11101,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28388,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5529449890626266,"acs":122850,"articleLive":2,"columnArticles":1310,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":222174,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5204966831093724,"acs":52020,"articleLive":2,"columnArticles":429,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":99943,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4288785046728972,"acs":9178,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21400,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37710494571773223,"acs":15631,"articleLive":2,"columnArticles":193,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41450,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6578899746652189,"acs":14542,"articleLive":2,"columnArticles":123,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22104,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5919154646091915,"acs":42348,"articleLive":2,"columnArticles":531,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71544,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41671318761540777,"acs":19408,"articleLive":2,"columnArticles":198,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46574,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6139365054087564,"acs":53973,"articleLive":2,"columnArticles":658,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87913,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32715007754180425,"acs":81427,"articleLive":2,"columnArticles":589,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":248898,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45561298243529574,"acs":46016,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":100998,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5841585869584003,"acs":101400,"articleLive":2,"columnArticles":1130,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":173583,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.561912957954266,"acs":45706,"articleLive":2,"columnArticles":463,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81340,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7376272762874486,"acs":120546,"articleLive":2,"columnArticles":799,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":163424,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4833962088398305,"acs":10379,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21471,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.323957856161246,"acs":3536,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10915,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5560843838435812,"acs":95106,"articleLive":2,"columnArticles":1330,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":171028,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5648839642790591,"acs":39408,"articleLive":2,"columnArticles":319,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69763,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5022321428571429,"acs":900,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1792,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6738450411355212,"acs":74534,"articleLive":2,"columnArticles":379,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":110610,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6882777560575575,"acs":72179,"articleLive":2,"columnArticles":935,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":104869,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3934913109316412,"acs":87311,"articleLive":2,"columnArticles":1135,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":221888,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5384232377035968,"acs":150310,"articleLive":2,"columnArticles":1088,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":279167,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.507706915011818,"acs":175924,"articleLive":2,"columnArticles":994,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":346507,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48105430867276255,"acs":27778,"articleLive":2,"columnArticles":328,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":57744,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36128604574080214,"acs":2180,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6034,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7560945655511206,"acs":12313,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16285,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20833333333333334,"acs":2760,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13248,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223718668163113,"acs":33272,"articleLive":2,"columnArticles":306,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53460,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4273850085178876,"acs":2007,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4696,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5699033037872683,"acs":8487,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14892,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5314164332112182,"acs":51786,"articleLive":2,"columnArticles":450,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97449,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.616218386190285,"acs":1535,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2491,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6685511690302798,"acs":6977,"articleLive":2,"columnArticles":115,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10436,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6134441311767325,"acs":4134,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6739,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6511341222879684,"acs":2641,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4056,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6999526795220632,"acs":59167,"articleLive":2,"columnArticles":476,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":84530,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5877038460511917,"acs":44039,"articleLive":2,"columnArticles":673,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74934,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7327150084317032,"acs":869,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1186,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37908645631620913,"acs":6656,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17558,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5323326408899015,"acs":15888,"articleLive":2,"columnArticles":215,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29846,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3991636160260321,"acs":62806,"articleLive":2,"columnArticles":872,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":157344,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5077133899466395,"acs":97812,"articleLive":2,"columnArticles":860,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":192652,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4882773802971932,"acs":8872,"articleLive":2,"columnArticles":146,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18170,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743757983440392,"acs":125006,"articleLive":2,"columnArticles":1027,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":217638,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5187975199253172,"acs":96142,"articleLive":2,"columnArticles":844,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":185317,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5905110975361434,"acs":2900,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4911,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38019257221458047,"acs":16584,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43620,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4585647953735587,"acs":76440,"articleLive":2,"columnArticles":745,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":166694,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6972773419473927,"acs":43819,"articleLive":2,"columnArticles":444,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62843,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4772002807159949,"acs":56438,"articleLive":2,"columnArticles":693,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118269,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2516313512720874,"acs":3432,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13639,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885898007889128,"acs":83113,"articleLive":2,"columnArticles":940,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141207,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515063168124392,"acs":19295,"articleLive":2,"columnArticles":172,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34986,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.662904582327247,"acs":48868,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73718,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6489095626563194,"acs":138805,"articleLive":2,"columnArticles":1097,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":213905,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5577567265785398,"acs":15485,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27763,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48677801800945614,"acs":61464,"articleLive":2,"columnArticles":622,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":126267,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7116151047590932,"acs":81956,"articleLive":2,"columnArticles":954,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115169,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5089482550642652,"acs":97885,"articleLive":2,"columnArticles":853,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":192328,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5563930990003225,"acs":27606,"articleLive":2,"columnArticles":313,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49616,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6033193258188327,"acs":79538,"articleLive":2,"columnArticles":498,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":131834,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5770245288123366,"acs":153567,"articleLive":2,"columnArticles":1257,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":266136,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3624875501957078,"acs":57140,"articleLive":2,"columnArticles":462,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157633,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43613386945611754,"acs":28852,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66154,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6119376070687945,"acs":6787,"articleLive":2,"columnArticles":65,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11091,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5114038336291775,"acs":80093,"articleLive":2,"columnArticles":644,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":156614,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43784220446997574,"acs":34146,"articleLive":2,"columnArticles":404,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":77987,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8122755204115658,"acs":170521,"articleLive":2,"columnArticles":1360,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":209930,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6050108653969065,"acs":14199,"articleLive":2,"columnArticles":132,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23469,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7086441262409031,"acs":78094,"articleLive":2,"columnArticles":940,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110202,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3560257589696412,"acs":11223,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31523,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5293148880105402,"acs":1607,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3036,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37387170344672516,"acs":11639,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31131,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44070006519231736,"acs":8788,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19941,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25143051158889146,"acs":25178,"articleLive":2,"columnArticles":298,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100139,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43469446857804805,"acs":1501,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3453,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470270362706705,"acs":63977,"articleLive":2,"columnArticles":336,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":116954,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.619161105815062,"acs":1299,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2098,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3995774222758829,"acs":6619,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16565,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4200645058533089,"acs":21099,"articleLive":2,"columnArticles":180,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50228,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6121648452759528,"acs":75846,"articleLive":2,"columnArticles":602,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":123898,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33464967759849445,"acs":21694,"articleLive":2,"columnArticles":240,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64826,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7012503227234168,"acs":38026,"articleLive":2,"columnArticles":486,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54226,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038806062672412,"acs":38966,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64526,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43811588490342923,"acs":6669,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15222,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4192056583242655,"acs":3082,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7352,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4482445383113049,"acs":29607,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66051,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5412124689233123,"acs":5660,"articleLive":2,"columnArticles":97,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10458,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.47222805176635185,"acs":40503,"articleLive":2,"columnArticles":430,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":85770,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5906810580723624,"acs":15542,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26312,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6357730619315721,"acs":1468,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2309,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6072685565766999,"acs":123366,"articleLive":2,"columnArticles":993,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":203149,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5865275429609629,"acs":46487,"articleLive":2,"columnArticles":402,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79258,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5774386067899423,"acs":5902,"articleLive":2,"columnArticles":115,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10221,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.38775734889353736,"acs":3522,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9083,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7201773835920178,"acs":1624,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2255,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4835266491140682,"acs":6795,"articleLive":2,"columnArticles":81,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14053,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5463182897862233,"acs":47840,"articleLive":2,"columnArticles":405,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":87568,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5525114155251142,"acs":19602,"articleLive":2,"columnArticles":180,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35478,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3459261861088345,"acs":26591,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76869,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4932905351294689,"acs":151528,"articleLive":2,"columnArticles":1045,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":307178,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5428263296312413,"acs":28690,"articleLive":2,"columnArticles":437,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52853,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6873808970485707,"acs":103523,"articleLive":2,"columnArticles":1067,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":150605,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4048428785199293,"acs":2976,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7351,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4689345794392523,"acs":43904,"articleLive":2,"columnArticles":455,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":93625,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3722175260636799,"acs":2642,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7098,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7092038656235619,"acs":30822,"articleLive":2,"columnArticles":480,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43460,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5130232991322975,"acs":66101,"articleLive":2,"columnArticles":544,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":128846,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4411631829407867,"acs":29295,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66404,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6358608002452859,"acs":103693,"articleLive":2,"columnArticles":986,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":163075,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5040927471954083,"acs":30915,"articleLive":2,"columnArticles":324,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61328,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48357289527720737,"acs":5652,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11688,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5638756229235881,"acs":21725,"articleLive":2,"columnArticles":291,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38528,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4128214061737858,"acs":29622,"articleLive":2,"columnArticles":232,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":71755,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6773052902277737,"acs":14749,"articleLive":2,"columnArticles":211,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21776,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6746579747507505,"acs":246518,"articleLive":2,"columnArticles":1493,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":365397,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6076324564653576,"acs":3280,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5398,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7325765575501584,"acs":19425,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26516,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5378816878183799,"acs":18267,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":33961,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7311850873080147,"acs":51463,"articleLive":2,"columnArticles":574,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":70383,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5008650519031141,"acs":19686,"articleLive":2,"columnArticles":242,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39304,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.644426430202164,"acs":38953,"articleLive":2,"columnArticles":426,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60446,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6540750829614803,"acs":86922,"articleLive":2,"columnArticles":622,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":132893,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5102105850173938,"acs":19213,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37657,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6573692436741517,"acs":108932,"articleLive":2,"columnArticles":688,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":165709,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3976659372720642,"acs":2726,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6855,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5638890443934389,"acs":40291,"articleLive":2,"columnArticles":646,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71452,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.713283390171633,"acs":25517,"articleLive":2,"columnArticles":253,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35774,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3617482295740408,"acs":6845,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18922,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2747104938517251,"acs":69032,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":251290,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49542441765315587,"acs":72653,"articleLive":2,"columnArticles":758,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":146648,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5360038769769037,"acs":45347,"articleLive":2,"columnArticles":517,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84602,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7352297592997812,"acs":33264,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45243,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5789626195305708,"acs":1998,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3451,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47691959912591364,"acs":31646,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66355,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6451006145514099,"acs":39784,"articleLive":2,"columnArticles":463,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61671,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6209243182995557,"acs":79107,"articleLive":2,"columnArticles":638,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":127402,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6588946459412781,"acs":3815,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5790,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37494675929325716,"acs":25529,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68087,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5253042921204356,"acs":1640,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3122,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6752252462536763,"acs":14464,"articleLive":2,"columnArticles":139,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21421,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.84225921395522,"acs":15837,"articleLive":2,"columnArticles":102,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18803,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5380453752181501,"acs":3083,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5730,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7125857567846519,"acs":11737,"articleLive":2,"columnArticles":173,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16471,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7010920496490524,"acs":109974,"articleLive":2,"columnArticles":841,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":156861,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5983769390084112,"acs":14157,"articleLive":2,"columnArticles":190,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23659,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5823255256335327,"acs":38858,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66729,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6073839977438246,"acs":73225,"articleLive":2,"columnArticles":803,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":120558,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45797959036728175,"acs":69966,"articleLive":2,"columnArticles":649,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":152771,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.552617229100411,"acs":151001,"articleLive":2,"columnArticles":1243,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":273247,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7108359133126935,"acs":2296,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3230,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4186300704396405,"acs":3447,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8234,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6283119480086652,"acs":15082,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24004,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6187926053212984,"acs":163847,"articleLive":2,"columnArticles":1146,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":264785,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35498025449758663,"acs":1618,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4558,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48124306326304106,"acs":2168,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4505,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4386730835338604,"acs":12761,"articleLive":2,"columnArticles":179,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29090,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5677733604150823,"acs":58982,"articleLive":2,"columnArticles":758,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103883,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5777078176443728,"acs":24039,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41611,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6053327905556687,"acs":5948,"articleLive":2,"columnArticles":86,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9826,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5030676859477017,"acs":45999,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91437,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3429368029739777,"acs":1107,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3228,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3259702816589044,"acs":14698,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45090,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7456573756118945,"acs":163293,"articleLive":2,"columnArticles":1338,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":218992,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5043207742827515,"acs":2918,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5786,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7283541064404531,"acs":61476,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84404,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465379456883168,"acs":152152,"articleLive":2,"columnArticles":934,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":340737,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7749298746751074,"acs":90339,"articleLive":2,"columnArticles":752,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116577,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4661726033946928,"acs":3900,"articleLive":2,"columnArticles":63,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8366,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6062088147996042,"acs":32474,"articleLive":2,"columnArticles":325,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53569,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17945832998473038,"acs":4466,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24886,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6109432838361061,"acs":14359,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23503,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6892075829009923,"acs":69876,"articleLive":2,"columnArticles":651,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":101386,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43192483190538444,"acs":119933,"articleLive":2,"columnArticles":1095,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":277671,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5078689919183327,"acs":1194,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2351,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5650911161731207,"acs":9923,"articleLive":2,"columnArticles":157,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17560,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6611684199775304,"acs":12947,"articleLive":2,"columnArticles":113,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19582,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4876486082437531,"acs":6850,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14047,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4731586702685807,"acs":84773,"articleLive":2,"columnArticles":742,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":179164,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6640776699029126,"acs":1026,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1545,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6474933768086407,"acs":12709,"articleLive":2,"columnArticles":113,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19628,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6833154170744621,"acs":42589,"articleLive":2,"columnArticles":439,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62327,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46867131600398515,"acs":25873,"articleLive":2,"columnArticles":281,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55205,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7025237323454503,"acs":15171,"articleLive":2,"columnArticles":85,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21595,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.496265684126668,"acs":9967,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20084,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4106502005488706,"acs":7781,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18948,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5231973459126017,"acs":10093,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19291,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40508359352419876,"acs":99510,"articleLive":2,"columnArticles":862,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":245653,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40805833411236797,"acs":8730,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21394,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6191359078822181,"acs":50758,"articleLive":2,"columnArticles":492,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":81982,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744752308984048,"acs":13836,"articleLive":2,"columnArticles":61,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17865,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5954834156669019,"acs":8438,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14170,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7462169460437152,"acs":14646,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19627,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3849447021048876,"acs":2158,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5606,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4260694803330462,"acs":1484,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3483,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7452228231249738,"acs":88879,"articleLive":2,"columnArticles":567,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119265,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7611927670067204,"acs":62975,"articleLive":2,"columnArticles":464,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82732,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3410690507894236,"acs":1793,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5257,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5232057694544608,"acs":4498,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8597,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44288798778240035,"acs":8410,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18989,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5183495128525872,"acs":29421,"articleLive":2,"columnArticles":270,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56759,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7967905807849858,"acs":103676,"articleLive":2,"columnArticles":238,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":130117,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42115773599666484,"acs":81828,"articleLive":2,"columnArticles":286,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":194293,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4418416801292407,"acs":10393,"articleLive":2,"columnArticles":82,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23522,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5180135699041187,"acs":16262,"articleLive":2,"columnArticles":210,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31393,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5222968845448992,"acs":29070,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55658,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.481471314850398,"acs":19294,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40073,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5005444646098004,"acs":31717,"articleLive":2,"columnArticles":375,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63365,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6291406069029418,"acs":8148,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12951,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6712242322254943,"acs":12764,"articleLive":2,"columnArticles":112,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":19016,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3741216009776963,"acs":2449,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6546,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33373469065080696,"acs":109760,"articleLive":2,"columnArticles":1262,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":328884,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5690206913001133,"acs":28628,"articleLive":2,"columnArticles":314,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50311,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6601583685866146,"acs":12172,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18438,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6560619088564058,"acs":7630,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11630,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.486044776119403,"acs":6513,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13400,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6653215636822194,"acs":10552,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15860,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.531896551724138,"acs":50594,"articleLive":2,"columnArticles":394,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95120,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6679945676776822,"acs":7378,"articleLive":2,"columnArticles":64,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11045,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8174764068507515,"acs":11694,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14305,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34532557448073736,"acs":8130,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23543,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42482461734693877,"acs":5329,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12544,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46050608136446247,"acs":3294,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7153,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7877820569689784,"acs":190028,"articleLive":2,"columnArticles":1255,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":241219,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6194914125948608,"acs":4653,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7511,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4659090909090909,"acs":11398,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24464,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735652518972901,"acs":93572,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":120962,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5711646856108175,"acs":78229,"articleLive":2,"columnArticles":499,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":136964,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43712411153635866,"acs":65559,"articleLive":2,"columnArticles":424,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":149978,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5460386497306381,"acs":11048,"articleLive":2,"columnArticles":190,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20233,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.42006509668772735,"acs":2194,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5223,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3428649237472767,"acs":2518,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7344,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6842057761732852,"acs":45486,"articleLive":2,"columnArticles":355,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66480,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8081266450937291,"acs":85659,"articleLive":2,"columnArticles":341,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":105997,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.524893174957858,"acs":80337,"articleLive":2,"columnArticles":761,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":153054,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40678630969893104,"acs":4148,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10197,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3687975998153704,"acs":6392,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17332,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28855853464295195,"acs":1087,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3767,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5979485880714195,"acs":18888,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31588,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39784465298406696,"acs":94286,"articleLive":2,"columnArticles":769,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":236992,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.440530058177117,"acs":1363,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3094,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5538419544151767,"acs":4058,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7327,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5520587905306855,"acs":9841,"articleLive":2,"columnArticles":113,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17826,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900445219626383,"acs":75170,"articleLive":2,"columnArticles":652,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":108935,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5923192071439632,"acs":11475,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19373,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37689213209841893,"acs":20143,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53445,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4249032711924024,"acs":10872,"articleLive":2,"columnArticles":212,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25587,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5329056547692765,"acs":21515,"articleLive":2,"columnArticles":242,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40373,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.48934899462472625,"acs":2458,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5023,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4505156529958663,"acs":63866,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":141762,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4011220196353436,"acs":1144,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2852,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4338502643468836,"acs":68849,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":158693,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5776049204052098,"acs":22351,"articleLive":2,"columnArticles":200,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38696,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6567176727761896,"acs":124976,"articleLive":2,"columnArticles":921,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":190304,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5848144811204848,"acs":21420,"articleLive":2,"columnArticles":280,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36627,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4818886702927902,"acs":29148,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60487,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5670846142332446,"acs":49253,"articleLive":2,"columnArticles":654,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86853,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5834491276825691,"acs":3779,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6477,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5716480446927374,"acs":32744,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57280,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5980997624703088,"acs":41547,"articleLive":2,"columnArticles":395,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69465,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8106974868969224,"acs":60324,"articleLive":2,"columnArticles":611,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":74410,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.597979797979798,"acs":9472,"articleLive":2,"columnArticles":138,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15840,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.308336366945759,"acs":847,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2747,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.783388381766436,"acs":82302,"articleLive":2,"columnArticles":628,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105059,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4546760401527698,"acs":26905,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59174,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419614423828684,"acs":28421,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52441,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6556914393226717,"acs":697,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1063,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5606684672518568,"acs":16607,"articleLive":2,"columnArticles":214,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29620,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4090844811494188,"acs":28928,"articleLive":2,"columnArticles":274,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":70714,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4644155844155844,"acs":1788,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3850,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6538769221652692,"acs":22069,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33751,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2707788624864311,"acs":75084,"articleLive":2,"columnArticles":941,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":277289,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6181182639091174,"acs":2122,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3433,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6242315773091588,"acs":8022,"articleLive":2,"columnArticles":121,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12851,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5079447579447579,"acs":6841,"articleLive":2,"columnArticles":67,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13468,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6657423791889377,"acs":36494,"articleLive":2,"columnArticles":308,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54817,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4517114046300241,"acs":19083,"articleLive":2,"columnArticles":286,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42246,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48608613517882765,"acs":53521,"articleLive":2,"columnArticles":670,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110106,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5482717520858165,"acs":3680,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6712,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43525239044188896,"acs":47614,"articleLive":2,"columnArticles":418,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":109394,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4967466786230898,"acs":93064,"articleLive":2,"columnArticles":768,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":187347,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40115718418514945,"acs":2912,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7259,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5877293577981652,"acs":7175,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12208,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6174906197171484,"acs":14976,"articleLive":2,"columnArticles":252,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24253,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38561322840215756,"acs":43609,"articleLive":2,"columnArticles":479,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113090,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5414617884823736,"acs":25988,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47996,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015610287465613,"acs":86999,"articleLive":2,"columnArticles":824,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":216652,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5034883720930232,"acs":2598,"articleLive":2,"columnArticles":63,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5160,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6949781330116122,"acs":46084,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66310,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4344854520601445,"acs":2225,"articleLive":2,"columnArticles":51,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5121,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658805292587057,"acs":60139,"articleLive":2,"columnArticles":608,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90315,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43114595639566106,"acs":20072,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46555,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3561500185055722,"acs":17321,"articleLive":2,"columnArticles":196,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48634,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4413776426696145,"acs":38331,"articleLive":2,"columnArticles":273,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86844,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108543861876349,"acs":8048,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15754,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.486986098787341,"acs":3293,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6762,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6477774438871039,"acs":56047,"articleLive":2,"columnArticles":567,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86522,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4917898193760263,"acs":3594,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7308,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5778056256456283,"acs":68240,"articleLive":2,"columnArticles":738,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":118102,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6098568860458058,"acs":26122,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42833,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5350151097096308,"acs":4072,"articleLive":2,"columnArticles":78,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7611,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6648570891216941,"acs":130798,"articleLive":2,"columnArticles":1297,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":196731,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6318816762530813,"acs":52292,"articleLive":2,"columnArticles":475,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82756,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6049794637918997,"acs":66725,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110293,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44676160400405174,"acs":29992,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67132,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47795384085428866,"acs":2775,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5806,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7604884647593105,"acs":82640,"articleLive":2,"columnArticles":520,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":108667,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7232437128745597,"acs":76585,"articleLive":2,"columnArticles":566,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":105891,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7404240766073872,"acs":4330,"articleLive":2,"columnArticles":77,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5848,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5129138763696857,"acs":60431,"articleLive":2,"columnArticles":552,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117819,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.555837361538345,"acs":293451,"articleLive":2,"columnArticles":1454,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":527944,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6450457696579723,"acs":67366,"articleLive":2,"columnArticles":434,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":104436,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6441267387944358,"acs":58345,"articleLive":2,"columnArticles":391,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":90580,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3217744876194472,"acs":64417,"articleLive":2,"columnArticles":443,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":200193,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33958302084895753,"acs":2264,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6667,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7587759160848133,"acs":70963,"articleLive":2,"columnArticles":510,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93523,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3524584650568373,"acs":5240,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14867,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5600624024960998,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1282,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6720434859466148,"acs":15207,"articleLive":2,"columnArticles":170,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22628,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4141408871963413,"acs":23816,"articleLive":2,"columnArticles":220,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":57507,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7219105959314837,"acs":100643,"articleLive":2,"columnArticles":672,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":139412,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4096162736939436,"acs":2658,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6489,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46087753465459963,"acs":4023,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8729,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115929860819582,"acs":31685,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61934,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5645351039859624,"acs":84936,"articleLive":2,"columnArticles":589,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":150453,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36985049833887046,"acs":8906,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24080,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.484675361165094,"acs":20700,"articleLive":2,"columnArticles":274,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42709,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46925844298956376,"acs":28957,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61708,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.321967758444217,"acs":5033,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15632,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7207009857612268,"acs":1316,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1826,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4627488900116101,"acs":138305,"articleLive":2,"columnArticles":864,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":298877,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6084747029370002,"acs":48852,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80286,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524696827767792,"acs":21822,"articleLive":2,"columnArticles":398,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39499,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40930754135127556,"acs":2920,"articleLive":2,"columnArticles":49,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7134,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7601584176138906,"acs":33973,"articleLive":2,"columnArticles":310,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44692,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5136007949323066,"acs":8270,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16102,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4901667911376649,"acs":3938,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8034,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5056433408577878,"acs":4032,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7974,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6102453877843453,"acs":3407,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5583,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804204340358006,"acs":66569,"articleLive":2,"columnArticles":571,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":114691,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4805529522024367,"acs":2051,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4268,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4066657655396142,"acs":21060,"articleLive":2,"columnArticles":264,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51787,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4632768361581921,"acs":1558,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3363,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46104283498389215,"acs":3864,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8381,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017768559958278,"acs":41371,"articleLive":2,"columnArticles":590,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82449,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6800846242568295,"acs":213450,"articleLive":2,"columnArticles":1524,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":313858,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6295779816513761,"acs":51468,"articleLive":2,"columnArticles":596,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":81750,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3670746296125886,"acs":3989,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10867,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4951550387596899,"acs":1533,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3096,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.520472612436023,"acs":57354,"articleLive":2,"columnArticles":525,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":110196,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45892745744586044,"acs":41197,"articleLive":2,"columnArticles":365,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89768,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39274017467248906,"acs":2878,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7328,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5881996292895872,"acs":135820,"articleLive":2,"columnArticles":1302,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":230908,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41670406565124607,"acs":45497,"articleLive":2,"columnArticles":405,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109183,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6020658179197694,"acs":12532,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20815,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5053723601333827,"acs":1364,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2699,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7218614718614719,"acs":2001,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2772,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5025234318673396,"acs":1394,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2774,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5303285657890742,"acs":69857,"articleLive":2,"columnArticles":592,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":131724,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5918666422421689,"acs":3231,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5459,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43097155126140635,"acs":8029,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18630,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49884881043745205,"acs":1300,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2606,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5652868198010073,"acs":4602,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8141,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.42010309278350516,"acs":2445,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5820,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4619844511793385,"acs":3506,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7589,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6605633802816901,"acs":1876,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2840,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.839608593916188,"acs":3947,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4701,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5906021384355655,"acs":2099,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3554,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7001255197301326,"acs":17849,"articleLive":2,"columnArticles":143,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25494,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631038170068344,"acs":82068,"articleLive":2,"columnArticles":988,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":107545,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49374557469907954,"acs":4184,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8474,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6652377151978109,"acs":29174,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43855,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080400005148071,"acs":55014,"articleLive":2,"columnArticles":635,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77699,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47789785061666545,"acs":40066,"articleLive":2,"columnArticles":497,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83838,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5057787040545662,"acs":5339,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10556,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5876617288580537,"acs":12536,"articleLive":2,"columnArticles":150,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21332,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5548837209302325,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2150,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513192780794735,"acs":153160,"articleLive":2,"columnArticles":1115,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":179909,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4932249322493225,"acs":6188,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12546,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7132036284780551,"acs":23351,"articleLive":2,"columnArticles":333,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32741,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5898520084566596,"acs":1116,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1892,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4601288215549306,"acs":5072,"articleLive":2,"columnArticles":80,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11023,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5692405871091257,"acs":1784,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3134,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3234153400868307,"acs":5587,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17275,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5942855700547717,"acs":23545,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39619,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4364511153571675,"acs":18959,"articleLive":2,"columnArticles":235,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43439,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2872573987880917,"acs":3271,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11387,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6171769168247088,"acs":43282,"articleLive":2,"columnArticles":661,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70129,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42783945345858243,"acs":1503,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3513,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5959501025290499,"acs":69750,"articleLive":2,"columnArticles":670,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117040,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6869849168092054,"acs":44180,"articleLive":2,"columnArticles":486,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64310,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5122534445020812,"acs":40488,"articleLive":2,"columnArticles":405,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":79039,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4725030552160871,"acs":4253,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9001,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39102149444618994,"acs":42314,"articleLive":2,"columnArticles":399,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108214,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6081076634529959,"acs":18481,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30391,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6921957190591194,"acs":20923,"articleLive":2,"columnArticles":295,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30227,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44985574148874785,"acs":3898,"articleLive":2,"columnArticles":67,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8665,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948233861144946,"acs":11409,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16420,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46421633779777116,"acs":9081,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19562,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.393141075604053,"acs":5044,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12830,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3409533524993045,"acs":7353,"articleLive":2,"columnArticles":104,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21566,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5331608966706459,"acs":8039,"articleLive":2,"columnArticles":88,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15078,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5303495750835258,"acs":23652,"articleLive":2,"columnArticles":281,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44597,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7929914810558383,"acs":43471,"articleLive":2,"columnArticles":539,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":54819,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46408286000668225,"acs":1389,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2993,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40878664307147805,"acs":5313,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12997,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7060843964671246,"acs":1439,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2038,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4197423901114769,"acs":7267,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17313,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5766771391609684,"acs":31204,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54110,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48200958441354386,"acs":12271,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25458,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7713870311136959,"acs":39792,"articleLive":2,"columnArticles":400,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51585,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2908811924594476,"acs":2654,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9124,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6568670469504169,"acs":13473,"articleLive":2,"columnArticles":151,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20511,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8453539935776543,"acs":16585,"articleLive":2,"columnArticles":218,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19619,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4811011579637317,"acs":4404,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9154,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4190874914559125,"acs":4905,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11704,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7336277323912563,"acs":16613,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22645,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.705045685736148,"acs":15664,"articleLive":2,"columnArticles":199,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22217,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6305181226765799,"acs":10855,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17216,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5500551789374113,"acs":6978,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12686,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6996584949384071,"acs":22946,"articleLive":2,"columnArticles":355,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32796,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4336346375423963,"acs":26721,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61621,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51058352402746,"acs":3570,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6992,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.591488989863684,"acs":13538,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22888,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4330055680606563,"acs":3655,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8441,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42145586512797867,"acs":21949,"articleLive":2,"columnArticles":249,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52079,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5075818330982734,"acs":55064,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108483,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6926371045724548,"acs":25070,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36195,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5021864614308204,"acs":2871,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5717,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4285088999124599,"acs":2937,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6854,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6153424457276515,"acs":16837,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27362,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39127096621781243,"acs":6625,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16932,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37418134187163443,"acs":7713,"articleLive":2,"columnArticles":113,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20613,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3898929336188437,"acs":9104,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23350,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4919761577258138,"acs":3219,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6543,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3660103278895,"acs":8718,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23819,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5433048641528764,"acs":51972,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95659,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.405485825578879,"acs":7495,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18484,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7957621693833437,"acs":85776,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107791,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.43007430909242716,"acs":5151,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11977,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5284402223185778,"acs":13406,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25369,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5741901079856019,"acs":4307,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7501,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4793809197328661,"acs":37757,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78762,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39589969778649026,"acs":19388,"articleLive":2,"columnArticles":244,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48972,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5000349235174967,"acs":7159,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14317,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5746519443110898,"acs":19152,"articleLive":2,"columnArticles":269,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33328,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3597526924611089,"acs":9019,"articleLive":2,"columnArticles":113,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25070,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6577599564718546,"acs":55609,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84543,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4881097718245439,"acs":28387,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58157,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.37955410549211527,"acs":2792,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7356,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5126078131485134,"acs":90159,"articleLive":2,"columnArticles":988,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":175883,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42121899188008893,"acs":37713,"articleLive":2,"columnArticles":556,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89533,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5117290846022694,"acs":8704,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17009,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6810492232691818,"acs":18720,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27487,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4493931136982908,"acs":9071,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20185,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4267573696145125,"acs":15997,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37485,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4491603616903488,"acs":2434,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5419,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4815434370469499,"acs":4318,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8967,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7144693446088795,"acs":84486,"articleLive":2,"columnArticles":730,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":118250,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38407564444110914,"acs":10236,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26651,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35979228486646886,"acs":4365,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12132,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4091257342300162,"acs":4806,"articleLive":2,"columnArticles":57,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11747,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6268903047516696,"acs":16333,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26054,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46652267818574517,"acs":3024,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6482,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5550220856539274,"acs":2890,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5207,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3021202559004063,"acs":27957,"articleLive":2,"columnArticles":364,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92536,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5870704148258201,"acs":90093,"articleLive":2,"columnArticles":775,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":153462,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085122778177335,"acs":31477,"articleLive":2,"columnArticles":440,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38932,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1924127250588138,"acs":16276,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84589,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.604608168715122,"acs":35320,"articleLive":2,"columnArticles":563,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58418,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45599279062781617,"acs":3036,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6658,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.658038246200829,"acs":9050,"articleLive":2,"columnArticles":131,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13753,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2247500449021134,"acs":7508,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33406,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702453374689231,"acs":83843,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125093,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6242897998093422,"acs":16372,"articleLive":2,"columnArticles":237,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26225,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.551025641025641,"acs":6447,"articleLive":2,"columnArticles":96,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11700,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42953521086326185,"acs":14962,"articleLive":2,"columnArticles":192,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34833,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3422151807575976,"acs":9504,"articleLive":2,"columnArticles":126,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27772,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6522230838826418,"acs":60555,"articleLive":2,"columnArticles":723,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92844,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5114078647161455,"acs":15242,"articleLive":2,"columnArticles":113,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29804,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4150836976008702,"acs":20606,"articleLive":2,"columnArticles":229,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49643,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4796527807509526,"acs":44813,"articleLive":2,"columnArticles":354,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":93428,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7061081395671092,"acs":152871,"articleLive":2,"columnArticles":1650,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":216498,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7572462159882818,"acs":68240,"articleLive":2,"columnArticles":484,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90116,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28112834258727426,"acs":4405,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15669,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5543324138286627,"acs":21502,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38789,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528823007728367,"acs":5988,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23679,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5377431817662255,"acs":47045,"articleLive":2,"columnArticles":573,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87486,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4850217864923747,"acs":1781,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3672,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6891729418464848,"acs":10891,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15803,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6620897748847301,"acs":19529,"articleLive":2,"columnArticles":253,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29496,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6919875130072841,"acs":4655,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6727,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42665223168151173,"acs":8670,"articleLive":2,"columnArticles":115,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20321,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2913635409992232,"acs":51384,"articleLive":2,"columnArticles":337,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":176357,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6405315536547251,"acs":54515,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85109,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6758596613719672,"acs":15488,"articleLive":2,"columnArticles":148,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22916,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7265547877591313,"acs":8832,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12156,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3303995367689635,"acs":2853,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8635,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385886231217418,"acs":33319,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52176,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7249461206896551,"acs":10764,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14848,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7745426739603553,"acs":13168,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17001,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.545565655794057,"acs":7142,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13091,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867259597410519,"acs":59636,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101642,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7441226412838112,"acs":62228,"articleLive":2,"columnArticles":710,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83626,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3382601615832655,"acs":5401,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15967,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5369634849455477,"acs":4191,"articleLive":2,"columnArticles":46,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7805,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49321663019693657,"acs":3381,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6855,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5458254323967132,"acs":18998,"articleLive":2,"columnArticles":233,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34806,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32941873087930523,"acs":3338,"articleLive":2,"columnArticles":78,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10133,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5308151093439364,"acs":2937,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5533,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45366616726888165,"acs":20591,"articleLive":2,"columnArticles":285,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":45388,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7006251279765848,"acs":58168,"articleLive":2,"columnArticles":605,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":83023,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27763755678950025,"acs":2200,"articleLive":2,"columnArticles":39,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7924,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3175014633330546,"acs":11391,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35877,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.698744769874477,"acs":20875,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29875,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4595206429157588,"acs":16239,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35339,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3189539347408829,"acs":6647,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20840,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4264012077750519,"acs":4519,"articleLive":2,"columnArticles":69,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10598,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5603228804900483,"acs":230876,"articleLive":2,"columnArticles":1061,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":412041,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.3989941324392288,"acs":1904,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4772,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38873746097649875,"acs":49061,"articleLive":2,"columnArticles":619,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126206,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46958819423671355,"acs":9419,"articleLive":2,"columnArticles":115,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20058,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4419794042435552,"acs":6395,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14469,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5703114414571356,"acs":29464,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51663,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3575923999249544,"acs":20966,"articleLive":2,"columnArticles":224,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":58631,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6327178642831942,"acs":5380,"articleLive":2,"columnArticles":101,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8503,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4840466926070039,"acs":1866,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3855,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.737705492656595,"acs":21046,"articleLive":2,"columnArticles":312,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28529,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7138947719106203,"acs":90000,"articleLive":2,"columnArticles":827,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126069,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3388840830449827,"acs":6268,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18496,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3590594427598833,"acs":6276,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17479,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38738884149200276,"acs":50402,"articleLive":2,"columnArticles":677,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130107,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5234543217471547,"acs":6807,"articleLive":2,"columnArticles":124,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13004,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33714229905264187,"acs":3452,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10239,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4196360879454132,"acs":2214,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5276,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6442052565707134,"acs":25736,"articleLive":2,"columnArticles":232,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39950,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5448447124842778,"acs":33788,"articleLive":2,"columnArticles":342,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62014,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6650723765480979,"acs":20997,"articleLive":2,"columnArticles":271,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31571,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6325025807403037,"acs":8578,"articleLive":2,"columnArticles":82,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13562,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7250870801137046,"acs":36221,"articleLive":2,"columnArticles":310,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49954,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47415924578366536,"acs":23588,"articleLive":2,"columnArticles":265,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49747,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4752037252619325,"acs":6123,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12885,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37863372093023256,"acs":1563,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4128,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5875532071040658,"acs":12009,"articleLive":2,"columnArticles":127,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20439,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8187501579785487,"acs":97175,"articleLive":2,"columnArticles":803,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118687,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4538326799566269,"acs":5441,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11989,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4212253829321663,"acs":5005,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11882,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39253434391283754,"acs":62148,"articleLive":2,"columnArticles":615,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158325,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7303660699887115,"acs":22645,"articleLive":2,"columnArticles":214,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31005,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4706030784759021,"acs":1865,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3963,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6895813742339246,"acs":21266,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30839,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48614461133647624,"acs":35473,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72968,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6245334432460901,"acs":27274,"articleLive":2,"columnArticles":301,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43671,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6127764705882353,"acs":26043,"articleLive":2,"columnArticles":337,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42500,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39191290824261277,"acs":6804,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17361,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37054379997349474,"acs":8388,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22637,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7745979186376537,"acs":9825,"articleLive":2,"columnArticles":146,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12684,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6637848795611734,"acs":11133,"articleLive":2,"columnArticles":168,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16772,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3521933340968961,"acs":3075,"articleLive":2,"columnArticles":59,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8731,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5529950280167312,"acs":14014,"articleLive":2,"columnArticles":170,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25342,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3005790190735695,"acs":7060,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23488,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3300653594771242,"acs":3232,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9792,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4378319783197832,"acs":4039,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9225,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36077943193943396,"acs":14201,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39362,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5364135702746365,"acs":24903,"articleLive":2,"columnArticles":231,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46425,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7434033692977475,"acs":19637,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26415,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5564853556485355,"acs":1995,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3585,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768352215160726,"acs":36742,"articleLive":2,"columnArticles":303,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54285,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4429647167143468,"acs":13471,"articleLive":2,"columnArticles":132,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30411,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5034784337109919,"acs":2533,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5031,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43203309692671393,"acs":1462,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3384,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6836288659793814,"acs":33156,"articleLive":2,"columnArticles":393,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48500,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40372263730502034,"acs":3080,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7629,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.463743676222597,"acs":7700,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16604,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4991044776119403,"acs":25080,"articleLive":2,"columnArticles":328,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50250,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6512524901453821,"acs":15365,"articleLive":2,"columnArticles":196,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23593,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41400127488844723,"acs":11041,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26669,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44039415212210986,"acs":6838,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15527,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41090213579853363,"acs":1289,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3137,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6411829300617213,"acs":67732,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105636,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4662818614950178,"acs":37483,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80387,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4476477337923121,"acs":3121,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6972,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972942302129458,"acs":53686,"articleLive":2,"columnArticles":501,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89882,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7102758984811464,"acs":173541,"articleLive":2,"columnArticles":1356,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":244329,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47351196339834944,"acs":43261,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91362,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7124326145552561,"acs":8458,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11872,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7346426007588965,"acs":14327,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19502,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5323534549447259,"acs":21333,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40073,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5450267379679145,"acs":2548,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4675,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6341310930936798,"acs":32458,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51185,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41726950191217804,"acs":9056,"articleLive":2,"columnArticles":145,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21703,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6005016784093843,"acs":16279,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27109,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6784080752852111,"acs":25808,"articleLive":2,"columnArticles":250,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":38042,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5328586195015504,"acs":23198,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43535,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4981914893617021,"acs":9366,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18800,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4711882605583393,"acs":52660,"articleLive":2,"columnArticles":596,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111760,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5028200153408835,"acs":33432,"articleLive":2,"columnArticles":503,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66489,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5200332403395264,"acs":8761,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16847,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45292226432426225,"acs":23667,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52254,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5571117981885918,"acs":50993,"articleLive":2,"columnArticles":805,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91531,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5093420882748954,"acs":55230,"articleLive":2,"columnArticles":1409,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":108434,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5398617221873035,"acs":21473,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39775,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49546862452678675,"acs":4319,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8717,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5103437721726791,"acs":36683,"articleLive":2,"columnArticles":397,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":71879,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6148475120385233,"acs":7661,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12460,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906789256759817,"acs":30499,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44158,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4094996541388056,"acs":3552,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8674,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2920353982300885,"acs":2112,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7232,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7354993177663929,"acs":57138,"articleLive":2,"columnArticles":600,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77686,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5768885104772716,"acs":12196,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21141,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5969972830881056,"acs":67678,"articleLive":2,"columnArticles":715,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113364,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5313421828908554,"acs":25938,"articleLive":2,"columnArticles":420,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":48816,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6273909716908952,"acs":44280,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70578,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46522922952387963,"acs":6322,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13589,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7224978114969361,"acs":17332,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23989,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928714859437751,"acs":15353,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25896,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45239377325239866,"acs":18483,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40856,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6267060469454376,"acs":60474,"articleLive":2,"columnArticles":580,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96495,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3344198174706649,"acs":3078,"articleLive":2,"columnArticles":65,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9204,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3969990965203367,"acs":47017,"articleLive":2,"columnArticles":920,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118431,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5507863461069775,"acs":38419,"articleLive":2,"columnArticles":453,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":69753,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35519883254286755,"acs":4868,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13705,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5840926988412645,"acs":5192,"articleLive":2,"columnArticles":80,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8889,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5612422753921724,"acs":3542,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6311,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5162100028150511,"acs":44010,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85256,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5982807515065579,"acs":20253,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33852,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5369645324735145,"acs":9326,"articleLive":2,"columnArticles":138,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17368,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830660575580528,"acs":57766,"articleLive":2,"columnArticles":655,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73769,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7049664047779871,"acs":19830,"articleLive":2,"columnArticles":266,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28129,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5646712775260354,"acs":7103,"articleLive":2,"columnArticles":156,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12579,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5572190730243415,"acs":33422,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59980,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095578899850467,"acs":75448,"articleLive":2,"columnArticles":649,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106331,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6711341594827587,"acs":9965,"articleLive":2,"columnArticles":169,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14848,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4345382051114452,"acs":13296,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30598,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319595057102712,"acs":20317,"articleLive":2,"columnArticles":424,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27757,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6557351509250243,"acs":16836,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25675,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105078563411896,"acs":40516,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57024,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5673684210526316,"acs":4851,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8550,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39761680777673253,"acs":2536,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6378,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39060665362035224,"acs":10978,"articleLive":2,"columnArticles":167,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28105,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4323515210043457,"acs":4477,"articleLive":2,"columnArticles":98,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10355,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6332420026331709,"acs":35592,"articleLive":2,"columnArticles":387,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56206,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.29993547792423264,"acs":3254,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10849,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43822525597269624,"acs":9630,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21975,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7934347227437727,"acs":25355,"articleLive":2,"columnArticles":318,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31956,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5547248437308494,"acs":4526,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8159,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5211739216072484,"acs":2646,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5077,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4828841442072104,"acs":6898,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14285,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5299658324868409,"acs":11478,"articleLive":2,"columnArticles":152,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21658,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.691513246519982,"acs":7700,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11135,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20885498412234915,"acs":5722,"articleLive":2,"columnArticles":72,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27397,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6398760018146076,"acs":8463,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13226,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599933835249772,"acs":65835,"articleLive":2,"columnArticles":914,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99751,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7248814939278445,"acs":106127,"articleLive":2,"columnArticles":983,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":146406,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45531974308852274,"acs":9783,"articleLive":2,"columnArticles":134,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21486,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6450757007944836,"acs":43033,"articleLive":2,"columnArticles":404,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":66710,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7576100712715647,"acs":11374,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15013,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7536039086687306,"acs":31157,"articleLive":2,"columnArticles":371,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41344,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5812775117302762,"acs":48067,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82692,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4592466810744057,"acs":5950,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12956,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37635122321259246,"acs":7938,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21092,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5877689694224235,"acs":4671,"articleLive":2,"columnArticles":86,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7947,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4097566880522939,"acs":3385,"articleLive":2,"columnArticles":65,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8261,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46543567831527544,"acs":3050,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6553,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34169439467622215,"acs":1335,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3907,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36308478365000796,"acs":2274,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6263,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5313498893533317,"acs":4322,"articleLive":2,"columnArticles":64,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8134,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6057441253263708,"acs":2784,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4596,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5430670626856339,"acs":3474,"articleLive":2,"columnArticles":48,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6397,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7057699656094765,"acs":1847,"articleLive":2,"columnArticles":39,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2617,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6506532389765922,"acs":4781,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7348,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5422409959982214,"acs":2439,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4498,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4740004622140051,"acs":2051,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4327,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4225855901890649,"acs":827,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1957,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.864478003939593,"acs":13166,"articleLive":2,"columnArticles":63,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15230,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8191254416961131,"acs":11127,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13584,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4808541973490427,"acs":7836,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16296,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866499636031217,"acs":34654,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59071,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5803462143731422,"acs":3319,"articleLive":2,"columnArticles":54,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5719,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33485983902303634,"acs":2413,"articleLive":2,"columnArticles":53,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7206,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6692616866422856,"acs":18483,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27617,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6936353043984853,"acs":9525,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13732,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4962460644223783,"acs":10245,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20645,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7210838759096132,"acs":7531,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10444,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6222327891372114,"acs":11777,"articleLive":2,"columnArticles":182,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18927,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7345879299156391,"acs":11320,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15410,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4907676228080362,"acs":4226,"articleLive":2,"columnArticles":91,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8611,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.570837362212338,"acs":14759,"articleLive":2,"columnArticles":146,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25855,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7603217871152184,"acs":11436,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15041,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.527844671884407,"acs":10521,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19932,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5368112605305845,"acs":10259,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19111,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7729117709891049,"acs":3618,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4681,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6910931174089069,"acs":5121,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7410,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.533801580333626,"acs":1824,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3417,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45083726921425504,"acs":1050,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2329,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854557539502704,"acs":19378,"articleLive":2,"columnArticles":289,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33099,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5449750138811771,"acs":3926,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7204,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37872941176470587,"acs":28168,"articleLive":2,"columnArticles":287,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":74375,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48995161890584293,"acs":2633,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5374,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.379345813618597,"acs":3688,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9722,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6087911093003779,"acs":26897,"articleLive":2,"columnArticles":378,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44181,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37280851224961187,"acs":19691,"articleLive":2,"columnArticles":386,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52818,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5480078380143697,"acs":1678,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3062,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5193791946308725,"acs":6191,"articleLive":2,"columnArticles":110,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11920,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47192971122165517,"acs":7305,"articleLive":2,"columnArticles":102,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15479,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5807416267942583,"acs":4855,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8360,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.699699289229087,"acs":5119,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7316,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6670369341849486,"acs":2402,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3601,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3705235125096363,"acs":5287,"articleLive":2,"columnArticles":66,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14269,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6367770000537047,"acs":35571,"articleLive":2,"columnArticles":1103,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55861,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7611543674098482,"acs":28643,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37631,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.55920839191089,"acs":5171,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9247,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5771117166212534,"acs":4236,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7340,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41025164249411183,"acs":6619,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16134,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8396395268790288,"acs":67083,"articleLive":2,"columnArticles":682,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79895,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.57703489804567,"acs":58550,"articleLive":2,"columnArticles":584,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101467,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6299658205860929,"acs":11243,"articleLive":2,"columnArticles":202,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17847,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.771249760521106,"acs":24154,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31318,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6453093133922502,"acs":7594,"articleLive":2,"columnArticles":86,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11768,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5407506281407035,"acs":6887,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12736,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653591686402751,"acs":77548,"articleLive":2,"columnArticles":580,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118649,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619192629030999,"acs":43179,"articleLive":2,"columnArticles":479,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76842,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5197976746315115,"acs":22711,"articleLive":2,"columnArticles":369,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43692,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5213544478435607,"acs":17383,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33342,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6428767499313752,"acs":2342,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3643,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8666736053288926,"acs":8327,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9608,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6096997690531177,"acs":2640,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4330,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5756940806705081,"acs":1099,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1909,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7071213749823567,"acs":65128,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92103,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7025338424158278,"acs":8096,"articleLive":2,"columnArticles":104,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11524,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3181806872185315,"acs":12788,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40191,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4909443725743855,"acs":3036,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6184,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6932892787968554,"acs":6085,"articleLive":2,"columnArticles":92,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8777,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41360487087969766,"acs":3940,"articleLive":2,"columnArticles":73,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9526,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448676565526146,"acs":37136,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68156,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38,"acs":6213,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16350,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.629045996592845,"acs":5908,"articleLive":2,"columnArticles":103,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9392,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4551244075829384,"acs":3073,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6752,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3900380605659441,"acs":4714,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12086,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6469026548672566,"acs":2924,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4520,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7763061074319353,"acs":3165,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4077,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.535732516590097,"acs":6297,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11754,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5704629250307252,"acs":2785,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4882,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6082145203044704,"acs":78706,"articleLive":2,"columnArticles":871,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":129405,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4329599098146974,"acs":6145,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14193,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47819021987508253,"acs":9417,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19693,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6520859427690529,"acs":6768,"articleLive":2,"columnArticles":95,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10379,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5100571778639984,"acs":9991,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19588,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37045174427951344,"acs":6913,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18661,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6369120981117147,"acs":167434,"articleLive":2,"columnArticles":1134,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":262884,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44194114875572876,"acs":10318,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23347,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4690158820192853,"acs":6615,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14104,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2872174326250764,"acs":4231,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14731,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5612034620140129,"acs":4085,"articleLive":2,"columnArticles":82,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7279,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7150478292862399,"acs":7774,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10872,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44243585471509494,"acs":5311,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12004,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6048616498577709,"acs":4678,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7734,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48593912741580836,"acs":4199,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8641,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38591549295774646,"acs":1370,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3550,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.371111594518164,"acs":1706,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4597,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5696583396017261,"acs":14389,"articleLive":2,"columnArticles":223,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25259,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4783399714805527,"acs":9728,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20337,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4317215036027433,"acs":4973,"articleLive":2,"columnArticles":83,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11519,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32021298809772397,"acs":3067,"articleLive":2,"columnArticles":46,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9578,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5504430124848974,"acs":5467,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9932,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48761709226228667,"acs":3800,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7793,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6869824330411282,"acs":59481,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86583,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6335097426028385,"acs":10534,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16628,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46941147681389944,"acs":38365,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81730,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26726943942133813,"acs":5912,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22120,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6078913601368692,"acs":5685,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9352,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8370656370656371,"acs":7588,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9065,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48377263761879147,"acs":2698,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5577,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43435285341290564,"acs":2329,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5362,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.570404872805446,"acs":1592,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2791,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32246480896294166,"acs":6735,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20886,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166764215929044,"acs":13697,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22211,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47457999341166135,"acs":12966,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27321,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2678050362044742,"acs":2478,"articleLive":2,"columnArticles":54,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9253,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7579659742456998,"acs":8064,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10639,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6185934121836449,"acs":4864,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7863,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4911961141469338,"acs":7281,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14823,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45027105921601335,"acs":4319,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9592,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26544434857635896,"acs":6153,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23180,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46190381459193314,"acs":18575,"articleLive":2,"columnArticles":183,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40214,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6366416342493395,"acs":30604,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48071,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7761527020327219,"acs":3131,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4034,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37253924744580114,"acs":1495,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4013,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3987441130298273,"acs":2032,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5096,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5990740740740741,"acs":647,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1080,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5854277957789649,"acs":13370,"articleLive":2,"columnArticles":260,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22838,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6081643687483104,"acs":11248,"articleLive":2,"columnArticles":204,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18495,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39413406350376495,"acs":7485,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18991,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44151838671411625,"acs":1861,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4215,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6939728353140917,"acs":3270,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4712,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6455117915792074,"acs":20912,"articleLive":2,"columnArticles":326,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32396,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6509801657187401,"acs":45096,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69274,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26726405421069055,"acs":5995,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22431,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4977216964598668,"acs":4260,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8559,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6037530002181977,"acs":5534,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9166,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.507355062013268,"acs":3518,"articleLive":2,"columnArticles":63,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6934,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6366136499060365,"acs":13889,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21817,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6932958651144119,"acs":3454,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4982,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.37009317244539486,"acs":4846,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13094,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7464924082260235,"acs":3884,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5203,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43857566765578637,"acs":739,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1685,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6860509749731306,"acs":17873,"articleLive":2,"columnArticles":251,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26052,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24696522309711286,"acs":6022,"articleLive":2,"columnArticles":86,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24384,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5034654578150757,"acs":26877,"articleLive":2,"columnArticles":295,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53384,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6216936641377896,"acs":12128,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19508,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7265786749482401,"acs":5615,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7728,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46786118117769854,"acs":5379,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11497,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6129264560266451,"acs":6809,"articleLive":2,"columnArticles":88,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11109,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304573665150647,"acs":59907,"articleLive":2,"columnArticles":830,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82013,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4968951917428883,"acs":47372,"articleLive":2,"columnArticles":613,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95336,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5287196025451059,"acs":12132,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22946,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44900371496116176,"acs":2659,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5922,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6551908669282911,"acs":7346,"articleLive":2,"columnArticles":62,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11212,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5106578276389597,"acs":5007,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9805,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7745573770491804,"acs":5906,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7625,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6348758465011287,"acs":3375,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5316,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41202438511667017,"acs":1960,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4757,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5402340892465253,"acs":1477,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2734,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6941363419672653,"acs":21841,"articleLive":2,"columnArticles":355,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31465,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42253950510644783,"acs":8316,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19681,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6305210399916467,"acs":12077,"articleLive":2,"columnArticles":172,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19154,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5265079794427915,"acs":3893,"articleLive":2,"columnArticles":73,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7394,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.843934014070529,"acs":76533,"articleLive":2,"columnArticles":1109,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90686,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6722737155280925,"acs":5875,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8739,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4751016972927479,"acs":3387,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7129,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32715535193669304,"acs":4713,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14406,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5390448531784446,"acs":3341,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6198,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.597399324630815,"acs":11853,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19841,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6625321633568648,"acs":10042,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15157,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5397796817625459,"acs":3087,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5719,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4176713744402342,"acs":2425,"articleLive":2,"columnArticles":44,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5806,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49370918936136327,"acs":3100,"articleLive":2,"columnArticles":62,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6279,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5632226781051847,"acs":3020,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5362,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4696155608313549,"acs":33825,"articleLive":2,"columnArticles":421,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72027,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48206642956175777,"acs":7997,"articleLive":2,"columnArticles":115,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16589,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3436279937066605,"acs":5897,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17161,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4632957439068752,"acs":6368,"articleLive":2,"columnArticles":110,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13745,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5627376425855514,"acs":1184,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2104,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7107362821948489,"acs":10155,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14288,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.659772055719713,"acs":3126,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4738,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49114331723027377,"acs":34770,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70794,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4938727873954484,"acs":2539,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5141,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5954055321143928,"acs":6350,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10665,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47105864432597105,"acs":1237,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2626,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5409972877112456,"acs":2593,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4793,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6205413609916519,"acs":2453,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3953,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5110214666474572,"acs":3547,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6941,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4813603662524526,"acs":2944,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6116,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6172146864569278,"acs":8691,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14081,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5597245576106974,"acs":34952,"articleLive":2,"columnArticles":479,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62445,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5750378979282466,"acs":22760,"articleLive":2,"columnArticles":320,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39580,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5623578076525336,"acs":2719,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4835,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7722190090611143,"acs":8011,"articleLive":2,"columnArticles":96,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10374,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.748591082380242,"acs":18065,"articleLive":2,"columnArticles":315,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24132,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3933328316652871,"acs":5227,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13289,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5989908106334099,"acs":14601,"articleLive":2,"columnArticles":228,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24376,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6816214985196993,"acs":2993,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4391,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6672458731537794,"acs":1536,"articleLive":2,"columnArticles":37,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2302,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5633281972265023,"acs":1828,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3245,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5565099457504521,"acs":1231,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2212,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.48023284016492845,"acs":1980,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4123,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6043273662251977,"acs":12457,"articleLive":2,"columnArticles":253,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20613,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7288640595903165,"acs":7828,"articleLive":2,"columnArticles":100,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10740,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5256430868167202,"acs":13078,"articleLive":2,"columnArticles":200,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24880,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4194680707438909,"acs":3107,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7407,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5679475164011246,"acs":4848,"articleLive":2,"columnArticles":85,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8536,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9219380888290714,"acs":2740,"articleLive":2,"columnArticles":67,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2972,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8240916728645016,"acs":29917,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36303,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071220459695694,"acs":9377,"articleLive":2,"columnArticles":146,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15445,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5851001608422284,"acs":8003,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13678,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49144631996617555,"acs":30221,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61494,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8031506664871415,"acs":5965,"articleLive":2,"columnArticles":84,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7427,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5072403806371535,"acs":2452,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4834,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5193673337637186,"acs":1609,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3098,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5441941074523396,"acs":1570,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2885,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6009852216748769,"acs":976,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1624,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5416086466414693,"acs":8168,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15081,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5016114180478821,"acs":6537,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13032,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7248248437795872,"acs":19139,"articleLive":2,"columnArticles":235,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26405,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.597691673536686,"acs":3625,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6065,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6202185792349727,"acs":1589,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2562,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5065551537070524,"acs":6723,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13272,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318598679383712,"acs":45353,"articleLive":2,"columnArticles":616,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54520,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8104558163729761,"acs":12464,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15379,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41792565947242205,"acs":6971,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16680,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6602090237063472,"acs":2590,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3923,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8113695090439277,"acs":4396,"articleLive":2,"columnArticles":60,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5418,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6460140997830802,"acs":4765,"articleLive":2,"columnArticles":93,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7376,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6035811599844297,"acs":15506,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25690,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5629531970995386,"acs":13664,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24272,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.626252983293556,"acs":6560,"articleLive":2,"columnArticles":98,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10475,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8093403948001926,"acs":53792,"articleLive":2,"columnArticles":699,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66464,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5199051078656683,"acs":7013,"articleLive":2,"columnArticles":156,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13489,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46984003121342177,"acs":6021,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12815,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3597269808724742,"acs":13334,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37067,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6562764059712703,"acs":6990,"articleLive":2,"columnArticles":73,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10651,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8084098013512151,"acs":48102,"articleLive":2,"columnArticles":637,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59502,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4544545721846516,"acs":7728,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17005,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45821529745042494,"acs":6470,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14120,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5976223136716964,"acs":2614,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4374,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7866205007622542,"acs":30443,"articleLive":2,"columnArticles":433,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38701,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4668381656060811,"acs":24136,"articleLive":2,"columnArticles":363,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51701,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36109552138287127,"acs":3217,"articleLive":2,"columnArticles":75,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8909,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8187727724412057,"acs":19775,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24152,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8220055710306406,"acs":8853,"articleLive":2,"columnArticles":83,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10770,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7240346997788739,"acs":21283,"articleLive":2,"columnArticles":383,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29395,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7470737660008966,"acs":14999,"articleLive":2,"columnArticles":226,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20077,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.575432241067018,"acs":17473,"articleLive":2,"columnArticles":272,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30365,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33093525179856115,"acs":1840,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5560,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7513437057991513,"acs":5312,"articleLive":2,"columnArticles":60,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7070,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7557151297550334,"acs":16628,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22003,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.712894908992958,"acs":37052,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51974,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.378174143917217,"acs":5555,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14689,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6666457562260837,"acs":10627,"articleLive":2,"columnArticles":151,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15941,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8318884640049403,"acs":35025,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42103,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7401019701642852,"acs":11758,"articleLive":2,"columnArticles":193,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15887,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.810013890642758,"acs":12829,"articleLive":2,"columnArticles":263,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15838,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4406833280607403,"acs":2786,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6322,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6145281656234954,"acs":10211,"articleLive":2,"columnArticles":193,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16616,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6550327204736678,"acs":6306,"articleLive":2,"columnArticles":113,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9627,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6169397489372742,"acs":30913,"articleLive":2,"columnArticles":513,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50107,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.589396100808369,"acs":2479,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4206,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6141600335148723,"acs":4398,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7161,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5939841216593984,"acs":5312,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8943,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7550900427006622,"acs":24403,"articleLive":2,"columnArticles":478,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32318,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5890438247011952,"acs":5914,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10040,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7273762094479226,"acs":10224,"articleLive":2,"columnArticles":182,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14056,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4725030826140567,"acs":5748,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12165,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6892960220855816,"acs":5493,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7969,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46257868967125204,"acs":5952,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12867,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7717943058927389,"acs":6994,"articleLive":2,"columnArticles":157,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9062,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3788517677586766,"acs":1168,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3083,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5354362780593772,"acs":11831,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22096,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.686887032328369,"acs":9455,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13765,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5437324828452692,"acs":5626,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10347,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49019267488283286,"acs":5648,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11522,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5852272727272727,"acs":3502,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5984,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42142520056630484,"acs":1786,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4238,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.705948453981948,"acs":38950,"articleLive":2,"columnArticles":623,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55174,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6398700197795988,"acs":9058,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14156,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3986499425507468,"acs":8327,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20888,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5740133735413662,"acs":4378,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7627,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.47999434469107877,"acs":3395,"articleLive":2,"columnArticles":47,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7073,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8203178450651915,"acs":41965,"articleLive":2,"columnArticles":638,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51157,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.544601739723691,"acs":12772,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23452,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5922970843183609,"acs":6013,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10152,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.366550962448722,"acs":5808,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15845,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43489929172200087,"acs":15719,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36144,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7400681044267877,"acs":7824,"articleLive":2,"columnArticles":116,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10572,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3053830227743271,"acs":3245,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10626,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5062822164948454,"acs":3143,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6208,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8480565371024735,"acs":8400,"articleLive":2,"columnArticles":84,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9905,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7545848869949014,"acs":29748,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39423,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44492743930983747,"acs":6653,"articleLive":2,"columnArticles":72,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14953,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28403603962367463,"acs":11412,"articleLive":2,"columnArticles":154,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40178,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2816600252697055,"acs":2898,"articleLive":2,"columnArticles":71,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10289,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6612875536480687,"acs":3852,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5825,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315741583257507,"acs":45828,"articleLive":2,"columnArticles":507,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62643,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5300668151447662,"acs":4046,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7633,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4951302974466965,"acs":5643,"articleLive":2,"columnArticles":112,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11397,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5511319281811085,"acs":2824,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5124,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5054296506137866,"acs":8564,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16944,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4023805676738299,"acs":7471,"articleLive":2,"columnArticles":202,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18567,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5254739336492891,"acs":5322,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10128,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3653560830860534,"acs":4925,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13480,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6738868832731648,"acs":3360,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4986,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250552518320344,"acs":85116,"articleLive":2,"columnArticles":1089,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103164,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5384265575261482,"acs":7104,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13194,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41825628057830794,"acs":15217,"articleLive":2,"columnArticles":222,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36382,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5251714577557274,"acs":3599,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6853,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6062430323299889,"acs":2719,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4485,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900660510663469,"acs":48085,"articleLive":2,"columnArticles":577,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60862,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799503125938464,"acs":21243,"articleLive":2,"columnArticles":265,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36629,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5129878278328523,"acs":8176,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15938,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40394492405201615,"acs":7393,"articleLive":2,"columnArticles":168,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18302,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7395496989266079,"acs":16949,"articleLive":2,"columnArticles":226,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22918,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5745640209535177,"acs":8665,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15081,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5030096308186196,"acs":7521,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14952,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32428449546265414,"acs":4181,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12893,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8612405880243815,"acs":7206,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8367,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8373931279238587,"acs":10382,"articleLive":2,"columnArticles":161,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12398,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7277726856095326,"acs":16674,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22911,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7318246284762903,"acs":11868,"articleLive":2,"columnArticles":155,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16217,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6922457075559413,"acs":11168,"articleLive":2,"columnArticles":174,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16133,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3228246271294267,"acs":4567,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14147,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5442119944211995,"acs":1951,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3585,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7009143034247637,"acs":13569,"articleLive":2,"columnArticles":203,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19359,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31194800039694354,"acs":6287,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20154,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6952299950386278,"acs":9809,"articleLive":2,"columnArticles":170,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14109,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5412677878395861,"acs":4184,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7730,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8311979689437327,"acs":28156,"articleLive":2,"columnArticles":480,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33874,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3538435791587638,"acs":6343,"articleLive":2,"columnArticles":115,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17926,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39965252815720104,"acs":6671,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16692,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4038421920065925,"acs":7841,"articleLive":2,"columnArticles":143,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19416,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8560924369747899,"acs":4075,"articleLive":2,"columnArticles":60,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4760,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6650994715573516,"acs":17117,"articleLive":2,"columnArticles":275,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25736,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7482139104853961,"acs":14243,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19036,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4131357629154986,"acs":10316,"articleLive":2,"columnArticles":144,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":24970,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3738590726542534,"acs":1024,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2739,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7621706508462747,"acs":4368,"articleLive":2,"columnArticles":66,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5731,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6711136477134908,"acs":9407,"articleLive":2,"columnArticles":152,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14017,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6049185563717662,"acs":5682,"articleLive":2,"columnArticles":97,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9393,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41686157771635124,"acs":3921,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9406,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7531492058524372,"acs":9626,"articleLive":2,"columnArticles":175,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12781,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6910789924661299,"acs":21373,"articleLive":2,"columnArticles":362,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30927,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4929192036669631,"acs":7205,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14617,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5077593248026137,"acs":5595,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11019,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5682829702506442,"acs":4852,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8538,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6665907278733341,"acs":5852,"articleLive":2,"columnArticles":66,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8779,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6151584749655489,"acs":13392,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21770,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.806792152176078,"acs":8101,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10041,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4752475247524752,"acs":7440,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15655,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.550609583215197,"acs":7768,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14108,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5560564484515876,"acs":2837,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5102,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6933002796847191,"acs":10907,"articleLive":2,"columnArticles":222,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15732,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6034412460246269,"acs":7400,"articleLive":2,"columnArticles":148,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12263,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6849158528984002,"acs":6593,"articleLive":2,"columnArticles":178,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9626,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40860215053763443,"acs":2812,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6882,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.519121727590783,"acs":12909,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24867,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7326564665290308,"acs":25906,"articleLive":2,"columnArticles":415,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35359,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4185615095139662,"acs":7897,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18867,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5970957420625154,"acs":2426,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4063,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.748780487804878,"acs":2763,"articleLive":2,"columnArticles":34,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3690,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5405516251409823,"acs":10544,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19506,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541555724610118,"acs":34965,"articleLive":2,"columnArticles":510,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63096,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3976110224114482,"acs":6724,"articleLive":2,"columnArticles":144,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16911,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43923825181531717,"acs":3206,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7299,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7088546679499519,"acs":1473,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2078,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6549707602339181,"acs":1120,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1710,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5930232558139535,"acs":867,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1462,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5051369863013698,"acs":1180,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2336,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.585,"acs":702,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1200,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462607608847899,"acs":78544,"articleLive":2,"columnArticles":1031,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92813,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39376252286784563,"acs":4520,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11479,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6407230196703881,"acs":6026,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9405,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4657184536834427,"acs":2554,"articleLive":2,"columnArticles":45,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5484,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6200722238940716,"acs":4121,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6646,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8219399801965115,"acs":43165,"articleLive":2,"columnArticles":639,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":52516,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5867458405691558,"acs":10474,"articleLive":2,"columnArticles":175,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17851,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4827727645611157,"acs":32956,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68264,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5619335347432024,"acs":3720,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6620,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6984792868379653,"acs":2664,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3814,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6476781078742428,"acs":17964,"articleLive":2,"columnArticles":378,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27736,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916067310546384,"acs":34670,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43797,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4110169491525424,"acs":5626,"articleLive":2,"columnArticles":140,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13688,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5267267267267267,"acs":2631,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4995,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8568969227458575,"acs":3982,"articleLive":2,"columnArticles":52,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4647,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729105588381219,"acs":12702,"articleLive":2,"columnArticles":215,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22171,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6171768885173963,"acs":5907,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9571,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7114035087719298,"acs":9732,"articleLive":2,"columnArticles":155,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13680,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6278343050950802,"acs":16475,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26241,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.802704773325339,"acs":24098,"articleLive":2,"columnArticles":342,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30021,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.522915689034882,"acs":10029,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19179,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49895213345628303,"acs":5952,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11929,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36473214285714284,"acs":1634,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4480,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3963202779532533,"acs":5019,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12664,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6328199177128389,"acs":11997,"articleLive":2,"columnArticles":205,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18958,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.522949732870569,"acs":13410,"articleLive":2,"columnArticles":209,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25643,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.632228771706229,"acs":7937,"articleLive":2,"columnArticles":138,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12554,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44234255537164024,"acs":5612,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12687,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5966057441253264,"acs":2285,"articleLive":2,"columnArticles":47,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3830,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7454050374404356,"acs":15330,"articleLive":2,"columnArticles":311,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20566,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5009360108917631,"acs":5887,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11752,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42765096990883544,"acs":6239,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14589,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5913292253521126,"acs":2687,"articleLive":2,"columnArticles":64,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4544,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7684454085321765,"acs":26569,"articleLive":2,"columnArticles":370,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34575,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3095538925065604,"acs":6370,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20578,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48447015834348356,"acs":6364,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13136,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.617196261682243,"acs":1651,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2675,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7072415435921867,"acs":2969,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4198,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7950377562028047,"acs":2211,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2781,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8429048203771922,"acs":53543,"articleLive":2,"columnArticles":724,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63522,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5439799454397994,"acs":7378,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13563,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6165890170320019,"acs":8073,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13093,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.674473169671953,"acs":15523,"articleLive":2,"columnArticles":165,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23015,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7181208053691275,"acs":1926,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2682,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7216450216450216,"acs":15003,"articleLive":2,"columnArticles":232,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20790,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8650424308787298,"acs":12640,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14612,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2906261095987691,"acs":4911,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16898,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5803007191109174,"acs":2663,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4589,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5648766328011611,"acs":1946,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3445,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692519315132384,"acs":128598,"articleLive":2,"columnArticles":1288,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147941,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5140712945590994,"acs":10138,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19721,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5865893385052818,"acs":31152,"articleLive":2,"columnArticles":404,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53107,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30026833631484795,"acs":3357,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11180,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8079673135852911,"acs":791,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":979,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6599197347757808,"acs":3782,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5731,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585335768100519,"acs":70993,"articleLive":2,"columnArticles":681,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82691,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31049786169611876,"acs":7696,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24786,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2372462259239979,"acs":7292,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30736,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6909961112772959,"acs":11550,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16715,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8562185478073329,"acs":1191,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1391,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6716775085105666,"acs":19928,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29669,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6621528120984481,"acs":6699,"articleLive":2,"columnArticles":79,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10117,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5679319947237286,"acs":7750,"articleLive":2,"columnArticles":147,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13646,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3697976640894884,"acs":2248,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6079,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5426887762094011,"acs":3960,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7297,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5372204786190663,"acs":10955,"articleLive":2,"columnArticles":166,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20392,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39055834231869113,"acs":8331,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21331,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3346353332906448,"acs":5226,"articleLive":2,"columnArticles":66,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15617,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3752603082049146,"acs":2703,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7203,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.302099533437014,"acs":777,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2572,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.590145094095676,"acs":4108,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6961,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7167625169147497,"acs":25425,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35472,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5130560057626509,"acs":8547,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16659,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5947503201024328,"acs":7432,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12496,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36315615714757343,"acs":3300,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9087,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8408104196816208,"acs":581,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":691,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5898449376710246,"acs":9700,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16445,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.552686607873443,"acs":6079,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10999,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5471737982039091,"acs":5179,"articleLive":2,"columnArticles":77,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9465,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5766307430516165,"acs":5083,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8815,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6783103168155971,"acs":4175,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6155,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488414114109774,"acs":58722,"articleLive":2,"columnArticles":745,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69179,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37993200782940145,"acs":11064,"articleLive":2,"columnArticles":149,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29121,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3233061107235195,"acs":7878,"articleLive":2,"columnArticles":137,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24367,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34284780477176163,"acs":3147,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9179,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7327494125186926,"acs":3430,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4681,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6744664716715415,"acs":24904,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36924,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29773095623987034,"acs":5511,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18510,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33280360217189775,"acs":2513,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7551,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3968158606188045,"acs":2642,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6658,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.708253358925144,"acs":738,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1042,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5774256967734475,"acs":9986,"articleLive":2,"columnArticles":171,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17294,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42781115879828324,"acs":4984,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11650,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6620875751257206,"acs":5398,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8153,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6160140268848626,"acs":3162,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5133,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5033632286995515,"acs":3592,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7136,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851168156907989,"acs":29942,"articleLive":2,"columnArticles":359,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38137,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6908921500116468,"acs":8898,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12879,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5674476277491353,"acs":8695,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15323,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32838224767358626,"acs":1835,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5588,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6151736745886655,"acs":2692,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4376,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6189473684210526,"acs":294,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":475,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7892679786647048,"acs":17165,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21748,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4532250882060768,"acs":13231,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29193,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4402961055680721,"acs":4104,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9321,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36639526276831974,"acs":4455,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12159,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5990566037735849,"acs":127,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":212,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5391424075531078,"acs":16446,"articleLive":2,"columnArticles":247,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30504,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31761705466910806,"acs":4857,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15292,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4611455108359133,"acs":5958,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12920,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38487549953888717,"acs":2504,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6506,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5516594787174198,"acs":2942,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5333,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5462454086000718,"acs":19779,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36209,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5539541759053954,"acs":7495,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13530,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41410009624639077,"acs":5163,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12468,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5370174510840825,"acs":4062,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7564,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7119675456389453,"acs":351,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":493,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6690217391304348,"acs":2462,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3680,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6592868217054264,"acs":21262,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32250,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8169209431345353,"acs":11191,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13699,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5110687664630388,"acs":9119,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17843,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29575257101349545,"acs":7736,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26157,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7103174603174603,"acs":537,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":756,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4382412496384148,"acs":3030,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6914,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5788688096380404,"acs":10859,"articleLive":2,"columnArticles":165,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18759,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7682926829268293,"acs":7875,"articleLive":2,"columnArticles":107,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10250,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6226677805625174,"acs":4472,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7182,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3663335086796423,"acs":3482,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9505,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5750133120340788,"acs":8639,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15024,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.779985233908316,"acs":11621,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14899,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3095307490527543,"acs":4248,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13724,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3784814956123617,"acs":3968,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10484,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5412844036697247,"acs":649,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1199,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7248217468805704,"acs":3253,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4488,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44579739556908504,"acs":7908,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17739,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39892217069808245,"acs":12732,"articleLive":2,"columnArticles":203,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":31916,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.456093666844066,"acs":2571,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5637,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47370848708487084,"acs":2054,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4336,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8982035928143712,"acs":1650,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1837,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7586206896551724,"acs":3410,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4495,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048677605770448,"acs":19081,"articleLive":2,"columnArticles":322,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23707,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2951156471601829,"acs":4453,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15089,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3265753424657534,"acs":4768,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14600,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5956632653061225,"acs":4203,"articleLive":2,"columnArticles":67,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7056,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4762801304659118,"acs":17961,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37711,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32511125238397964,"acs":5114,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15730,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5825933454584359,"acs":10891,"articleLive":2,"columnArticles":203,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18694,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6190329771696518,"acs":16106,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26018,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.632420091324201,"acs":277,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":438,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8075497915701714,"acs":3487,"articleLive":2,"columnArticles":46,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4318,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6709681968831536,"acs":9515,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14181,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6852946576096934,"acs":18664,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27235,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6643030225736514,"acs":26044,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39205,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299638989169675,"acs":2382,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5540,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6260162601626016,"acs":385,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":615,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8254233245886,"acs":3461,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4193,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8391621755914842,"acs":43910,"articleLive":2,"columnArticles":698,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52326,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2937853107344633,"acs":3848,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13098,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2685123661867848,"acs":3637,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13545,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5786458333333333,"acs":1111,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1920,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44508470669586264,"acs":7724,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17354,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5310706510983574,"acs":5367,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10106,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3135771017533343,"acs":4185,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13346,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46505905511811024,"acs":1890,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4064,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7491535857186826,"acs":2434,"articleLive":2,"columnArticles":41,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3249,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628959276018099,"acs":293,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":442,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6724222086638194,"acs":11021,"articleLive":2,"columnArticles":149,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16390,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41927789222595685,"acs":3867,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9223,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6788083463997105,"acs":16884,"articleLive":2,"columnArticles":206,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24873,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48988309352517984,"acs":2179,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4448,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7835400225479143,"acs":695,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":887,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443822802421443,"acs":57049,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67563,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.415257048092869,"acs":3756,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9045,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7360275150472915,"acs":3424,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4652,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34145828955662955,"acs":1625,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4759,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5456794822992006,"acs":2867,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5254,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6395045632333768,"acs":9810,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15340,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.511922556765606,"acs":7192,"articleLive":2,"columnArticles":125,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14049,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27025787965616044,"acs":2358,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8725,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6101892285298399,"acs":2096,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3435,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7355371900826446,"acs":445,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":605,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7227508650519031,"acs":1671,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2312,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8212464176422014,"acs":16907,"articleLive":2,"columnArticles":286,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20587,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49687529148400333,"acs":5327,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10721,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2755001099142669,"acs":5013,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18196,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6214689265536724,"acs":1760,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2832,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5910780669144982,"acs":318,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":538,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6737958139109771,"acs":7372,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10941,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3713985594237695,"acs":2475,"articleLive":2,"columnArticles":43,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6664,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4409507303788066,"acs":1781,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4039,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14971546192032933,"acs":2473,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16518,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.783493369913123,"acs":3427,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4374,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6257306746790494,"acs":11454,"articleLive":2,"columnArticles":197,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18305,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5431368926658046,"acs":2940,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5413,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38650668764752166,"acs":3930,"articleLive":2,"columnArticles":85,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10168,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3810487007935273,"acs":2449,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6427,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8417721518987342,"acs":399,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":474,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5242669680416903,"acs":8350,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15927,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7681489141675284,"acs":7428,"articleLive":2,"columnArticles":115,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9670,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4933724066994003,"acs":25422,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51527,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3188028627195836,"acs":1470,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4611,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6566046848587298,"acs":2719,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4141,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5253012048192771,"acs":436,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":830,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5485687470671047,"acs":1169,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2131,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7069865254303295,"acs":9077,"articleLive":2,"columnArticles":177,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12839,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8065973791233619,"acs":5355,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6639,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7116843702579666,"acs":2814,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3954,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4010088272383354,"acs":1272,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3172,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6594861147158059,"acs":12705,"articleLive":2,"columnArticles":217,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19265,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7708877700592697,"acs":12096,"articleLive":2,"columnArticles":278,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15691,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4509612705488994,"acs":6474,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14356,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4518,"acs":2259,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5000,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.546692607003891,"acs":1124,"articleLive":2,"columnArticles":23,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2056,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.40971867007672635,"acs":801,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1955,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5366924588553181,"acs":34958,"articleLive":2,"columnArticles":356,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65136,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5148521837296267,"acs":7297,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14173,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2779642058165548,"acs":3479,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12516,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.474036850921273,"acs":2547,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5373,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7946484131922837,"acs":1277,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1607,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6832129963898917,"acs":757,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1108,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6564497931553216,"acs":6982,"articleLive":2,"columnArticles":177,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10636,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5060307017543859,"acs":3692,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7296,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27387929668937117,"acs":3458,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12626,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38290598290598293,"acs":2016,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5265,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.781327759530208,"acs":7850,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10047,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4647338080705324,"acs":5482,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11796,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29971734302442965,"acs":8907,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29718,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4125230202578269,"acs":1344,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3258,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7381818181818182,"acs":406,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":550,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.725147845677274,"acs":2575,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3551,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8121226378107113,"acs":20714,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25506,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725601554326708,"acs":7662,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13382,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.544858209708346,"acs":5399,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9909,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.663594470046083,"acs":5184,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7812,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6031439602868174,"acs":2187,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3626,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4439119170984456,"acs":6854,"articleLive":2,"columnArticles":129,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15440,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.758336279014964,"acs":12872,"articleLive":2,"columnArticles":236,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16974,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5266068575642129,"acs":4285,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8137,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46757990867579907,"acs":2048,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4380,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.850952748100011,"acs":38629,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45395,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35428089413749475,"acs":7560,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21339,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3642950297058397,"acs":2514,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6901,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4351297405189621,"acs":2616,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6012,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7634508348794063,"acs":823,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1078,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.38971583220568334,"acs":2016,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5173,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8300370828182941,"acs":17459,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21034,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.497134670487106,"acs":6940,"articleLive":2,"columnArticles":112,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13960,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4643992098256463,"acs":5407,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11643,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38450339695891295,"acs":2377,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6182,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5213946117274167,"acs":329,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":631,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8959835221421215,"acs":3480,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3884,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8281822176651531,"acs":16962,"articleLive":2,"columnArticles":356,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20481,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5998055735580039,"acs":3702,"articleLive":2,"columnArticles":86,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6172,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47094474153297683,"acs":2642,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5610,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4020964360587002,"acs":959,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2385,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8052929292929293,"acs":19931,"articleLive":2,"columnArticles":267,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24750,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8669309508313118,"acs":14652,"articleLive":2,"columnArticles":192,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16901,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5174750356633381,"acs":4353,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8412,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4888977795559112,"acs":2444,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4999,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6523297491039427,"acs":182,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":279,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.7999295526593871,"acs":2271,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2839,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6354260456740607,"acs":7763,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12217,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4619146413752223,"acs":6234,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13496,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3980650499649927,"acs":6254,"articleLive":2,"columnArticles":112,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15711,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.525985013294658,"acs":2176,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4137,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5251959686450168,"acs":469,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":893,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7982102908277405,"acs":1784,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2235,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7091736569694806,"acs":7947,"articleLive":2,"columnArticles":181,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11206,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.610318331503842,"acs":3892,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6377,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47792333818534694,"acs":2955,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6183,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3835534213685474,"acs":1278,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3332,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7817001028806584,"acs":12157,"articleLive":2,"columnArticles":185,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15552,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3469783214242461,"acs":5730,"articleLive":2,"columnArticles":120,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16514,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5852665852665853,"acs":4314,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7371,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5031589408674665,"acs":14176,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28174,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6994780014914244,"acs":938,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1341,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7027818448023426,"acs":1440,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2049,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6945260507224654,"acs":11584,"articleLive":2,"columnArticles":184,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16679,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3591224156237697,"acs":30102,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83821,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26243139863628806,"acs":6312,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24052,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49610093197235783,"acs":15650,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31546,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.638961038961039,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":385,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7289002557544757,"acs":1710,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2346,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6748476229175132,"acs":8304,"articleLive":2,"columnArticles":194,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12305,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43314240568832707,"acs":2193,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5063,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4908909408535064,"acs":1967,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4007,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3700234192037471,"acs":632,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1708,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8692156679442834,"acs":46490,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53485,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6457835642618251,"acs":10813,"articleLive":2,"columnArticles":167,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16744,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5152107779226424,"acs":4742,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9204,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5064810578829271,"acs":23249,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45903,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5621890547263682,"acs":339,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":603,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7878810082063306,"acs":10753,"articleLive":2,"columnArticles":146,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13648,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4803265873360549,"acs":5530,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11513,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5752598055648676,"acs":3432,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5966,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3580167417900837,"acs":1112,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3106,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6219020172910663,"acs":2158,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3470,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.531933508311461,"acs":608,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1143,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4714212152420185,"acs":1831,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3884,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7921706765917852,"acs":11919,"articleLive":2,"columnArticles":204,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15046,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4593311758360302,"acs":2129,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4635,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232710908808773,"acs":27966,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38666,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4890995260663507,"acs":1032,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2110,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4492097192734135,"acs":28563,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63585,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3106386641418489,"acs":3609,"articleLive":2,"columnArticles":103,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11618,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539212757646086,"acs":28458,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43519,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47096774193548385,"acs":2701,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5735,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7019464720194647,"acs":577,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":822,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8414186710150836,"acs":2064,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2453,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7097071902005202,"acs":8459,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11919,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6968603167688334,"acs":22395,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32137,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3627814009507092,"acs":28314,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78047,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4849483944954128,"acs":3383,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6976,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5938356164383561,"acs":867,"articleLive":2,"columnArticles":37,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1460,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.70276008492569,"acs":1324,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1884,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7480451781059948,"acs":11193,"articleLive":2,"columnArticles":222,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14963,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5309085681426107,"acs":3693,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6956,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4568627450980392,"acs":3262,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7140,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.47079037800687284,"acs":2192,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4656,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6805764680576468,"acs":9492,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13947,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6294820717131474,"acs":6004,"articleLive":2,"columnArticles":128,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9538,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4221799619657692,"acs":4218,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9991,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4108271503160209,"acs":2990,"articleLive":2,"columnArticles":50,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7278,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7949790794979079,"acs":380,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":478,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9207592648388069,"acs":3056,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3319,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6379233709663081,"acs":7176,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11249,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4292109681029659,"acs":4602,"articleLive":2,"columnArticles":96,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10722,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5390766056229043,"acs":4180,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7754,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4302055702917772,"acs":2595,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6032,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6911468812877264,"acs":687,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":994,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6100937918713711,"acs":4098,"articleLive":2,"columnArticles":81,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6717,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4756845116469146,"acs":2328,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4894,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5521229645411657,"acs":3628,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6571,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37606837606837606,"acs":1408,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3744,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7886255924170616,"acs":832,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1055,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.765528781793842,"acs":11437,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14940,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8562823449563078,"acs":10093,"articleLive":2,"columnArticles":171,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11787,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37030058322117543,"acs":4127,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11145,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36578864847914705,"acs":2333,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6378,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5194029850746269,"acs":348,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":670,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8427237435736019,"acs":16064,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19062,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5508045977011494,"acs":5990,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10875,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47423251690125234,"acs":4279,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9023,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4613980177360459,"acs":1769,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3834,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7819048995519584,"acs":5410,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6919,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5186246418338109,"acs":181,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":349,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6479802143446002,"acs":5502,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8491,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6647637556176363,"acs":5473,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8233,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5193916349809886,"acs":4098,"articleLive":2,"columnArticles":60,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7890,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29228522754928205,"acs":1201,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4109,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7978793903247183,"acs":1204,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1509,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42138935306755787,"acs":8826,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20945,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34998360476554813,"acs":6404,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18298,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34169845412567756,"acs":3404,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9962,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541345032487366,"acs":11779,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18007,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7169230769230769,"acs":233,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":325,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7115384615384616,"acs":1554,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2184,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6448611931482575,"acs":13101,"articleLive":2,"columnArticles":143,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20316,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8087118150961694,"acs":10007,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12374,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5135683094198378,"acs":6586,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12824,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4143130176258229,"acs":3902,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9418,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5807560137457045,"acs":169,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":291,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7857142857142857,"acs":1859,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2366,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48799882197025474,"acs":6628,"articleLive":2,"columnArticles":122,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13582,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5739396255254108,"acs":4506,"articleLive":2,"columnArticles":71,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7851,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5213921901528014,"acs":3071,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5890,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5185022026431718,"acs":2354,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4540,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6833882155118055,"acs":9754,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14273,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37899459756432563,"acs":4139,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10921,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2626110902490925,"acs":4196,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15978,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40937138449672195,"acs":2123,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5186,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.57125,"acs":457,"articleLive":2,"columnArticles":27,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":800,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48831493618489136,"acs":11325,"articleLive":2,"columnArticles":148,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23192,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6621466035563516,"acs":5176,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7817,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.586312877778916,"acs":5723,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9761,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2679100383982447,"acs":2442,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9115,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6258652094717668,"acs":1718,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2745,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6216216216216216,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":296,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6620370370370371,"acs":858,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1296,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7940683811212927,"acs":8059,"articleLive":2,"columnArticles":190,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10149,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5131869185767718,"acs":5351,"articleLive":2,"columnArticles":73,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10427,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3456957490074562,"acs":3570,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10327,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2985341437254201,"acs":1670,"articleLive":2,"columnArticles":39,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5594,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7530050687907314,"acs":10399,"articleLive":2,"columnArticles":155,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13810,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6984942220147076,"acs":5984,"articleLive":2,"columnArticles":96,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8567,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37358024691358027,"acs":25721,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68850,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3681782020684169,"acs":2314,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6285,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5048543689320388,"acs":104,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":206,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9018315018315018,"acs":2462,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2730,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8098134630981346,"acs":19970,"articleLive":2,"columnArticles":199,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24660,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7149742115498435,"acs":8456,"articleLive":2,"columnArticles":105,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11827,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6559749492213948,"acs":7751,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11816,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28574521052061913,"acs":2640,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9239,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4386252045826514,"acs":268,"articleLive":2,"columnArticles":21,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":611,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7947814413960903,"acs":9473,"articleLive":2,"columnArticles":138,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11919,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8674212708730248,"acs":7740,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8923,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6826675810046289,"acs":3982,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5833,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4875141884222474,"acs":859,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1762,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7400332225913622,"acs":891,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1204,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8246003826451892,"acs":13361,"articleLive":2,"columnArticles":212,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16203,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6844929855945768,"acs":43620,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63726,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3519028909869231,"acs":6001,"articleLive":2,"columnArticles":129,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17053,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5097155730780062,"acs":3620,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7102,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7094017094017094,"acs":415,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":585,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7957486136783734,"acs":7749,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9738,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42931377497995665,"acs":28916,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67354,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5749005744586831,"acs":6505,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11315,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3895175699821322,"acs":1962,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5037,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5137101287073307,"acs":918,"articleLive":2,"columnArticles":29,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1787,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6555555555555556,"acs":118,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":180,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5076427996781979,"acs":631,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1243,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8003954867977201,"acs":6881,"articleLive":2,"columnArticles":112,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8597,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5344515704653839,"acs":6500,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12162,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336453757158957,"acs":27549,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43477,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.35940868493994454,"acs":2334,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6494,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6828387778462622,"acs":7755,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11357,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3282000234219464,"acs":5605,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17078,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6097748208802457,"acs":2383,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3908,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4008854900382371,"acs":1992,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4969,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7032967032967034,"acs":192,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":273,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6460396039603961,"acs":1044,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1616,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7890894341918475,"acs":11673,"articleLive":2,"columnArticles":121,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14793,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6814165042235217,"acs":10487,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15390,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3562629979203327,"acs":4454,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12502,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45117634811576096,"acs":2167,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4803,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.634508348794063,"acs":342,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":539,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7667671018859502,"acs":6871,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8961,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7718558282208589,"acs":4026,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5216,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6189591078066915,"acs":3330,"articleLive":2,"columnArticles":68,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5380,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31274292059966685,"acs":2253,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7204,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9051804215791354,"acs":12668,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13995,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.387188108299416,"acs":4376,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11302,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5128726287262872,"acs":5299,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10332,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5975215517241379,"acs":2218,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3712,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7444608567208272,"acs":504,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":677,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5423728813559322,"acs":160,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":295,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7881397942743834,"acs":12719,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16138,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45574764937822265,"acs":7513,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16485,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.276346171608017,"acs":5984,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21654,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6211332312404287,"acs":2028,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3265,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8118657298985168,"acs":2080,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2562,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.893491124260355,"acs":302,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":338,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7463768115942029,"acs":412,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":552,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7279066971263677,"acs":6054,"articleLive":2,"columnArticles":94,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8317,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8202570395587575,"acs":31082,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37893,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4291433146517214,"acs":2144,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4996,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4131111111111111,"acs":1859,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4500,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7716723904672703,"acs":7415,"articleLive":2,"columnArticles":99,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9609,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3531790213888075,"acs":6027,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17065,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27827278958190543,"acs":3654,"articleLive":2,"columnArticles":110,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13131,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3757562662057044,"acs":1739,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4628,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6896304269824184,"acs":1922,"articleLive":2,"columnArticles":37,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2787,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5210970464135021,"acs":247,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":474,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5713678393027952,"acs":5376,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9409,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6457099659821091,"acs":5125,"articleLive":2,"columnArticles":65,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7937,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31701738334858187,"acs":2772,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8744,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2706380793426627,"acs":2108,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7789,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7071905114899926,"acs":954,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1349,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4672131147540984,"acs":285,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":610,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.337707182320442,"acs":489,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1448,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5912434852960545,"acs":31424,"articleLive":2,"columnArticles":409,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53149,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45816152687587963,"acs":37112,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81002,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5311695002575991,"acs":2062,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3882,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5056784219964137,"acs":846,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1673,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5312869947573144,"acs":6283,"articleLive":2,"columnArticles":78,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11826,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3102137044642178,"acs":4079,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13149,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6294665537679932,"acs":3717,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5905,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4362813370473538,"acs":1253,"articleLive":2,"columnArticles":35,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2872,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6608238387379491,"acs":754,"articleLive":2,"columnArticles":27,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1141,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4519774011299435,"acs":80,"articleLive":2,"columnArticles":4,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":177,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6439003436426117,"acs":7495,"articleLive":2,"columnArticles":102,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11640,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27888870676938204,"acs":3403,"articleLive":2,"columnArticles":70,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12202,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5706351122917169,"acs":4726,"articleLive":2,"columnArticles":94,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8282,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42329303592712414,"acs":2486,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5873,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5888077858880778,"acs":484,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":822,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.668,"acs":167,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":250,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32563494278537536,"acs":4667,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14332,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6754369825206992,"acs":3671,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5435,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5687784389219461,"acs":3250,"articleLive":2,"columnArticles":69,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5714,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2695319007163085,"acs":1618,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6003,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8365236974101751,"acs":8172,"articleLive":2,"columnArticles":83,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9769,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44068027210884353,"acs":3239,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7350,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3913641364136414,"acs":2846,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7272,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5517403574788335,"acs":1173,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2126,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28412537917087965,"acs":281,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":989,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.48880597014925375,"acs":131,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":268,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.39233038348082594,"acs":399,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1017,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9148164146868251,"acs":10589,"articleLive":2,"columnArticles":92,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11575,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34407393530660674,"acs":5510,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16014,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3610026550054662,"acs":4623,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12806,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23688825123545354,"acs":1486,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6273,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.37579617834394907,"acs":59,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":157,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6939573974786263,"acs":4789,"articleLive":2,"columnArticles":60,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6901,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34432515337423314,"acs":3592,"articleLive":2,"columnArticles":60,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10432,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4132288545747868,"acs":1793,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4339,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39656393907190934,"acs":2239,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5646,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9137037037037037,"acs":12335,"articleLive":2,"columnArticles":107,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13500,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.47956616052060735,"acs":5527,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11525,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5605479452054795,"acs":2046,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3650,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3272235576923077,"acs":1089,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3328,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5439900867410161,"acs":439,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":807,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7389033942558747,"acs":283,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":383,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7391829562925544,"acs":6731,"articleLive":2,"columnArticles":94,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9106,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45002805161497156,"acs":5615,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12477,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24236597184831937,"acs":3151,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13001,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34537177541729897,"acs":1138,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3295,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6237337192474675,"acs":431,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":691,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7954070981210856,"acs":381,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":479,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7719298245614035,"acs":4796,"articleLive":2,"columnArticles":85,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6213,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39254896589508287,"acs":2866,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7301,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4077922077922078,"acs":1884,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4620,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5775432424508942,"acs":1970,"articleLive":2,"columnArticles":52,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3411,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6640243902439025,"acs":6534,"articleLive":2,"columnArticles":75,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9840,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3043081312410842,"acs":5333,"articleLive":2,"columnArticles":81,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17525,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5415766738660908,"acs":4012,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7408,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5149572649572649,"acs":964,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1872,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5379464285714286,"acs":241,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":448,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5541666666666667,"acs":133,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":240,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6688741721854304,"acs":303,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":453,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5457122608079377,"acs":6930,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12699,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3255100475533057,"acs":4244,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13038,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4809496236247829,"acs":4153,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8635,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49617737003058104,"acs":2596,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5232,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.45625,"acs":146,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":320,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6059499661933739,"acs":4481,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7395,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42355336840319024,"acs":2496,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5893,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41402714932126694,"acs":1464,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3536,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2779524023349798,"acs":619,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2227,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5345650500384912,"acs":6944,"articleLive":2,"columnArticles":64,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12990,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4306919211441825,"acs":5571,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12935,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6153953229398663,"acs":4421,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7184,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.384125428711416,"acs":3136,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8164,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7369519832985386,"acs":353,"articleLive":2,"columnArticles":13,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":479,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7241379310344828,"acs":42,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":58,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7783762985763756,"acs":6069,"articleLive":2,"columnArticles":57,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7797,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35806178260534627,"acs":4648,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12981,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.278836029482148,"acs":2913,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10447,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47958069447477614,"acs":2196,"articleLive":2,"columnArticles":49,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4579,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5511811023622047,"acs":490,"articleLive":2,"columnArticles":19,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":889,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4552238805970149,"acs":183,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":402,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7402499053388868,"acs":3910,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5282,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3813996560391586,"acs":2883,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7559,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2894273127753304,"acs":1971,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6810,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24723247232472326,"acs":737,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2981,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5371900826446281,"acs":260,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":484,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8126571209968303,"acs":7435,"articleLive":2,"columnArticles":84,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9149,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5806548513066987,"acs":5799,"articleLive":2,"columnArticles":92,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9987,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29815268489704033,"acs":4503,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15103,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4573816155988858,"acs":821,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1795,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6578947368421053,"acs":50,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":76,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5800161648817943,"acs":5741,"articleLive":2,"columnArticles":64,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9898,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41270888302550574,"acs":5631,"articleLive":2,"columnArticles":79,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13644,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2757208008038958,"acs":3567,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12937,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.46098596147567744,"acs":1412,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3063,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6764705882352942,"acs":184,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":272,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.45555555555555555,"acs":41,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":90,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6096774193548387,"acs":189,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":310,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.660437629771602,"acs":4135,"articleLive":2,"columnArticles":57,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6261,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5944681716493797,"acs":2923,"articleLive":2,"columnArticles":56,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4917,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.384994640943194,"acs":1796,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4665,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3630862329803328,"acs":1200,"articleLive":2,"columnArticles":35,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3305,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5514046622833234,"acs":5535,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10038,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24676735284990173,"acs":4771,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19334,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3411764705882353,"acs":2088,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6120,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4195567144719687,"acs":1609,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3835,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6588235294117647,"acs":56,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":85,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7779076563413209,"acs":6655,"articleLive":2,"columnArticles":85,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8555,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.35829317778341363,"acs":5651,"articleLive":2,"columnArticles":124,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15772,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.571475249142297,"acs":3498,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6121,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39231738035264485,"acs":1869,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4764,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.3991031390134529,"acs":89,"articleLive":2,"columnArticles":4,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":223,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6744186046511628,"acs":29,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":43,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8839350617882239,"acs":3648,"articleLive":2,"columnArticles":49,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4127,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.29636626291810203,"acs":2667,"articleLive":2,"columnArticles":49,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":8999,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4192032686414709,"acs":2052,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4895,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4140700289110183,"acs":1289,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3113,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6224489795918368,"acs":61,"articleLive":2,"columnArticles":3,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":98,"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.9047958892377962,"acs":6339,"articleLive":2,"columnArticles":53,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":7006,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3555478321313754,"acs":4092,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11509,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3273450687243791,"acs":2715,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8294,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5202115602568946,"acs":1377,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2647,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8648648648648649,"acs":32,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":37,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5547057573826216,"acs":5222,"articleLive":2,"columnArticles":67,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9414,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34657002858309516,"acs":3395,"articleLive":2,"columnArticles":91,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9796,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41066725197541704,"acs":1871,"articleLive":2,"columnArticles":48,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4556,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34418446931163105,"acs":1015,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2949,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.828125,"acs":106,"articleLive":2,"columnArticles":4,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":128,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.7592592592592593,"acs":41,"articleLive":2,"columnArticles":4,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":54,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6580348499515973,"acs":2719,"articleLive":2,"columnArticles":32,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4132,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7564026206075045,"acs":2540,"articleLive":2,"columnArticles":37,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3358,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4763458401305057,"acs":2044,"articleLive":2,"columnArticles":52,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4291,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2556739231125521,"acs":1104,"articleLive":2,"columnArticles":38,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4318,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9130434782608695,"acs":147,"articleLive":2,"columnArticles":8,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":161,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5482625482625483,"acs":3976,"articleLive":2,"columnArticles":42,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7252,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.42181022570244125,"acs":3663,"articleLive":2,"columnArticles":53,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":8684,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.21626893070215694,"acs":1885,"articleLive":2,"columnArticles":66,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8716,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3392330383480826,"acs":1035,"articleLive":2,"columnArticles":37,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3051,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.7142857142857143,"acs":15,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":21,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6688934069125763,"acs":4606,"articleLive":2,"columnArticles":76,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":6886,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3816945974452127,"acs":3257,"articleLive":2,"columnArticles":65,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":8533,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.292259083728278,"acs":2405,"articleLive":2,"columnArticles":57,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":8229,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.26973365617433415,"acs":1114,"articleLive":2,"columnArticles":36,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":4130,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.8451006096926567,"acs":81226,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96114,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6909182899064003,"acs":13656,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19765,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21932602836739912,"acs":11149,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50833,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3772402739326825,"acs":2589,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6863,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.200077965110613,"acs":2053,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10261,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8397587352811233,"acs":43717,"articleLive":2,"columnArticles":659,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52059,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7693261678379496,"acs":39081,"articleLive":2,"columnArticles":470,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50799,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2882780554293503,"acs":5076,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17608,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27548243961655994,"acs":6581,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23889,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5890813991500491,"acs":1802,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3059,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6895722728638686,"acs":6884,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9983,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4106982126784107,"acs":6388,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15554,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6120137225710401,"acs":9455,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15449,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21078279702970298,"acs":2725,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12928,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5748824714573539,"acs":856,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1489,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3113496932515337,"acs":609,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1956,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7989600216099406,"acs":23662,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29616,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28654788637741974,"acs":17482,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":61009,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163635409285358,"acs":19675,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38103,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3123571805238179,"acs":1777,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5689,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3356788079470199,"acs":811,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2416,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3334698131467282,"acs":8959,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26866,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3381879108132491,"acs":2624,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7759,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28201970443349755,"acs":916,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3248,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3321917808219178,"acs":1164,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3504,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3351482153660012,"acs":554,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1653,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32886435331230285,"acs":1251,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3804,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28232532449599557,"acs":10223,"articleLive":2,"columnArticles":173,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36210,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1868038963425841,"acs":5082,"articleLive":2,"columnArticles":123,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27205,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3493142144638404,"acs":5603,"articleLive":2,"columnArticles":97,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16040,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2526716439759918,"acs":1726,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6831,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4051123160340821,"acs":1046,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2582,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.217079969242599,"acs":4517,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20808,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4835641926814141,"acs":2339,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4837,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39807162534435264,"acs":1156,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2904,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26192893401015227,"acs":774,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2955,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19290354822588707,"acs":772,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4002,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5620525059665871,"acs":471,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":838,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5039645208977288,"acs":3750,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7441,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23134822167080232,"acs":2797,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12090,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4165584415584416,"acs":1283,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3080,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19902248289345065,"acs":1018,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5115,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.39632277834525026,"acs":388,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":979,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8529182879377432,"acs":2192,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2570,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18503649635036495,"acs":1014,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5480,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.36617262423714037,"acs":840,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2294,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.353129282777524,"acs":773,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2189,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15146396396396397,"acs":269,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1776,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22396694214876034,"acs":271,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1210,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5440753335077164,"acs":4160,"articleLive":2,"columnArticles":96,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7646,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6971744471744472,"acs":3405,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4884,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41370869033047736,"acs":1690,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4085,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6781769375557132,"acs":402458,"articleLive":2,"columnArticles":2796,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":593441,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4033335996361893,"acs":262525,"articleLive":2,"columnArticles":2094,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":650888,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7609496715296653,"acs":288075,"articleLive":2,"columnArticles":1946,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":378573,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7514813506657742,"acs":304250,"articleLive":2,"columnArticles":2090,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":404867,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6978663971331435,"acs":189872,"articleLive":2,"columnArticles":1452,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":272075,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7155330162962803,"acs":265115,"articleLive":2,"columnArticles":1673,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":370514,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600687961892467,"acs":264414,"articleLive":2,"columnArticles":1862,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":734343,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44376649486750963,"acs":196226,"articleLive":2,"columnArticles":1318,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":442183,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49304752064178464,"acs":262924,"articleLive":2,"columnArticles":1635,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":533263,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4522340560282041,"acs":171375,"articleLive":2,"columnArticles":1145,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":378952,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5266131923682081,"acs":177723,"articleLive":2,"columnArticles":1714,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":337483,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5692584621686002,"acs":158440,"articleLive":2,"columnArticles":1316,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":278327,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3119878025538403,"acs":83487,"articleLive":2,"columnArticles":491,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":267597,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.747249584119923,"acs":199893,"articleLive":2,"columnArticles":1255,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":267505,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33985381457705577,"acs":124517,"articleLive":2,"columnArticles":760,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":366384,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773116173590352,"acs":150814,"articleLive":2,"columnArticles":1132,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":194020,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5966956193353474,"acs":189606,"articleLive":2,"columnArticles":1461,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":317760,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37673242514177585,"acs":66896,"articleLive":2,"columnArticles":447,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":177569,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24195208919244676,"acs":77084,"articleLive":2,"columnArticles":859,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":318592,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6431698701744994,"acs":194647,"articleLive":2,"columnArticles":1636,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":302637,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7980683447870581,"acs":262104,"articleLive":2,"columnArticles":2450,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":328423,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7427534674370677,"acs":293733,"articleLive":2,"columnArticles":1831,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":395465,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7284676392832664,"acs":185996,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":255325,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4655470864454922,"acs":146037,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":313689,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7919649108356328,"acs":192297,"articleLive":2,"columnArticles":1410,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":242810,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801477302939578,"acs":150564,"articleLive":2,"columnArticles":1090,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":259527,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44008109869421447,"acs":145864,"articleLive":2,"columnArticles":1484,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":331448,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5685553425970292,"acs":142389,"articleLive":2,"columnArticles":943,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":250440,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6157396083035729,"acs":113277,"articleLive":2,"columnArticles":950,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":183969,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6445306105267097,"acs":137800,"articleLive":2,"columnArticles":960,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":213799,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6866141653691061,"acs":137581,"articleLive":2,"columnArticles":1098,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":200376,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5888663224606651,"acs":120326,"articleLive":2,"columnArticles":1141,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":204335,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5513941513650054,"acs":113510,"articleLive":2,"columnArticles":953,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":205860,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5768596961495932,"acs":134072,"articleLive":2,"columnArticles":872,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":232417,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7200626546937213,"acs":120442,"articleLive":2,"columnArticles":830,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":167266,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6546646684151367,"acs":104838,"articleLive":2,"columnArticles":907,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":160140,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5613074089886178,"acs":77571,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138197,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792923679861954,"acs":158455,"articleLive":2,"columnArticles":1117,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":273532,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6911904294317884,"acs":168938,"articleLive":2,"columnArticles":1027,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":244416,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.570378976080378,"acs":248424,"articleLive":2,"columnArticles":1814,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":435542,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5814972321003042,"acs":63446,"articleLive":2,"columnArticles":461,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":109108,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054416219361646,"acs":222656,"articleLive":2,"columnArticles":1527,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":367758,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48607186112232537,"acs":49364,"articleLive":2,"columnArticles":512,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":101557,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41522375388190086,"acs":55755,"articleLive":2,"columnArticles":465,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":134277,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5611424346057862,"acs":109278,"articleLive":2,"columnArticles":809,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":194742,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5359024886091074,"acs":120204,"articleLive":2,"columnArticles":1443,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":224302,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889875368727306,"acs":119354,"articleLive":2,"columnArticles":998,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":173231,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46463665955225114,"acs":151735,"articleLive":2,"columnArticles":1039,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":326567,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514690683596633,"acs":88248,"articleLive":2,"columnArticles":519,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":135460,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.614739872835606,"acs":153728,"articleLive":2,"columnArticles":1058,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":250070,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4829987245500496,"acs":102246,"articleLive":2,"columnArticles":849,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":211690,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6499366840199353,"acs":175531,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":270074,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5379610463326678,"acs":190499,"articleLive":2,"columnArticles":1590,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":354113,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4471917028609635,"acs":168547,"articleLive":2,"columnArticles":1474,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":376901,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7568180339902806,"acs":162896,"articleLive":2,"columnArticles":1144,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":215238,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7899075593261035,"acs":177651,"articleLive":2,"columnArticles":1270,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":224901,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5882277347749167,"acs":137320,"articleLive":2,"columnArticles":941,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":233447,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.698548409543345,"acs":115447,"articleLive":2,"columnArticles":1032,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":165267,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8001945267253194,"acs":90498,"articleLive":2,"columnArticles":699,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":113095,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6660478241497104,"acs":134535,"articleLive":2,"columnArticles":845,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":201990,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7073545209477674,"acs":139595,"articleLive":2,"columnArticles":1860,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":197348,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4419090732980556,"acs":130026,"articleLive":2,"columnArticles":978,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":294237,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8577680434049393,"acs":205999,"articleLive":2,"columnArticles":1791,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":240157,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44433722256338276,"acs":131690,"articleLive":2,"columnArticles":1191,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":296374,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4752201952272214,"acs":94690,"articleLive":2,"columnArticles":1067,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":199255,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5615927427998182,"acs":65498,"articleLive":2,"columnArticles":591,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":116629,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45970856312465835,"acs":103445,"articleLive":2,"columnArticles":982,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":225023,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6553690776771127,"acs":110315,"articleLive":2,"columnArticles":767,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":168325,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6340147574694569,"acs":131035,"articleLive":2,"columnArticles":955,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":206675,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568360017630882,"acs":138020,"articleLive":2,"columnArticles":1299,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":161081,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5841597886014419,"acs":71625,"articleLive":2,"columnArticles":496,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":122612,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5977329459426279,"acs":73034,"articleLive":2,"columnArticles":528,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":122185,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2866494221703033,"acs":68707,"articleLive":2,"columnArticles":557,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":239690,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6941083269761165,"acs":118283,"articleLive":2,"columnArticles":691,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":170410,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7005825566904579,"acs":117494,"articleLive":2,"columnArticles":690,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":167709,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20226446401991166,"acs":8289,"articleLive":2,"columnArticles":109,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":40981,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5745369673241981,"acs":7631,"articleLive":2,"columnArticles":124,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":13282,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7829152320052467,"acs":9550,"articleLive":2,"columnArticles":144,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":12198,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6872246696035242,"acs":7800,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":11350,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7133208255159474,"acs":5703,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":7995,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6654422426292895,"acs":6884,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":10345,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4552907823155314,"acs":5942,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":13051,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5066222336153123,"acs":5929,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":11703,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5501655062207511,"acs":4820,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":8761,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4358575521899304,"acs":5324,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12215,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5660126862369081,"acs":3837,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6779,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6618705035971223,"acs":4692,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":7089,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6544102873216797,"acs":3257,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":4977,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5057642750576428,"acs":3729,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7373,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6408224459198972,"acs":2992,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4669,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4974098856032808,"acs":4609,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9266,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5183064021272243,"acs":2534,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4889,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5314659876318661,"acs":4383,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8247,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4742228476397595,"acs":3707,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":7817,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7049085659287777,"acs":3662,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5195,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5360784313725491,"acs":5468,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10200,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5225012228925485,"acs":6409,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":12266,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7032258064516129,"acs":4578,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6510,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7702581225118788,"acs":11996,"articleLive":2,"columnArticles":123,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":15574,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6055764411027569,"acs":3866,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6384,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6497175141242938,"acs":4255,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6549,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6093027644117369,"acs":6458,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":10599,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6251526251526252,"acs":2048,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3276,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2955299111287969,"acs":2228,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":7539,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5465243568691844,"acs":1997,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3654,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.56146705908988,"acs":2480,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4417,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6028790786948176,"acs":3141,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5210,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7965717981888745,"acs":2463,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3092,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5762841809353437,"acs":2255,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":3913,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6856465005931198,"acs":2312,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3372,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5840297121634169,"acs":2516,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4308,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4407726692209451,"acs":2761,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6264,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7795257102606246,"acs":3320,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4259,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5187515122187273,"acs":2144,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4133,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5705950991831972,"acs":1467,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2571,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7864128998149617,"acs":2975,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3783,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8474633980251958,"acs":2489,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2937,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6536523929471033,"acs":1557,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2382,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.646174556876823,"acs":2880,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4457,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8075896827749778,"acs":2724,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3373,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7253052164261932,"acs":2614,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3604,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6858407079646017,"acs":2480,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3616,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6765830854228644,"acs":1592,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2353,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7528913963328632,"acs":2669,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3545,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6164428431051425,"acs":1882,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":3053,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41416474210931487,"acs":1614,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3897,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.741001564945227,"acs":2841,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3834,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6348477525374577,"acs":2627,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4138,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8509316770186336,"acs":2192,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2576,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8914572864321608,"acs":1774,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1990,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7339815507354774,"acs":2944,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":4011,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.351681047307349,"acs":1182,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3361,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5970149253731343,"acs":1160,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1943,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6247928405701028,"acs":1885,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":3017,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6700691471847218,"acs":2035,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":3037,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.53828125,"acs":1378,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2560,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7641148325358852,"acs":1597,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2090,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7219653179190751,"acs":1249,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1730,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6356350184956844,"acs":1031,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1622,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6260477111540941,"acs":971,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1551,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6444866920152091,"acs":1017,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1578,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6579330422125182,"acs":904,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1374,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5089131684876366,"acs":2655,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5217,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7285714285714285,"acs":2652,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3640,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6704161979752531,"acs":2384,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3556,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5023183925811437,"acs":975,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1941,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.421234631147541,"acs":3289,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":7808,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5431923213650907,"acs":1528,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2813,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5490972050457581,"acs":2220,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4043,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.708880550343965,"acs":2267,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3198,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6726799934991061,"acs":4139,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6153,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5846710733396285,"acs":3715,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6354,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6331296377127892,"acs":2901,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4582,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8524124881740776,"acs":2703,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3171,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8071428571428572,"acs":2034,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2520,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7816257816257817,"acs":3250,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4158,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6407154129405576,"acs":2436,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3802,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8563218390804598,"acs":2980,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3480,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6773643851178642,"acs":2385,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3521,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8566070398153491,"acs":2969,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3466,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7652979066022544,"acs":1901,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2484,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6387349201173785,"acs":1959,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3067,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7404823599760814,"acs":3715,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":5017,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6221185510428101,"acs":2267,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3644,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5209284627092846,"acs":1369,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2628,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.76620660811376,"acs":1832,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2391,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6776315789473685,"acs":1442,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2128,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5753234750462107,"acs":1245,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2164,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5919540229885057,"acs":1030,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1740,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.663440333251654,"acs":5415,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8162,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49764150943396224,"acs":1055,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2120,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5416149068322982,"acs":872,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1610,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7790356394129979,"acs":1858,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2385,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6933663638865951,"acs":2519,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3633,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7336448598130841,"acs":1570,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2140,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48289250181994664,"acs":1990,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4121,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5946321147616844,"acs":1285,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2161,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4954128440366973,"acs":2484,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":5014,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5823817292006526,"acs":1071,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1839,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6996172033325827,"acs":3107,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4441,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5514075887392901,"acs":901,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1634,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.539044289044289,"acs":925,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1716,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5645491803278688,"acs":551,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":976,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6097414311485267,"acs":1014,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1663,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8383668903803132,"acs":1499,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1788,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6932270916334662,"acs":522,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":753,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5580767152890329,"acs":1033,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1851,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.58984375,"acs":1057,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1792,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4215091066782307,"acs":486,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1153,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.28880345987506006,"acs":601,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2081,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6377840909090909,"acs":3592,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5632,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6295503211991434,"acs":588,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":934,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6952636282394995,"acs":778,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1119,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4596438675320353,"acs":2762,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":6009,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7197880824516835,"acs":89533,"articleLive":2,"columnArticles":1537,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":124388,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6478286332101991,"acs":57522,"articleLive":2,"columnArticles":1106,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":88792,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.579220199740154,"acs":44136,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76199,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510466548091394,"acs":40276,"articleLive":2,"columnArticles":775,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":73090,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3321773313849384,"acs":32279,"articleLive":2,"columnArticles":556,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":97174,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4719093145007714,"acs":73103,"articleLive":2,"columnArticles":1174,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":154909,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7538603471141094,"acs":65371,"articleLive":2,"columnArticles":959,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":86715,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6213793497841191,"acs":43463,"articleLive":2,"columnArticles":488,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":69946,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5500478404646401,"acs":32768,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":59573,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6827439642710738,"acs":63289,"articleLive":2,"columnArticles":691,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":92698,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800040793309897,"acs":65011,"articleLive":2,"columnArticles":945,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83347,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8547793238655382,"acs":71504,"articleLive":2,"columnArticles":681,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83652,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.655287001220177,"acs":25241,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38519,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4668205863324411,"acs":36799,"articleLive":2,"columnArticles":522,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78829,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4834435448983376,"acs":39113,"articleLive":2,"columnArticles":506,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":80905,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6847165195496359,"acs":47861,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":69899,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5319797549488988,"acs":27223,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51173,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5378204813961469,"acs":10971,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20399,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6136574239076199,"acs":25827,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42087,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3867642943755247,"acs":8293,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21442,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7125485043844908,"acs":23321,"articleLive":2,"columnArticles":342,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32729,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5432265824688017,"acs":14452,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26604,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5879720585025103,"acs":10774,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18324,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5318679325149664,"acs":17591,"articleLive":2,"columnArticles":244,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33074,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.790256175663312,"acs":34550,"articleLive":2,"columnArticles":421,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43720,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8062649305205074,"acs":23963,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29721,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5844411009823878,"acs":33018,"articleLive":2,"columnArticles":384,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56495,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35169895863585443,"acs":25431,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72309,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5905572071939481,"acs":20063,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33973,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7167909000818647,"acs":16636,"articleLive":2,"columnArticles":176,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23209,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47650429799426935,"acs":6652,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13960,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7169052668787558,"acs":16225,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22632,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48633396038508353,"acs":17580,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36148,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.505143591941706,"acs":9428,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18664,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6902901284469595,"acs":7685,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11133,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3868998750669284,"acs":10839,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":28015,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38636696441645924,"acs":5277,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13658,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5273882459723168,"acs":11621,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22035,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7038985148514851,"acs":11375,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16160,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5534679818381086,"acs":3535,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6387,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36323652017082675,"acs":42697,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117546,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36099487239936345,"acs":12250,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33934,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6757987896141081,"acs":51925,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76835,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8201294879340789,"acs":20901,"articleLive":2,"columnArticles":329,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25485,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6790340285400659,"acs":21651,"articleLive":2,"columnArticles":479,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31885,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6567722075637643,"acs":23896,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36384,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8130579512785595,"acs":21494,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26436,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185769717051053,"acs":16482,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22937,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8134322792362768,"acs":21813,"articleLive":2,"columnArticles":347,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26816,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5589821093047953,"acs":13685,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24482,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4946833236490413,"acs":34054,"articleLive":2,"columnArticles":326,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68840,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7606382978723404,"acs":16731,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21996,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5015039248771184,"acs":6836,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13631,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5339569451563301,"acs":4167,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7804,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5548370028513477,"acs":56625,"articleLive":2,"columnArticles":2373,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102057,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396889069067788,"acs":34667,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46867,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3951248691490953,"acs":13211,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33435,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.553249793052265,"acs":19382,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35033,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4550040284443199,"acs":12989,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28547,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6236501079913607,"acs":4620,"articleLive":2,"columnArticles":84,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7408,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6670418145615098,"acs":7705,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11551,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8317989712675687,"acs":25389,"articleLive":2,"columnArticles":402,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30523,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7659904781618713,"acs":14802,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19324,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4423946130430772,"acs":9592,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21682,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4603235500991112,"acs":7199,"articleLive":2,"columnArticles":157,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15639,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4641875644108554,"acs":10810,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23288,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42412013760254036,"acs":12822,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30232,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7328997533079166,"acs":19608,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26754,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3729254799869834,"acs":2292,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6146,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5486075949367089,"acs":2167,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3950,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6815039178244551,"acs":10350,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15187,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409352322761929,"acs":50372,"articleLive":2,"columnArticles":581,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114239,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43044332823760645,"acs":1971,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4579,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5489596083231334,"acs":3588,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6536,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5032815392382342,"acs":8972,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17827,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4533442434160681,"acs":14959,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32997,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6005068740452715,"acs":34594,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57608,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3439786188308306,"acs":15187,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44151,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6117611761176117,"acs":20390,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33330,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7216015656853951,"acs":8849,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12263,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4648730174175343,"acs":9555,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20554,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5835470085470086,"acs":2731,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4680,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4716191472665446,"acs":10818,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22938,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5455321036736226,"acs":31972,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58607,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3880735649266208,"acs":14623,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37681,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5969052600846674,"acs":12267,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20551,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6436454580914577,"acs":28052,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":43583,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3876670673926879,"acs":5482,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14141,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45002888503755056,"acs":4674,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10386,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4122004151726741,"acs":8737,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21196,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27161945832924955,"acs":8314,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30609,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5488842072409488,"acs":14069,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25632,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.570589841616603,"acs":66864,"articleLive":2,"columnArticles":928,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117184,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6869738907119418,"acs":14445,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21027,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6318420016357192,"acs":20859,"articleLive":2,"columnArticles":291,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33013,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5527196746725381,"acs":24601,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44509,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5971210759552512,"acs":77074,"articleLive":2,"columnArticles":760,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":129076,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40267765190525234,"acs":5865,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14565,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184836055132354,"acs":61053,"articleLive":2,"columnArticles":1138,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117753,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4449230769230769,"acs":7953,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17875,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4455316777110299,"acs":7194,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16147,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5789649862756913,"acs":8648,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14937,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5708873670406528,"acs":3918,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6863,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359560540300517,"acs":44398,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69813,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37513788714467544,"acs":8842,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23570,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3786423979293646,"acs":4535,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11977,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5243326587645755,"acs":10882,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20754,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5038486209108403,"acs":1571,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3118,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3414827279026032,"acs":3450,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10103,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/DivideTwoIntegers.md b/src/main/java/leetcode/editor/cn/doc/content/DivideTwoIntegers.md new file mode 100644 index 0000000..6aaf60f --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/DivideTwoIntegers.md @@ -0,0 +1,30 @@ +

    给定两个整数，被除数 dividend 和除数 divisor。将两数相除，要求不使用乘法、除法和 mod 运算符。

    + +

    返回被除数 dividend 除以除数 divisor 得到的商。

    + +

    整数除法的结果应当截去（truncate）其小数部分，例如：truncate(8.345) = 8 以及 truncate(-2.7335) = -2

    + +

     

    + +

    示例 1:

    + +
    输入: dividend = 10, divisor = 3
+输出: 3
+解释: 10/3 = truncate(3.33333..) = truncate(3) = 3
    + +

    示例 2:

    + +
    输入: dividend = 7, divisor = -3
+输出: -2
+解释: 7/-3 = truncate(-2.33333..) = -2
    + +

     

    + +

    提示：

    + +
      +
    • 被除数和除数均为 32 位有符号整数。
      • +
    • 除数不为 0。
      • +
    • 假设我们的环境只能存储 32 位有符号整数，其数值范围是 [−231,  231 − 1]。本题中，如果除法结果溢出，则返回 231 − 1。
      • +
    +
    Related Topics
  • 位运算
  • 数学

  • 👍 700
  • 👎 0
    • \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/translation.json b/src/main/java/leetcode/editor/cn/doc/translation.json index 0f4fff2..8b03f12 100644 --- a/src/main/java/leetcode/editor/cn/doc/translation.json +++ b/src/main/java/leetcode/editor/cn/doc/translation.json @@ -1 +1 @@ -{"data":{"translations":[{"questionId":"1","title":"\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2","title":"\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"3","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"4","title":"\u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"5","title":"\u6700\u957f\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"6","title":"Z \u5b57\u5f62\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"7","title":"\u6574\u6570\u53cd\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"8","title":"\u5b57\u7b26\u4e32\u8f6c\u6362\u6574\u6570 (atoi)","__typename":"AppliedTranslationNode"},{"questionId":"9","title":"\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"10","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"11","title":"\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"12","title":"\u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"13","title":"\u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"14","title":"\u6700\u957f\u516c\u5171\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"15","title":"\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"16","title":"\u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"17","title":"\u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"18","title":"\u56db\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"19","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c N \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"20","title":"\u6709\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"21","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"22","title":"\u62ec\u53f7\u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"23","title":"\u5408\u5e76K\u4e2a\u5347\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"24","title":"\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"25","title":"K \u4e2a\u4e00\u7ec4\u7ffb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"26","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"27","title":"\u79fb\u9664\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"28","title":"\u5b9e\u73b0 strStr()","__typename":"AppliedTranslationNode"},{"questionId":"29","title":"\u4e24\u6570\u76f8\u9664","__typename":"AppliedTranslationNode"},{"questionId":"30","title":"\u4e32\u8054\u6240\u6709\u5355\u8bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"31","title":"\u4e0b\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"32","title":"\u6700\u957f\u6709\u6548\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"33","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"34","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"35","title":"\u641c\u7d22\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"36","title":"\u6709\u6548\u7684\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"37","title":"\u89e3\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"38","title":"\u5916\u89c2\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"39","title":"\u7ec4\u5408\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"40","title":"\u7ec4\u5408\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"41","title":"\u7f3a\u5931\u7684\u7b2c\u4e00\u4e2a\u6b63\u6570","__typename":"AppliedTranslationNode"},{"questionId":"42","title":"\u63a5\u96e8\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"43","title":"\u5b57\u7b26\u4e32\u76f8\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"44","title":"\u901a\u914d\u7b26\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"45","title":"\u8df3\u8dc3\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"46","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"47","title":"\u5168\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"48","title":"\u65cb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"49","title":"\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"50","title":"Pow(x, n)","__typename":"AppliedTranslationNode"},{"questionId":"51","title":"N \u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"52","title":"N\u7687\u540e II","__typename":"AppliedTranslationNode"},{"questionId":"53","title":"\u6700\u5927\u5b50\u5e8f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"54","title":"\u87ba\u65cb\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"55","title":"\u8df3\u8dc3\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"56","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"57","title":"\u63d2\u5165\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"58","title":"\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"59","title":"\u87ba\u65cb\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"60","title":"\u6392\u5217\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"61","title":"\u65cb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"62","title":"\u4e0d\u540c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"63","title":"\u4e0d\u540c\u8def\u5f84 II","__typename":"AppliedTranslationNode"},{"questionId":"64","title":"\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"65","title":"\u6709\u6548\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"66","title":"\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"67","title":"\u4e8c\u8fdb\u5236\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"68","title":"\u6587\u672c\u5de6\u53f3\u5bf9\u9f50","__typename":"AppliedTranslationNode"},{"questionId":"69","title":"Sqrt(x)","__typename":"AppliedTranslationNode"},{"questionId":"70","title":"\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"71","title":"\u7b80\u5316\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"72","title":"\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"73","title":"\u77e9\u9635\u7f6e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"74","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"75","title":"\u989c\u8272\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"76","title":"\u6700\u5c0f\u8986\u76d6\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"77","title":"\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"78","title":"\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"79","title":"\u5355\u8bcd\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"80","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"81","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"82","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"83","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"84","title":"\u67f1\u72b6\u56fe\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"85","title":"\u6700\u5927\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"86","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"87","title":"\u6270\u4e71\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"88","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"89","title":"\u683c\u96f7\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"90","title":"\u5b50\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"91","title":"\u89e3\u7801\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"92","title":"\u53cd\u8f6c\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"93","title":"\u590d\u539f IP \u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"94","title":"\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"95","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"96","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"97","title":"\u4ea4\u9519\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"98","title":"\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"99","title":"\u6062\u590d\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100","title":"\u76f8\u540c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"101","title":"\u5bf9\u79f0\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"102","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"103","title":"\u4e8c\u53c9\u6811\u7684\u952f\u9f7f\u5f62\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"104","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"105","title":"\u4ece\u524d\u5e8f\u4e0e\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"106","title":"\u4ece\u4e2d\u5e8f\u4e0e\u540e\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"107","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"108","title":"\u5c06\u6709\u5e8f\u6570\u7ec4\u8f6c\u6362\u4e3a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"109","title":"\u6709\u5e8f\u94fe\u8868\u8f6c\u6362\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"110","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"111","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"112","title":"\u8def\u5f84\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"113","title":"\u8def\u5f84\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"114","title":"\u4e8c\u53c9\u6811\u5c55\u5f00\u4e3a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"115","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"116","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488","__typename":"AppliedTranslationNode"},{"questionId":"117","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488 II","__typename":"AppliedTranslationNode"},{"questionId":"118","title":"\u6768\u8f89\u4e09\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"119","title":"\u6768\u8f89\u4e09\u89d2 II","__typename":"AppliedTranslationNode"},{"questionId":"120","title":"\u4e09\u89d2\u5f62\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"121","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a","__typename":"AppliedTranslationNode"},{"questionId":"122","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"123","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a III","__typename":"AppliedTranslationNode"},{"questionId":"124","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u5927\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"125","title":"\u9a8c\u8bc1\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"126","title":"\u5355\u8bcd\u63a5\u9f99 II","__typename":"AppliedTranslationNode"},{"questionId":"127","title":"\u5355\u8bcd\u63a5\u9f99","__typename":"AppliedTranslationNode"},{"questionId":"128","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"129","title":"\u6c42\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"130","title":"\u88ab\u56f4\u7ed5\u7684\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"131","title":"\u5206\u5272\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"132","title":"\u5206\u5272\u56de\u6587\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"133","title":"\u514b\u9686\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"134","title":"\u52a0\u6cb9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"135","title":"\u5206\u53d1\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"136","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"137","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 II","__typename":"AppliedTranslationNode"},{"questionId":"138","title":"\u590d\u5236\u5e26\u968f\u673a\u6307\u9488\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"139","title":"\u5355\u8bcd\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"140","title":"\u5355\u8bcd\u62c6\u5206 II","__typename":"AppliedTranslationNode"},{"questionId":"141","title":"\u73af\u5f62\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"142","title":"\u73af\u5f62\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"143","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"144","title":"\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"145","title":"\u4e8c\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"146","title":"LRU \u7f13\u5b58\u673a\u5236","__typename":"AppliedTranslationNode"},{"questionId":"147","title":"\u5bf9\u94fe\u8868\u8fdb\u884c\u63d2\u5165\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"148","title":"\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"149","title":"\u76f4\u7ebf\u4e0a\u6700\u591a\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"150","title":"\u9006\u6ce2\u5170\u8868\u8fbe\u5f0f\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"151","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"152","title":"\u4e58\u79ef\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"153","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"154","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"155","title":"\u6700\u5c0f\u6808","__typename":"AppliedTranslationNode"},{"questionId":"156","title":"\u4e0a\u4e0b\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"157","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"158","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26 II","__typename":"AppliedTranslationNode"},{"questionId":"159","title":"\u81f3\u591a\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"160","title":"\u76f8\u4ea4\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"161","title":"\u76f8\u9694\u4e3a 1 \u7684\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"162","title":"\u5bfb\u627e\u5cf0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"163","title":"\u7f3a\u5931\u7684\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"164","title":"\u6700\u5927\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"165","title":"\u6bd4\u8f83\u7248\u672c\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"166","title":"\u5206\u6570\u5230\u5c0f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"167","title":"\u4e24\u6570\u4e4b\u548c II - \u8f93\u5165\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"168","title":"Excel\u8868\u5217\u540d\u79f0","__typename":"AppliedTranslationNode"},{"questionId":"169","title":"\u591a\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"170","title":"\u4e24\u6570\u4e4b\u548c III - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"171","title":"Excel \u8868\u5217\u5e8f\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"172","title":"\u9636\u4e58\u540e\u7684\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"173","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"174","title":"\u5730\u4e0b\u57ce\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"175","title":"\u7ec4\u5408\u4e24\u4e2a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"176","title":"\u7b2c\u4e8c\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"177","title":"\u7b2cN\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"178","title":"\u5206\u6570\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"179","title":"\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"180","title":"\u8fde\u7eed\u51fa\u73b0\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"181","title":"\u8d85\u8fc7\u7ecf\u7406\u6536\u5165\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"182","title":"\u67e5\u627e\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"183","title":"\u4ece\u4e0d\u8ba2\u8d2d\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"184","title":"\u90e8\u95e8\u5de5\u8d44\u6700\u9ad8\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"185","title":"\u90e8\u95e8\u5de5\u8d44\u524d\u4e09\u9ad8\u7684\u6240\u6709\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"186","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd II","__typename":"AppliedTranslationNode"},{"questionId":"187","title":"\u91cd\u590d\u7684DNA\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"188","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a IV","__typename":"AppliedTranslationNode"},{"questionId":"189","title":"\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"190","title":"\u98a0\u5012\u4e8c\u8fdb\u5236\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"191","title":"\u4f4d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"192","title":"\u7edf\u8ba1\u8bcd\u9891","__typename":"AppliedTranslationNode"},{"questionId":"193","title":"\u6709\u6548\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"194","title":"\u8f6c\u7f6e\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"195","title":"\u7b2c\u5341\u884c","__typename":"AppliedTranslationNode"},{"questionId":"196","title":"\u5220\u9664\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"197","title":"\u4e0a\u5347\u7684\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"198","title":"\u6253\u5bb6\u52ab\u820d","__typename":"AppliedTranslationNode"},{"questionId":"199","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"200","title":"\u5c9b\u5c7f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"201","title":"\u6570\u5b57\u8303\u56f4\u6309\u4f4d\u4e0e","__typename":"AppliedTranslationNode"},{"questionId":"202","title":"\u5feb\u4e50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"203","title":"\u79fb\u9664\u94fe\u8868\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"204","title":"\u8ba1\u6570\u8d28\u6570","__typename":"AppliedTranslationNode"},{"questionId":"205","title":"\u540c\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"206","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"207","title":"\u8bfe\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"208","title":"\u5b9e\u73b0 Trie (\u524d\u7f00\u6811)","__typename":"AppliedTranslationNode"},{"questionId":"209","title":"\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"210","title":"\u8bfe\u7a0b\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"211","title":"\u6dfb\u52a0\u4e0e\u641c\u7d22\u5355\u8bcd - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"212","title":"\u5355\u8bcd\u641c\u7d22 II","__typename":"AppliedTranslationNode"},{"questionId":"213","title":"\u6253\u5bb6\u52ab\u820d II","__typename":"AppliedTranslationNode"},{"questionId":"214","title":"\u6700\u77ed\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"215","title":"\u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"216","title":"\u7ec4\u5408\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"217","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"218","title":"\u5929\u9645\u7ebf\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"219","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"220","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"221","title":"\u6700\u5927\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"222","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"223","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"224","title":"\u57fa\u672c\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"225","title":"\u7528\u961f\u5217\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"226","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"227","title":"\u57fa\u672c\u8ba1\u7b97\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"228","title":"\u6c47\u603b\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"229","title":"\u6c42\u4f17\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"230","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"231","title":"2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"232","title":"\u7528\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"233","title":"\u6570\u5b57 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"234","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"235","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"236","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"237","title":"\u5220\u9664\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"238","title":"\u9664\u81ea\u8eab\u4ee5\u5916\u6570\u7ec4\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"239","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"240","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"241","title":"\u4e3a\u8fd0\u7b97\u8868\u8fbe\u5f0f\u8bbe\u8ba1\u4f18\u5148\u7ea7","__typename":"AppliedTranslationNode"},{"questionId":"242","title":"\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"243","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"244","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"245","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb III","__typename":"AppliedTranslationNode"},{"questionId":"246","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"247","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"248","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"249","title":"\u79fb\u4f4d\u5b57\u7b26\u4e32\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"250","title":"\u7edf\u8ba1\u540c\u503c\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"251","title":"\u5c55\u5f00\u4e8c\u7ef4\u5411\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"252","title":"\u4f1a\u8bae\u5ba4","__typename":"AppliedTranslationNode"},{"questionId":"253","title":"\u4f1a\u8bae\u5ba4 II","__typename":"AppliedTranslationNode"},{"questionId":"254","title":"\u56e0\u5b50\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"255","title":"\u9a8c\u8bc1\u524d\u5e8f\u904d\u5386\u5e8f\u5217\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"256","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"257","title":"\u4e8c\u53c9\u6811\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"258","title":"\u5404\u4f4d\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"259","title":"\u8f83\u5c0f\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"260","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 III","__typename":"AppliedTranslationNode"},{"questionId":"261","title":"\u4ee5\u56fe\u5224\u6811","__typename":"AppliedTranslationNode"},{"questionId":"262","title":"\u884c\u7a0b\u548c\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"263","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"264","title":"\u4e11\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"265","title":"\u7c89\u5237\u623f\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"266","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"267","title":"\u56de\u6587\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"268","title":"\u4e22\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"269","title":"\u706b\u661f\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"270","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c","__typename":"AppliedTranslationNode"},{"questionId":"271","title":"\u5b57\u7b26\u4e32\u7684\u7f16\u7801\u4e0e\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"272","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"273","title":"\u6574\u6570\u8f6c\u6362\u82f1\u6587\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"274","title":"H \u6307\u6570","__typename":"AppliedTranslationNode"},{"questionId":"275","title":"H \u6307\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"276","title":"\u6805\u680f\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"277","title":"\u641c\u5bfb\u540d\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"278","title":"\u7b2c\u4e00\u4e2a\u9519\u8bef\u7684\u7248\u672c","__typename":"AppliedTranslationNode"},{"questionId":"279","title":"\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"280","title":"\u6446\u52a8\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"281","title":"\u952f\u9f7f\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"282","title":"\u7ed9\u8868\u8fbe\u5f0f\u6dfb\u52a0\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"283","title":"\u79fb\u52a8\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"284","title":"\u9876\u7aef\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"285","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"286","title":"\u5899\u4e0e\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"287","title":"\u5bfb\u627e\u91cd\u590d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"288","title":"\u5355\u8bcd\u7684\u552f\u4e00\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"289","title":"\u751f\u547d\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"290","title":"\u5355\u8bcd\u89c4\u5f8b","__typename":"AppliedTranslationNode"},{"questionId":"291","title":"\u5355\u8bcd\u89c4\u5f8b II","__typename":"AppliedTranslationNode"},{"questionId":"292","title":"Nim \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"293","title":"\u7ffb\u8f6c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"294","title":"\u7ffb\u8f6c\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"295","title":"\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"296","title":"\u6700\u4f73\u7684\u78b0\u5934\u5730\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"297","title":"\u4e8c\u53c9\u6811\u7684\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"298","title":"\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"299","title":"\u731c\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"300","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"301","title":"\u5220\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"302","title":"\u5305\u542b\u5168\u90e8\u9ed1\u8272\u50cf\u7d20\u7684\u6700\u5c0f\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"303","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"304","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"305","title":"\u5c9b\u5c7f\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"306","title":"\u7d2f\u52a0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"307","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u53ef\u4fee\u6539","__typename":"AppliedTranslationNode"},{"questionId":"308","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"309","title":"\u6700\u4f73\u4e70\u5356\u80a1\u7968\u65f6\u673a\u542b\u51b7\u51bb\u671f","__typename":"AppliedTranslationNode"},{"questionId":"310","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"311","title":"\u7a00\u758f\u77e9\u9635\u7684\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"312","title":"\u6233\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"313","title":"\u8d85\u7ea7\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"314","title":"\u4e8c\u53c9\u6811\u7684\u5782\u76f4\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"315","title":"\u8ba1\u7b97\u53f3\u4fa7\u5c0f\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"316","title":"\u53bb\u9664\u91cd\u590d\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"317","title":"\u79bb\u5efa\u7b51\u7269\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"318","title":"\u6700\u5927\u5355\u8bcd\u957f\u5ea6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"319","title":"\u706f\u6ce1\u5f00\u5173","__typename":"AppliedTranslationNode"},{"questionId":"320","title":"\u5217\u4e3e\u5355\u8bcd\u7684\u5168\u90e8\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"321","title":"\u62fc\u63a5\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"322","title":"\u96f6\u94b1\u5151\u6362","__typename":"AppliedTranslationNode"},{"questionId":"323","title":"\u65e0\u5411\u56fe\u4e2d\u8fde\u901a\u5206\u91cf\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"324","title":"\u6446\u52a8\u6392\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"325","title":"\u548c\u7b49\u4e8e k \u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"326","title":"3\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"327","title":"\u533a\u95f4\u548c\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"328","title":"\u5947\u5076\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"329","title":"\u77e9\u9635\u4e2d\u7684\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"330","title":"\u6309\u8981\u6c42\u8865\u9f50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"331","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"332","title":"\u91cd\u65b0\u5b89\u6392\u884c\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"333","title":"\u6700\u5927 BST \u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"334","title":"\u9012\u589e\u7684\u4e09\u5143\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"335","title":"\u8def\u5f84\u4ea4\u53c9","__typename":"AppliedTranslationNode"},{"questionId":"336","title":"\u56de\u6587\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"337","title":"\u6253\u5bb6\u52ab\u820d III","__typename":"AppliedTranslationNode"},{"questionId":"338","title":"\u6bd4\u7279\u4f4d\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"339","title":"\u5d4c\u5957\u5217\u8868\u6743\u91cd\u548c","__typename":"AppliedTranslationNode"},{"questionId":"340","title":"\u81f3\u591a\u5305\u542b K \u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"341","title":"\u6241\u5e73\u5316\u5d4c\u5957\u5217\u8868\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"342","title":"4\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"343","title":"\u6574\u6570\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"344","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"345","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"346","title":"\u6570\u636e\u6d41\u4e2d\u7684\u79fb\u52a8\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"347","title":"\u524d K \u4e2a\u9ad8\u9891\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"348","title":"\u8bbe\u8ba1\u4e95\u5b57\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"349","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"350","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"351","title":"\u5b89\u5353\u7cfb\u7edf\u624b\u52bf\u89e3\u9501","__typename":"AppliedTranslationNode"},{"questionId":"352","title":"\u5c06\u6570\u636e\u6d41\u53d8\u4e3a\u591a\u4e2a\u4e0d\u76f8\u4ea4\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"353","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"354","title":"\u4fc4\u7f57\u65af\u5957\u5a03\u4fe1\u5c01\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"355","title":"\u8bbe\u8ba1\u63a8\u7279","__typename":"AppliedTranslationNode"},{"questionId":"356","title":"\u76f4\u7ebf\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"357","title":"\u8ba1\u7b97\u5404\u4e2a\u4f4d\u6570\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"358","title":"K \u8ddd\u79bb\u95f4\u9694\u91cd\u6392\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"359","title":"\u65e5\u5fd7\u901f\u7387\u9650\u5236\u5668","__typename":"AppliedTranslationNode"},{"questionId":"360","title":"\u6709\u5e8f\u8f6c\u5316\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"361","title":"\u8f70\u70b8\u654c\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"362","title":"\u6572\u51fb\u8ba1\u6570\u5668","__typename":"AppliedTranslationNode"},{"questionId":"363","title":"\u77e9\u5f62\u533a\u57df\u4e0d\u8d85\u8fc7 K \u7684\u6700\u5927\u6570\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"364","title":"\u52a0\u6743\u5d4c\u5957\u5e8f\u5217\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"365","title":"\u6c34\u58f6\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"366","title":"\u5bfb\u627e\u4e8c\u53c9\u6811\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"367","title":"\u6709\u6548\u7684\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"368","title":"\u6700\u5927\u6574\u9664\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"369","title":"\u7ed9\u5355\u94fe\u8868\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"370","title":"\u533a\u95f4\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"371","title":"\u4e24\u6574\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"372","title":"\u8d85\u7ea7\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"373","title":"\u67e5\u627e\u548c\u6700\u5c0f\u7684K\u5bf9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"374","title":"\u731c\u6570\u5b57\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"375","title":"\u731c\u6570\u5b57\u5927\u5c0f II","__typename":"AppliedTranslationNode"},{"questionId":"376","title":"\u6446\u52a8\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"377","title":"\u7ec4\u5408\u603b\u548c \u2163","__typename":"AppliedTranslationNode"},{"questionId":"378","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"379","title":"\u7535\u8bdd\u76ee\u5f55\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"380","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"381","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20 - \u5141\u8bb8\u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"382","title":"\u94fe\u8868\u968f\u673a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"383","title":"\u8d4e\u91d1\u4fe1","__typename":"AppliedTranslationNode"},{"questionId":"384","title":"\u6253\u4e71\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"385","title":"\u8ff7\u4f60\u8bed\u6cd5\u5206\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"386","title":"\u5b57\u5178\u5e8f\u6392\u6570","__typename":"AppliedTranslationNode"},{"questionId":"387","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c\u4e00\u4e2a\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"388","title":"\u6587\u4ef6\u7684\u6700\u957f\u7edd\u5bf9\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"389","title":"\u627e\u4e0d\u540c","__typename":"AppliedTranslationNode"},{"questionId":"390","title":"\u6d88\u9664\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"391","title":"\u5b8c\u7f8e\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"392","title":"\u5224\u65ad\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"393","title":"UTF-8 \u7f16\u7801\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"394","title":"\u5b57\u7b26\u4e32\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"395","title":"\u81f3\u5c11\u6709 K \u4e2a\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"396","title":"\u65cb\u8f6c\u51fd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"397","title":"\u6574\u6570\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"398","title":"\u968f\u673a\u6570\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"399","title":"\u9664\u6cd5\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"400","title":"\u7b2c N \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"401","title":"\u4e8c\u8fdb\u5236\u624b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"402","title":"\u79fb\u6389 K \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"403","title":"\u9752\u86d9\u8fc7\u6cb3","__typename":"AppliedTranslationNode"},{"questionId":"404","title":"\u5de6\u53f6\u5b50\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"405","title":"\u6570\u5b57\u8f6c\u6362\u4e3a\u5341\u516d\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"406","title":"\u6839\u636e\u8eab\u9ad8\u91cd\u5efa\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"407","title":"\u63a5\u96e8\u6c34 II","__typename":"AppliedTranslationNode"},{"questionId":"408","title":"\u6709\u6548\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"409","title":"\u6700\u957f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"410","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"411","title":"\u6700\u77ed\u72ec\u5360\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"412","title":"Fizz Buzz","__typename":"AppliedTranslationNode"},{"questionId":"413","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"414","title":"\u7b2c\u4e09\u5927\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"415","title":"\u5b57\u7b26\u4e32\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"416","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"417","title":"\u592a\u5e73\u6d0b\u5927\u897f\u6d0b\u6c34\u6d41\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"418","title":"\u5c4f\u5e55\u53ef\u663e\u793a\u53e5\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"419","title":"\u7532\u677f\u4e0a\u7684\u6218\u8230","__typename":"AppliedTranslationNode"},{"questionId":"420","title":"\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668","__typename":"AppliedTranslationNode"},{"questionId":"421","title":"\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"422","title":"\u6709\u6548\u7684\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"423","title":"\u4ece\u82f1\u6587\u4e2d\u91cd\u5efa\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"424","title":"\u66ff\u6362\u540e\u7684\u6700\u957f\u91cd\u590d\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"425","title":"\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"432","title":"\u5168 O(1) \u7684\u6570\u636e\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"433","title":"\u6700\u5c0f\u57fa\u56e0\u53d8\u5316","__typename":"AppliedTranslationNode"},{"questionId":"434","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"435","title":"\u65e0\u91cd\u53e0\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"436","title":"\u5bfb\u627e\u53f3\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"437","title":"\u8def\u5f84\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"438","title":"\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"439","title":"\u4e09\u5143\u8868\u8fbe\u5f0f\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"440","title":"\u5b57\u5178\u5e8f\u7684\u7b2cK\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"441","title":"\u6392\u5217\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"442","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"443","title":"\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"444","title":"\u5e8f\u5217\u91cd\u5efa","__typename":"AppliedTranslationNode"},{"questionId":"445","title":"\u4e24\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"446","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206 II - \u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"447","title":"\u56de\u65cb\u9556\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"448","title":"\u627e\u5230\u6240\u6709\u6570\u7ec4\u4e2d\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"449","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"450","title":"\u5220\u9664\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"451","title":"\u6839\u636e\u5b57\u7b26\u51fa\u73b0\u9891\u7387\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"452","title":"\u7528\u6700\u5c11\u6570\u91cf\u7684\u7bad\u5f15\u7206\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"453","title":"\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"454","title":"\u56db\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"455","title":"\u5206\u53d1\u997c\u5e72","__typename":"AppliedTranslationNode"},{"questionId":"456","title":"132 \u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"457","title":"\u73af\u5f62\u6570\u7ec4\u662f\u5426\u5b58\u5728\u5faa\u73af","__typename":"AppliedTranslationNode"},{"questionId":"458","title":"\u53ef\u601c\u7684\u5c0f\u732a","__typename":"AppliedTranslationNode"},{"questionId":"459","title":"\u91cd\u590d\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"460","title":"LFU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"461","title":"\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"462","title":"\u6700\u5c11\u79fb\u52a8\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49 II","__typename":"AppliedTranslationNode"},{"questionId":"463","title":"\u5c9b\u5c7f\u7684\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"464","title":"\u6211\u80fd\u8d62\u5417","__typename":"AppliedTranslationNode"},{"questionId":"465","title":"\u6700\u4f18\u8d26\u5355\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"466","title":"\u7edf\u8ba1\u91cd\u590d\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"467","title":"\u73af\u7ed5\u5b57\u7b26\u4e32\u4e2d\u552f\u4e00\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"468","title":"\u9a8c\u8bc1IP\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"469","title":"\u51f8\u591a\u8fb9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"471","title":"\u7f16\u7801\u6700\u77ed\u957f\u5ea6\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"472","title":"\u8fde\u63a5\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"473","title":"\u706b\u67f4\u62fc\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"474","title":"\u4e00\u548c\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"475","title":"\u4f9b\u6696\u5668","__typename":"AppliedTranslationNode"},{"questionId":"476","title":"\u6570\u5b57\u7684\u8865\u6570","__typename":"AppliedTranslationNode"},{"questionId":"477","title":"\u6c49\u660e\u8ddd\u79bb\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"479","title":"\u6700\u5927\u56de\u6587\u6570\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"480","title":"\u6ed1\u52a8\u7a97\u53e3\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"481","title":"\u795e\u5947\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"482","title":"\u5bc6\u94a5\u683c\u5f0f\u5316","__typename":"AppliedTranslationNode"},{"questionId":"483","title":"\u6700\u5c0f\u597d\u8fdb\u5236","__typename":"AppliedTranslationNode"},{"questionId":"484","title":"\u5bfb\u627e\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"485","title":"\u6700\u5927\u8fde\u7eed 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"486","title":"\u9884\u6d4b\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"487","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"488","title":"\u7956\u739b\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"489","title":"\u7b2c K \u6761\u6700\u5c0f\u6307\u4ee4","__typename":"AppliedTranslationNode"},{"questionId":"490","title":"\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"491","title":"\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"492","title":"\u6784\u9020\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"493","title":"\u7ffb\u8f6c\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"494","title":"\u76ee\u6807\u548c","__typename":"AppliedTranslationNode"},{"questionId":"495","title":"\u63d0\u83ab\u653b\u51fb","__typename":"AppliedTranslationNode"},{"questionId":"496","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"498","title":"\u5bf9\u89d2\u7ebf\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"499","title":"\u8ff7\u5bab III","__typename":"AppliedTranslationNode"},{"questionId":"500","title":"\u952e\u76d8\u884c","__typename":"AppliedTranslationNode"},{"questionId":"501","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4f17\u6570","__typename":"AppliedTranslationNode"},{"questionId":"502","title":"IPO","__typename":"AppliedTranslationNode"},{"questionId":"503","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"504","title":"\u4e03\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"505","title":"\u8ff7\u5bab II","__typename":"AppliedTranslationNode"},{"questionId":"506","title":"\u76f8\u5bf9\u540d\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"507","title":"\u5b8c\u7f8e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"508","title":"\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b50\u6811\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"509","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7 II","__typename":"AppliedTranslationNode"},{"questionId":"511","title":"\u4ece\u59cb\u70b9\u5230\u7ec8\u70b9\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"513","title":"\u627e\u6811\u5de6\u4e0b\u89d2\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"514","title":"\u81ea\u7531\u4e4b\u8def","__typename":"AppliedTranslationNode"},{"questionId":"515","title":"\u5728\u6bcf\u4e2a\u6811\u884c\u4e2d\u627e\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"516","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"517","title":"\u8d85\u7ea7\u6d17\u8863\u673a","__typename":"AppliedTranslationNode"},{"questionId":"518","title":"\u96f6\u94b1\u5151\u6362 II","__typename":"AppliedTranslationNode"},{"questionId":"520","title":"\u68c0\u6d4b\u5927\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"521","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 \u2160","__typename":"AppliedTranslationNode"},{"questionId":"522","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"523","title":"\u8fde\u7eed\u7684\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"524","title":"\u901a\u8fc7\u5220\u9664\u5b57\u6bcd\u5339\u914d\u5230\u5b57\u5178\u91cc\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"525","title":"\u8fde\u7eed\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"526","title":"\u4f18\u7f8e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"527","title":"\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"528","title":"\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"529","title":"\u626b\u96f7\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"530","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"531","title":"\u5b64\u72ec\u50cf\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"532","title":"\u6570\u7ec4\u4e2d\u7684 k-diff \u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"533","title":"\u5b64\u72ec\u50cf\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"535","title":"TinyURL \u7684\u52a0\u5bc6\u4e0e\u89e3\u5bc6","__typename":"AppliedTranslationNode"},{"questionId":"536","title":"\u4ece\u5b57\u7b26\u4e32\u751f\u6210\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"537","title":"\u590d\u6570\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"538","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"539","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"540","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u5355\u4e00\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"541","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"542","title":"01 \u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"543","title":"\u4e8c\u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"544","title":"\u8f93\u51fa\u6bd4\u8d5b\u5339\u914d\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"545","title":"\u4e8c\u53c9\u6811\u7684\u8fb9\u754c","__typename":"AppliedTranslationNode"},{"questionId":"546","title":"\u79fb\u9664\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"547","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"548","title":"\u5c06\u6570\u7ec4\u5206\u5272\u6210\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"549","title":"\u4e8c\u53c9\u6811\u4e2d\u6700\u957f\u7684\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"550","title":"\u83b7\u53d6\u98df\u7269\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"551","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 I","__typename":"AppliedTranslationNode"},{"questionId":"552","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"553","title":"\u6700\u4f18\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"554","title":"\u7816\u5899","__typename":"AppliedTranslationNode"},{"questionId":"555","title":"\u5206\u5272\u8fde\u63a5\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"556","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"557","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd III","__typename":"AppliedTranslationNode"},{"questionId":"560","title":"\u548c\u4e3a K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"561","title":"\u6570\u7ec4\u62c6\u5206 I","__typename":"AppliedTranslationNode"},{"questionId":"562","title":"\u77e9\u9635\u4e2d\u6700\u957f\u7684\u8fde\u7eed1\u7ebf\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"563","title":"\u4e8c\u53c9\u6811\u7684\u5761\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"564","title":"\u5bfb\u627e\u6700\u8fd1\u7684\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"565","title":"\u6570\u7ec4\u5d4c\u5957","__typename":"AppliedTranslationNode"},{"questionId":"566","title":"\u91cd\u5851\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"567","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"568","title":"\u6700\u5927\u4f11\u5047\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"569","title":"\u5458\u5de5\u85aa\u6c34\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"570","title":"\u81f3\u5c11\u67095\u540d\u76f4\u63a5\u4e0b\u5c5e\u7684\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"571","title":"\u7ed9\u5b9a\u6570\u5b57\u7684\u9891\u7387\u67e5\u8be2\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"572","title":"\u53e6\u4e00\u68f5\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"573","title":"\u677e\u9f20\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"574","title":"\u5f53\u9009\u8005","__typename":"AppliedTranslationNode"},{"questionId":"575","title":"\u5206\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"576","title":"\u51fa\u754c\u7684\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"577","title":"\u5458\u5de5\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"578","title":"\u67e5\u8be2\u56de\u7b54\u7387\u6700\u9ad8\u7684\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"579","title":"\u67e5\u8be2\u5458\u5de5\u7684\u7d2f\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"580","title":"\u7edf\u8ba1\u5404\u4e13\u4e1a\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"581","title":"\u6700\u77ed\u65e0\u5e8f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"582","title":"\u6740\u6389\u8fdb\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"583","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u5220\u9664\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"584","title":"\u5bfb\u627e\u7528\u6237\u63a8\u8350\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"585","title":"2016\u5e74\u7684\u6295\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"586","title":"\u8ba2\u5355\u6700\u591a\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"587","title":"\u5b89\u88c5\u6805\u680f","__typename":"AppliedTranslationNode"},{"questionId":"588","title":"\u8bbe\u8ba1\u5185\u5b58\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"591","title":"\u6807\u7b7e\u9a8c\u8bc1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"592","title":"\u5206\u6570\u52a0\u51cf\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"593","title":"\u6709\u6548\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"594","title":"\u6700\u957f\u548c\u8c10\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"595","title":"\u5927\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"596","title":"\u8d85\u8fc75\u540d\u5b66\u751f\u7684\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"597","title":"\u597d\u53cb\u7533\u8bf7 I\uff1a\u603b\u4f53\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"598","title":"\u8303\u56f4\u6c42\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"599","title":"\u4e24\u4e2a\u5217\u8868\u7684\u6700\u5c0f\u7d22\u5f15\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"600","title":"\u4e0d\u542b\u8fde\u7eed1\u7684\u975e\u8d1f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"601","title":"\u4f53\u80b2\u9986\u7684\u4eba\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"602","title":"\u597d\u53cb\u7533\u8bf7 II \uff1a\u8c01\u6709\u6700\u591a\u7684\u597d\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"603","title":"\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"604","title":"\u8fed\u4ee3\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"605","title":"\u79cd\u82b1\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"606","title":"\u6839\u636e\u4e8c\u53c9\u6811\u521b\u5efa\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"607","title":"\u9500\u552e\u5458","__typename":"AppliedTranslationNode"},{"questionId":"608","title":"\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"609","title":"\u5728\u7cfb\u7edf\u4e2d\u67e5\u627e\u91cd\u590d\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"610","title":"\u5224\u65ad\u4e09\u89d2\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"611","title":"\u6709\u6548\u4e09\u89d2\u5f62\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"612","title":"\u5e73\u9762\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"613","title":"\u76f4\u7ebf\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"614","title":"\u4e8c\u7ea7\u5173\u6ce8\u8005","__typename":"AppliedTranslationNode"},{"questionId":"615","title":"\u5e73\u5747\u5de5\u8d44\uff1a\u90e8\u95e8\u4e0e\u516c\u53f8\u6bd4\u8f83","__typename":"AppliedTranslationNode"},{"questionId":"616","title":"\u7ed9\u5b57\u7b26\u4e32\u6dfb\u52a0\u52a0\u7c97\u6807\u7b7e","__typename":"AppliedTranslationNode"},{"questionId":"617","title":"\u5408\u5e76\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"618","title":"\u5b66\u751f\u5730\u7406\u4fe1\u606f\u62a5\u544a","__typename":"AppliedTranslationNode"},{"questionId":"619","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"620","title":"\u6709\u8da3\u7684\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"621","title":"\u4efb\u52a1\u8c03\u5ea6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"623","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u589e\u52a0\u4e00\u884c","__typename":"AppliedTranslationNode"},{"questionId":"624","title":"\u6570\u7ec4\u5217\u8868\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"625","title":"\u6700\u5c0f\u56e0\u5f0f\u5206\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"626","title":"\u6362\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"627","title":"\u53d8\u66f4\u6027\u522b","__typename":"AppliedTranslationNode"},{"questionId":"628","title":"\u4e09\u4e2a\u6570\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"629","title":"K\u4e2a\u9006\u5e8f\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"630","title":"\u8bfe\u7a0b\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"631","title":"\u8bbe\u8ba1 Excel \u6c42\u548c\u516c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"632","title":"\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"633","title":"\u5e73\u65b9\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"634","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u9519\u4f4d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"635","title":"\u8bbe\u8ba1\u65e5\u5fd7\u5b58\u50a8\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"636","title":"\u51fd\u6570\u7684\u72ec\u5360\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"637","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"638","title":"\u5927\u793c\u5305","__typename":"AppliedTranslationNode"},{"questionId":"639","title":"\u89e3\u7801\u65b9\u6cd5 II","__typename":"AppliedTranslationNode"},{"questionId":"640","title":"\u6c42\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"642","title":"\u8bbe\u8ba1\u641c\u7d22\u81ea\u52a8\u8865\u5168\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"643","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 I","__typename":"AppliedTranslationNode"},{"questionId":"644","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"645","title":"\u9519\u8bef\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"646","title":"\u6700\u957f\u6570\u5bf9\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"647","title":"\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"648","title":"\u5355\u8bcd\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"649","title":"Dota2 \u53c2\u8bae\u9662","__typename":"AppliedTranslationNode"},{"questionId":"650","title":"\u53ea\u6709\u4e24\u4e2a\u952e\u7684\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"651","title":"4\u952e\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"652","title":"\u5bfb\u627e\u91cd\u590d\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"653","title":"\u4e24\u6570\u4e4b\u548c IV - \u8f93\u5165 BST","__typename":"AppliedTranslationNode"},{"questionId":"654","title":"\u6700\u5927\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"655","title":"\u8f93\u51fa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"656","title":"\u91d1\u5e01\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"657","title":"\u673a\u5668\u4eba\u80fd\u5426\u8fd4\u56de\u539f\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"658","title":"\u627e\u5230 K \u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"659","title":"\u5206\u5272\u6570\u7ec4\u4e3a\u8fde\u7eed\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"660","title":"\u79fb\u9664 9","__typename":"AppliedTranslationNode"},{"questionId":"661","title":"\u56fe\u7247\u5e73\u6ed1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"662","title":"\u4e8c\u53c9\u6811\u6700\u5927\u5bbd\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"663","title":"\u5747\u5300\u6811\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"664","title":"\u5947\u602a\u7684\u6253\u5370\u673a","__typename":"AppliedTranslationNode"},{"questionId":"665","title":"\u975e\u9012\u51cf\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"666","title":"\u8def\u5f84\u603b\u548c IV","__typename":"AppliedTranslationNode"},{"questionId":"667","title":"\u4f18\u7f8e\u7684\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"668","title":"\u4e58\u6cd5\u8868\u4e2d\u7b2ck\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"669","title":"\u4fee\u526a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"670","title":"\u6700\u5927\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"671","title":"\u4e8c\u53c9\u6811\u4e2d\u7b2c\u4e8c\u5c0f\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"672","title":"\u706f\u6ce1\u5f00\u5173 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"673","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"674","title":"\u6700\u957f\u8fde\u7eed\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"675","title":"\u4e3a\u9ad8\u5c14\u592b\u6bd4\u8d5b\u780d\u6811","__typename":"AppliedTranslationNode"},{"questionId":"676","title":"\u5b9e\u73b0\u4e00\u4e2a\u9b54\u6cd5\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"677","title":"\u952e\u503c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"678","title":"\u6709\u6548\u7684\u62ec\u53f7\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"679","title":"24 \u70b9\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"680","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"681","title":"\u6700\u8fd1\u65f6\u523b","__typename":"AppliedTranslationNode"},{"questionId":"682","title":"\u68d2\u7403\u6bd4\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"683","title":"K \u4e2a\u5173\u95ed\u7684\u706f\u6ce1","__typename":"AppliedTranslationNode"},{"questionId":"684","title":"\u5197\u4f59\u8fde\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"685","title":"\u5197\u4f59\u8fde\u63a5 II","__typename":"AppliedTranslationNode"},{"questionId":"686","title":"\u91cd\u590d\u53e0\u52a0\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"687","title":"\u6700\u957f\u540c\u503c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"688","title":"\u201c\u9a6c\u201d\u5728\u68cb\u76d8\u4e0a\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"689","title":"\u4e09\u4e2a\u65e0\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"690","title":"\u5458\u5de5\u7684\u91cd\u8981\u6027","__typename":"AppliedTranslationNode"},{"questionId":"691","title":"\u8d34\u7eb8\u62fc\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"692","title":"\u524dK\u4e2a\u9ad8\u9891\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"693","title":"\u4ea4\u66ff\u4f4d\u4e8c\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"694","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"695","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"696","title":"\u8ba1\u6570\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"697","title":"\u6570\u7ec4\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"698","title":"\u5212\u5206\u4e3ak\u4e2a\u76f8\u7b49\u7684\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"699","title":"\u6389\u843d\u7684\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"711","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"712","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5c0fASCII\u5220\u9664\u548c","__typename":"AppliedTranslationNode"},{"questionId":"713","title":"\u4e58\u79ef\u5c0f\u4e8eK\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"714","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u624b\u7eed\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"715","title":"Range \u6a21\u5757","__typename":"AppliedTranslationNode"},{"questionId":"716","title":"\u6700\u5927\u6808","__typename":"AppliedTranslationNode"},{"questionId":"717","title":"1\u6bd4\u7279\u4e0e2\u6bd4\u7279\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"718","title":"\u6700\u957f\u91cd\u590d\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"719","title":"\u627e\u51fa\u7b2c k \u5c0f\u7684\u8ddd\u79bb\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"720","title":"\u8bcd\u5178\u4e2d\u6700\u957f\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"721","title":"\u8d26\u6237\u5408\u5e76","__typename":"AppliedTranslationNode"},{"questionId":"722","title":"\u5220\u9664\u6ce8\u91ca","__typename":"AppliedTranslationNode"},{"questionId":"723","title":"\u7c89\u788e\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"724","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u4e0b\u6807","__typename":"AppliedTranslationNode"},{"questionId":"725","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"726","title":"\u539f\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"727","title":"\u6700\u5c0f\u7a97\u53e3\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"728","title":"\u81ea\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"729","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 I","__typename":"AppliedTranslationNode"},{"questionId":"730","title":"\u7edf\u8ba1\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"731","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"732","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"733","title":"\u56fe\u50cf\u6e32\u67d3","__typename":"AppliedTranslationNode"},{"questionId":"734","title":"\u53e5\u5b50\u76f8\u4f3c\u6027","__typename":"AppliedTranslationNode"},{"questionId":"735","title":"\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"736","title":"Lisp \u8bed\u6cd5\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"737","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 II","__typename":"AppliedTranslationNode"},{"questionId":"738","title":"\u5355\u8c03\u9012\u589e\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"739","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"740","title":"\u5220\u9664\u5e76\u83b7\u5f97\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"741","title":"\u6458\u6a31\u6843","__typename":"AppliedTranslationNode"},{"questionId":"742","title":"\u8f6c\u6362\u6210\u5c0f\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"743","title":"\u4e8c\u53c9\u6811\u6700\u8fd1\u7684\u53f6\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"744","title":"\u7f51\u7edc\u5ef6\u8fdf\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"745","title":"\u5bfb\u627e\u6bd4\u76ee\u6807\u5b57\u6bcd\u5927\u7684\u6700\u5c0f\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"746","title":"\u524d\u7f00\u548c\u540e\u7f00\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"747","title":"\u4f7f\u7528\u6700\u5c0f\u82b1\u8d39\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"748","title":"\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"749","title":"\u6700\u77ed\u8865\u5168\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"750","title":"\u9694\u79bb\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"751","title":"\u89d2\u77e9\u5f62\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"752","title":"IP \u5230 CIDR","__typename":"AppliedTranslationNode"},{"questionId":"753","title":"\u6253\u5f00\u8f6c\u76d8\u9501","__typename":"AppliedTranslationNode"},{"questionId":"754","title":"\u7834\u89e3\u4fdd\u9669\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"755","title":"\u5230\u8fbe\u7ec8\u70b9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"756","title":"\u5012\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"757","title":"\u91d1\u5b57\u5854\u8f6c\u6362\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"758","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u5316\u4e3a\u6392\u5e8f\u7684\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"759","title":"\u8bbe\u7f6e\u4ea4\u96c6\u5927\u5c0f\u81f3\u5c11\u4e3a2","__typename":"AppliedTranslationNode"},{"questionId":"760","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u52a0\u7c97\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"761","title":"\u5458\u5de5\u7a7a\u95f2\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"762","title":"\u627e\u51fa\u53d8\u4f4d\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"763","title":"\u7279\u6b8a\u7684\u4e8c\u8fdb\u5236\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"764","title":"N \u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"765","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"766","title":"\u6241\u5e73\u5316\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"767","title":"\u4e8c\u8fdb\u5236\u8868\u793a\u4e2d\u8d28\u6570\u4e2a\u8ba1\u7b97\u7f6e\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"768","title":"\u5212\u5206\u5b57\u6bcd\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"769","title":"\u6700\u5927\u52a0\u53f7\u6807\u5fd7","__typename":"AppliedTranslationNode"},{"questionId":"770","title":"\u60c5\u4fa3\u7275\u624b","__typename":"AppliedTranslationNode"},{"questionId":"771","title":"\u5c06 N \u53c9\u6811\u7f16\u7801\u4e3a\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"772","title":"\u5efa\u7acb\u56db\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"773","title":"\u56db\u53c9\u6811\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"774","title":"N \u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"775","title":"N \u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"776","title":"N \u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"777","title":"\u6258\u666e\u5229\u8328\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"778","title":"\u91cd\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"779","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757 II","__typename":"AppliedTranslationNode"},{"questionId":"780","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757","__typename":"AppliedTranslationNode"},{"questionId":"781","title":"\u57fa\u672c\u8ba1\u7b97\u5668 IV","__typename":"AppliedTranslationNode"},{"questionId":"782","title":"\u5b9d\u77f3\u4e0e\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"783","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"784","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u63d2\u5165\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"785","title":"\u57fa\u672c\u8ba1\u7b97\u5668 III","__typename":"AppliedTranslationNode"},{"questionId":"786","title":"\u641c\u7d22\u957f\u5ea6\u672a\u77e5\u7684\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"787","title":"\u6ed1\u52a8\u8c1c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"788","title":"\u6700\u5c0f\u5316\u53bb\u52a0\u6cb9\u7ad9\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"789","title":"\u6570\u636e\u6d41\u4e2d\u7684\u7b2c K \u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"790","title":"\u5168\u5c40\u5012\u7f6e\u4e0e\u5c40\u90e8\u5012\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"791","title":"\u62c6\u5206\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"792","title":"\u4e8c\u5206\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"793","title":"\u5728LR\u5b57\u7b26\u4e32\u4e2d\u4ea4\u6362\u76f8\u90bb\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"794","title":"\u6c34\u4f4d\u4e0a\u5347\u7684\u6cf3\u6c60\u4e2d\u6e38\u6cf3","__typename":"AppliedTranslationNode"},{"questionId":"795","title":"\u7b2cK\u4e2a\u8bed\u6cd5\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"796","title":"\u5230\u8fbe\u7ec8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"797","title":"\u68ee\u6797\u4e2d\u7684\u5154\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"798","title":"\u53d8\u4e3a\u68cb\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"799","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8282\u70b9\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"800","title":"\u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"801","title":"\u5224\u65ad\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"802","title":"\u7b2c K \u4e2a\u6700\u5c0f\u7684\u7d20\u6570\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"803","title":"K \u7ad9\u4e2d\u8f6c\u5185\u6700\u4fbf\u5b9c\u7684\u822a\u73ed","__typename":"AppliedTranslationNode"},{"questionId":"804","title":"\u65cb\u8f6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"805","title":"\u9003\u8131\u963b\u788d\u8005","__typename":"AppliedTranslationNode"},{"questionId":"806","title":"\u591a\u7c73\u8bfa\u548c\u6258\u7c73\u8bfa\u5e73\u94fa","__typename":"AppliedTranslationNode"},{"questionId":"807","title":"\u81ea\u5b9a\u4e49\u5b57\u7b26\u4e32\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"808","title":"\u5339\u914d\u5b50\u5e8f\u5217\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"809","title":"\u9636\u4e58\u51fd\u6570\u540e K \u4e2a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"810","title":"\u6709\u6548\u7684\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"811","title":"\u533a\u95f4\u5b50\u6570\u7ec4\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"812","title":"\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"813","title":"\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"814","title":"\u5f97\u5206\u6700\u9ad8\u7684\u6700\u5c0f\u8f6e\u8c03","__typename":"AppliedTranslationNode"},{"questionId":"815","title":"\u9999\u69df\u5854","__typename":"AppliedTranslationNode"},{"questionId":"816","title":"\u8bbe\u8ba1\u54c8\u5e0c\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"817","title":"\u8bbe\u8ba1\u54c8\u5e0c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"818","title":"\u76f8\u4f3c RGB \u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"819","title":"\u4f7f\u5e8f\u5217\u9012\u589e\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"820","title":"\u627e\u5230\u6700\u7ec8\u7684\u5b89\u5168\u72b6\u6001","__typename":"AppliedTranslationNode"},{"questionId":"821","title":"\u6253\u7816\u5757","__typename":"AppliedTranslationNode"},{"questionId":"822","title":"\u552f\u4e00\u6469\u5c14\u65af\u5bc6\u7801\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"823","title":"\u6570\u7ec4\u7684\u5747\u503c\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"824","title":"\u5199\u5b57\u7b26\u4e32\u9700\u8981\u7684\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"825","title":"\u4fdd\u6301\u57ce\u5e02\u5929\u9645\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"826","title":"\u5206\u6c64","__typename":"AppliedTranslationNode"},{"questionId":"827","title":"\u60c5\u611f\u4e30\u5bcc\u7684\u6587\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"828","title":"\u9ed1\u677f\u5f02\u6216\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"829","title":"\u5b50\u57df\u540d\u8bbf\u95ee\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"830","title":"\u6700\u5927\u4e09\u89d2\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"831","title":"\u6700\u5927\u5e73\u5747\u503c\u548c\u7684\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"832","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"833","title":"\u516c\u4ea4\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"834","title":"\u6a21\u7cca\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"835","title":"\u94fe\u8868\u7ec4\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"836","title":"\u8d5b\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"837","title":"\u6700\u5e38\u89c1\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"838","title":"\u8bbe\u8ba1\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"839","title":"\u5355\u8bcd\u7684\u538b\u7f29\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"841","title":"\u5b57\u7b26\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"842","title":"\u7ffb\u8f6c\u5361\u7247\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"843","title":"\u5e26\u56e0\u5b50\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"850","title":"\u5faa\u73af\u6709\u5e8f\u5217\u8868\u7684\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"851","title":"\u5c71\u7f8a\u62c9\u4e01\u6587","__typename":"AppliedTranslationNode"},{"questionId":"852","title":"\u9002\u9f84\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"853","title":"\u5b89\u6392\u5de5\u4f5c\u4ee5\u8fbe\u5230\u6700\u5927\u6536\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"854","title":"\u6700\u5927\u4eba\u5de5\u5c9b","__typename":"AppliedTranslationNode"},{"questionId":"855","title":"\u7edf\u8ba1\u5b50\u4e32\u4e2d\u7684\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"856","title":"\u8fde\u7eed\u6574\u6570\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"857","title":"\u8f83\u5927\u5206\u7ec4\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"858","title":"\u9690\u85cf\u4e2a\u4eba\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"859","title":"\u8bbe\u8ba1\u5faa\u73af\u53cc\u7aef\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"860","title":"\u8bbe\u8ba1\u5faa\u73af\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"861","title":"\u7ffb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"862","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u67e5\u627e\u4e0e\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"863","title":"\u6811\u4e2d\u8ddd\u79bb\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"864","title":"\u56fe\u50cf\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"865","title":"\u626b\u5730\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"866","title":"\u77e9\u5f62\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"867","title":"\u65b021\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"868","title":"\u63a8\u591a\u7c73\u8bfa","__typename":"AppliedTranslationNode"},{"questionId":"869","title":"\u76f8\u4f3c\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"870","title":"\u77e9\u9635\u4e2d\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"871","title":"\u94a5\u5319\u548c\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"872","title":"\u5c06\u6570\u7ec4\u62c6\u5206\u6210\u6590\u6ce2\u90a3\u5951\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"873","title":"\u731c\u731c\u8fd9\u4e2a\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"874","title":"\u6bd4\u8f83\u542b\u9000\u683c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"875","title":"\u6570\u7ec4\u4e2d\u7684\u6700\u957f\u5c71\u8109","__typename":"AppliedTranslationNode"},{"questionId":"876","title":"\u4e00\u624b\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"877","title":"\u8bbf\u95ee\u6240\u6709\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"878","title":"\u5b57\u6bcd\u79fb\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"879","title":"\u5230\u6700\u8fd1\u7684\u4eba\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"880","title":"\u77e9\u5f62\u9762\u79ef II","__typename":"AppliedTranslationNode"},{"questionId":"881","title":"\u55a7\u95f9\u548c\u5bcc\u6709","__typename":"AppliedTranslationNode"},{"questionId":"882","title":"\u5c71\u8109\u6570\u7ec4\u7684\u5cf0\u9876\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"883","title":"\u8f66\u961f","__typename":"AppliedTranslationNode"},{"questionId":"884","title":"\u76f8\u4f3c\u5ea6\u4e3a K \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"885","title":"\u8003\u573a\u5c31\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"886","title":"\u62ec\u53f7\u7684\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"887","title":"\u96c7\u4f63 K \u540d\u5de5\u4eba\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"888","title":"\u955c\u9762\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"889","title":"\u4eb2\u5bc6\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"890","title":"\u67e0\u6aac\u6c34\u627e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"891","title":"\u7ffb\u8f6c\u77e9\u9635\u540e\u7684\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"892","title":"\u548c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"893","title":"\u4e8c\u53c9\u6811\u4e2d\u6240\u6709\u8ddd\u79bb\u4e3a K \u7684\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"894","title":"\u9ed1\u540d\u5355\u4e2d\u7684\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"895","title":"\u83b7\u53d6\u6240\u6709\u94a5\u5319\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"896","title":"\u5177\u6709\u6240\u6709\u6700\u6df1\u8282\u70b9\u7684\u6700\u5c0f\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"897","title":"\u56de\u6587\u7d20\u6570","__typename":"AppliedTranslationNode"},{"questionId":"898","title":"\u8f6c\u7f6e\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"899","title":"\u4e8c\u8fdb\u5236\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"900","title":"\u91cd\u65b0\u6392\u5e8f\u5f97\u5230 2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"901","title":"\u4f18\u52bf\u6d17\u724c","__typename":"AppliedTranslationNode"},{"questionId":"902","title":"\u6700\u4f4e\u52a0\u6cb9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"903","title":"\u7528 Rand7() \u5b9e\u73b0 Rand10()","__typename":"AppliedTranslationNode"},{"questionId":"904","title":"\u53f6\u5b50\u76f8\u4f3c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"905","title":"\u6700\u957f\u7684\u6590\u6ce2\u90a3\u5951\u5b50\u5e8f\u5217\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"906","title":"\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"907","title":"\u7231\u5403\u9999\u8549\u7684\u73c2\u73c2","__typename":"AppliedTranslationNode"},{"questionId":"908","title":"\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"909","title":"\u77f3\u5b50\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"910","title":"\u7b2c N \u4e2a\u795e\u5947\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"911","title":"\u76c8\u5229\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"912","title":"\u6309\u6743\u91cd\u968f\u673a\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"913","title":"\u968f\u673a\u7ffb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"914","title":"\u975e\u91cd\u53e0\u77e9\u5f62\u4e2d\u7684\u968f\u673a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"915","title":"\u5728\u5706\u5185\u968f\u673a\u751f\u6210\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"916","title":"\u7d22\u5f15\u5904\u7684\u89e3\u7801\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"917","title":"\u6551\u751f\u8247","__typename":"AppliedTranslationNode"},{"questionId":"918","title":"\u7ec6\u5206\u56fe\u4e2d\u7684\u53ef\u5230\u8fbe\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"919","title":"\u4e09\u7ef4\u5f62\u4f53\u6295\u5f71\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"920","title":"\u4e24\u53e5\u8bdd\u4e2d\u7684\u4e0d\u5e38\u89c1\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"921","title":"\u87ba\u65cb\u77e9\u9635 III","__typename":"AppliedTranslationNode"},{"questionId":"922","title":"\u53ef\u80fd\u7684\u4e8c\u5206\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"923","title":"\u9e21\u86cb\u6389\u843d","__typename":"AppliedTranslationNode"},{"questionId":"924","title":"\u516c\u5e73\u7684\u7cd6\u679c\u68d2\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"925","title":"\u6839\u636e\u524d\u5e8f\u548c\u540e\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"926","title":"\u67e5\u627e\u548c\u66ff\u6362\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"927","title":"\u5b50\u5e8f\u5217\u5bbd\u5ea6\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"928","title":"\u4e09\u7ef4\u5f62\u4f53\u7684\u8868\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"929","title":"\u7279\u6b8a\u7b49\u4ef7\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"930","title":"\u6240\u6709\u53ef\u80fd\u7684\u6ee1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"931","title":"\u6700\u5927\u9891\u7387\u6808","__typename":"AppliedTranslationNode"},{"questionId":"932","title":"\u5355\u8c03\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"933","title":"\u9012\u589e\u987a\u5e8f\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"934","title":"\u5b50\u6570\u7ec4\u6309\u4f4d\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"935","title":"\u6709\u5e8f\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"936","title":"RLE \u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"937","title":"\u80a1\u7968\u4ef7\u683c\u8de8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"938","title":"\u6700\u5927\u4e3a N \u7684\u6570\u5b57\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"939","title":"DI \u5e8f\u5217\u7684\u6709\u6548\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"940","title":"\u6c34\u679c\u6210\u7bee","__typename":"AppliedTranslationNode"},{"questionId":"941","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"942","title":"\u8d85\u7ea7\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"943","title":"\u5b50\u6570\u7ec4\u7684\u6700\u5c0f\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"944","title":"\u6700\u5c0f\u5dee\u503c I","__typename":"AppliedTranslationNode"},{"questionId":"945","title":"\u86c7\u68af\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"946","title":"\u6700\u5c0f\u5dee\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"947","title":"\u5728\u7ebf\u9009\u4e3e","__typename":"AppliedTranslationNode"},{"questionId":"948","title":"\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"949","title":"\u732b\u548c\u8001\u9f20","__typename":"AppliedTranslationNode"},{"questionId":"950","title":"\u5361\u724c\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"951","title":"\u5206\u5272\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"952","title":"\u5355\u8bcd\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"953","title":"\u4ec5\u4ec5\u53cd\u8f6c\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"954","title":"\u73af\u5f62\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"955","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u63d2\u5165\u5668","__typename":"AppliedTranslationNode"},{"questionId":"956","title":"\u64ad\u653e\u5217\u8868\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"957","title":"\u4f7f\u62ec\u53f7\u6709\u6548\u7684\u6700\u5c11\u6dfb\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"958","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"959","title":"\u4e09\u6570\u4e4b\u548c\u7684\u591a\u79cd\u53ef\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"960","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad","__typename":"AppliedTranslationNode"},{"questionId":"961","title":"\u957f\u6309\u952e\u5165","__typename":"AppliedTranslationNode"},{"questionId":"962","title":"\u5c06\u5b57\u7b26\u4e32\u7ffb\u8f6c\u5230\u5355\u8c03\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"963","title":"\u4e09\u7b49\u5206","__typename":"AppliedTranslationNode"},{"questionId":"964","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad II","__typename":"AppliedTranslationNode"},{"questionId":"965","title":"\u72ec\u7279\u7684\u7535\u5b50\u90ae\u4ef6\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"966","title":"\u548c\u76f8\u540c\u7684\u4e8c\u5143\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"967","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"968","title":"\u6f02\u4eae\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"969","title":"\u6700\u8fd1\u7684\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"971","title":"\u6700\u77ed\u7684\u6865","__typename":"AppliedTranslationNode"},{"questionId":"972","title":"\u9a91\u58eb\u62e8\u53f7\u5668","__typename":"AppliedTranslationNode"},{"questionId":"973","title":"\u6233\u5370\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"974","title":"\u91cd\u65b0\u6392\u5217\u65e5\u5fd7\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"975","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u8303\u56f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"976","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"977","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"978","title":"\u6709\u6548\u7684\u5c71\u8109\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"979","title":"\u589e\u51cf\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"980","title":"\u6700\u77ed\u8d85\u7ea7\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"981","title":"\u5220\u5217\u9020\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"982","title":"\u4f7f\u6570\u7ec4\u552f\u4e00\u7684\u6700\u5c0f\u589e\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"983","title":"\u9a8c\u8bc1\u6808\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"984","title":"\u79fb\u9664\u6700\u591a\u7684\u540c\u884c\u6216\u540c\u5217\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"985","title":"\u4ee4\u724c\u653e\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"986","title":"\u7ed9\u5b9a\u6570\u5b57\u80fd\u7ec4\u6210\u7684\u6700\u5927\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"987","title":"\u6309\u9012\u589e\u987a\u5e8f\u663e\u793a\u5361\u724c","__typename":"AppliedTranslationNode"},{"questionId":"988","title":"\u7ffb\u8f6c\u7b49\u4ef7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"989","title":"\u6309\u516c\u56e0\u6570\u8ba1\u7b97\u6700\u5927\u7ec4\u4ef6\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"990","title":"\u9a8c\u8bc1\u5916\u661f\u8bed\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"991","title":"\u4e8c\u500d\u6570\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"992","title":"\u5220\u5217\u9020\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"993","title":"\u6700\u9ad8\u7684\u5e7f\u544a\u724c","__typename":"AppliedTranslationNode"},{"questionId":"994","title":"N \u5929\u540e\u7684\u7262\u623f","__typename":"AppliedTranslationNode"},{"questionId":"998","title":"\u4e8c\u53c9\u6811\u7684\u5b8c\u5168\u6027\u68c0\u9a8c","__typename":"AppliedTranslationNode"},{"questionId":"999","title":"\u7531\u659c\u6760\u5212\u5206\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1000","title":"\u5220\u5217\u9020\u5e8f III","__typename":"AppliedTranslationNode"},{"questionId":"1001","title":"\u91cd\u590d N \u6b21\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1002","title":"\u6700\u5927\u5bbd\u5ea6\u5761","__typename":"AppliedTranslationNode"},{"questionId":"1003","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62 II","__typename":"AppliedTranslationNode"},{"questionId":"1004","title":"\u8868\u793a\u6570\u5b57\u7684\u6700\u5c11\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1005","title":"\u5355\u503c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1006","title":"\u5143\u97f3\u62fc\u5199\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1007","title":"\u8fde\u7eed\u5dee\u76f8\u540c\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1008","title":"\u76d1\u63a7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1009","title":"\u714e\u997c\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1010","title":"\u5f3a\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1011","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811\u4ee5\u5339\u914d\u5148\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1012","title":"\u76f8\u7b49\u7684\u6709\u7406\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1013","title":"\u6590\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1014","title":"\u6700\u63a5\u8fd1\u539f\u70b9\u7684 K \u4e2a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1016","title":"\u548c\u53ef\u88ab K \u6574\u9664\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1017","title":"\u5947\u5076\u8df3","__typename":"AppliedTranslationNode"},{"questionId":"1018","title":"\u4e09\u89d2\u5f62\u7684\u6700\u5927\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1019","title":"\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1020","title":"\u6700\u957f\u6e4d\u6d41\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1021","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u5206\u914d\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1022","title":"\u4e0d\u540c\u8def\u5f84 III","__typename":"AppliedTranslationNode"},{"questionId":"1023","title":"\u57fa\u4e8e\u65f6\u95f4\u7684\u952e\u503c\u5b58\u50a8","__typename":"AppliedTranslationNode"},{"questionId":"1024","title":"\u6309\u4f4d\u4e0e\u4e3a\u96f6\u7684\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1025","title":"\u6700\u4f4e\u7968\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1026","title":"\u4e0d\u542b AAA \u6216 BBB \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1027","title":"\u67e5\u8be2\u540e\u7684\u5076\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1028","title":"\u533a\u95f4\u5217\u8868\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1029","title":"\u4e8c\u53c9\u6811\u7684\u5782\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1030","title":"\u4ece\u53f6\u7ed3\u70b9\u5f00\u59cb\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1031","title":"\u6570\u7ec4\u5f62\u5f0f\u7684\u6574\u6570\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1032","title":"\u7b49\u5f0f\u65b9\u7a0b\u7684\u53ef\u6ee1\u8db3\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1033","title":"\u574f\u4e86\u7684\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1034","title":"K \u4e2a\u4e0d\u540c\u6574\u6570\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1035","title":"\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1036","title":"\u8150\u70c2\u7684\u6a58\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1037","title":"K \u8fde\u7eed\u4f4d\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1038","title":"\u6b63\u65b9\u5f62\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1039","title":"\u627e\u5230\u5c0f\u9547\u7684\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1040","title":"\u6700\u5927\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"1041","title":"\u53ef\u4ee5\u88ab\u4e00\u6b65\u6355\u83b7\u7684\u68cb\u5b50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1042","title":"\u5408\u5e76\u77f3\u5934\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1043","title":"\u7f51\u683c\u7167\u660e","__typename":"AppliedTranslationNode"},{"questionId":"1044","title":"\u67e5\u627e\u5171\u7528\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1045","title":"\u68c0\u67e5\u66ff\u6362\u540e\u7684\u8bcd\u662f\u5426\u6709\u6548","__typename":"AppliedTranslationNode"},{"questionId":"1046","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1047","title":"K \u6b21\u53d6\u53cd\u540e\u6700\u5927\u5316\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1048","title":"\u7b28\u9636\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"1049","title":"\u884c\u76f8\u7b49\u7684\u6700\u5c11\u591a\u7c73\u8bfa\u65cb\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"1050","title":"\u524d\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1051","title":"\u5f62\u6210\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1052","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1053","title":"\u6700\u5c0f\u5316\u820d\u5165\u8bef\u5dee\u4ee5\u6ee1\u8db3\u76ee\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1054","title":"\u5341\u8fdb\u5236\u6574\u6570\u7684\u53cd\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1055","title":"\u603b\u6301\u7eed\u65f6\u95f4\u53ef\u88ab 60 \u6574\u9664\u7684\u6b4c\u66f2","__typename":"AppliedTranslationNode"},{"questionId":"1056","title":"\u5728 D \u5929\u5185\u9001\u8fbe\u5305\u88f9\u7684\u80fd\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1057","title":"\u81f3\u5c11\u6709 1 \u4f4d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1058","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5217\u6700\u5c0f\u7684\u7b49\u6548\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1059","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7f3a\u5931\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1060","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1061","title":"\u6709\u6548\u5b50\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1062","title":"\u5c06\u6570\u7ec4\u5206\u6210\u548c\u76f8\u7b49\u7684\u4e09\u4e2a\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1063","title":"\u6700\u4f73\u89c2\u5149\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1064","title":"\u53ef\u88ab K \u6574\u9664\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1065","title":"\u5b50\u4e32\u80fd\u8868\u793a\u4ece 1 \u5230 N \u6570\u5b57\u7684\u4e8c\u8fdb\u5236\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1066","title":"\u4e0d\u52a8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1067","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d II","__typename":"AppliedTranslationNode"},{"questionId":"1068","title":"\u8303\u56f4\u5185\u7684\u6570\u5b57\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1069","title":"\u6613\u6df7\u6dc6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1070","title":"\u8d1f\u4e8c\u8fdb\u5236\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1071","title":"\u53ef\u88ab 5 \u6574\u9664\u7684\u4e8c\u8fdb\u5236\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1072","title":"\u94fe\u8868\u4e2d\u7684\u4e0b\u4e00\u4e2a\u66f4\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1073","title":"\u98de\u5730\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1074","title":"\u524d\u4e94\u79d1\u7684\u5747\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1075","title":"\u5b57\u7b26\u4e32\u7684\u7d22\u5f15\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1076","title":"\u82b1\u62ec\u53f7\u5c55\u5f00","__typename":"AppliedTranslationNode"},{"questionId":"1077","title":"\u6613\u6df7\u6dc6\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"1078","title":"\u5220\u9664\u6700\u5916\u5c42\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1079","title":"\u4ece\u6839\u5230\u53f6\u7684\u4e8c\u8fdb\u5236\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1080","title":"\u9a7c\u5cf0\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1081","title":"\u89c6\u9891\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1082","title":"\u6700\u5c0f\u5143\u7d20\u5404\u6570\u4f4d\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1083","title":"\u5c0f\u4e8e K \u7684\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1084","title":"\u957f\u5ea6\u4e3a K \u7684\u65e0\u91cd\u590d\u5b57\u7b26\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1085","title":"\u5f7c\u6b64\u719f\u8bc6\u7684\u6700\u65e9\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1086","title":"\u9664\u6570\u535a\u5f08","__typename":"AppliedTranslationNode"},{"questionId":"1087","title":"\u6700\u957f\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1088","title":"\u4e00\u6708\u6709\u591a\u5c11\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1089","title":"\u5220\u53bb\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3","__typename":"AppliedTranslationNode"},{"questionId":"1090","title":"\u963f\u59c6\u65af\u7279\u6717\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1091","title":"\u5b50\u6811\u7684\u6700\u5927\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1092","title":"\u8282\u70b9\u4e0e\u5176\u7956\u5148\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1093","title":"\u4ece\u5148\u5e8f\u904d\u5386\u8fd8\u539f\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1094","title":"\u8ddd\u79bb\u987a\u5e8f\u6392\u5217\u77e9\u9635\u5355\u5143\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1095","title":"\u4e24\u5730\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1096","title":"\u4e24\u4e2a\u975e\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1097","title":"\u5b57\u7b26\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1098","title":"\u6700\u5927\u552f\u4e00\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1099","title":"\u5f97\u5206\u6700\u9ad8\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1100","title":"\u6700\u4f4e\u6210\u672c\u8054\u901a\u6240\u6709\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1101","title":"\u5e73\u884c\u8bfe\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1102","title":"\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u5728\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1103","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed","__typename":"AppliedTranslationNode"},{"questionId":"1104","title":"\u8fb9\u6846\u7740\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1105","title":"\u4e0d\u76f8\u4ea4\u7684\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1106","title":"\u9003\u79bb\u5927\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1107","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1","__typename":"AppliedTranslationNode"},{"questionId":"1108","title":"\u7528\u6237\u7f51\u7ad9\u8bbf\u95ee\u884c\u4e3a\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1110","title":"\u516c\u8def\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1111","title":"\u591a\u8fb9\u5f62\u4e09\u89d2\u5256\u5206\u7684\u6700\u4f4e\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1112","title":"\u62fc\u5199\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1113","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed II","__typename":"AppliedTranslationNode"},{"questionId":"1114","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1115","title":"\u6709\u6548\u7684\u56de\u65cb\u9556","__typename":"AppliedTranslationNode"},{"questionId":"1116","title":"\u6700\u5927\u5c42\u5185\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1117","title":"\u5730\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1118","title":"\u5c06\u6570\u7ec4\u5206\u6210\u51e0\u4e2a\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1119","title":"\u56f0\u4e8e\u73af\u4e2d\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1120","title":"\u4e0d\u90bb\u63a5\u690d\u82b1","__typename":"AppliedTranslationNode"},{"questionId":"1121","title":"\u5206\u9694\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1122","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1123","title":"\u5355\u884c\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1124","title":"\u5b57\u7b26\u4e32\u8f6c\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1125","title":"\u8bbe\u8ba1\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1126","title":"\u8fde\u63a5\u68d2\u6750\u7684\u6700\u4f4e\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1127","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1128","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"1129","title":"\u6700\u957f\u5b57\u7b26\u4e32\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"1130","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"1131","title":"\u7edf\u8ba1\u53ea\u542b\u5355\u4e00\u5b57\u6bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1132","title":"\u524d\u540e\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1133","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5728\u6700\u540e\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1134","title":"\u4e0e\u76ee\u6807\u989c\u8272\u95f4\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1135","title":"\u4e70\u4e0b\u6240\u6709\u4ea7\u54c1\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1136","title":"\u5408\u4f5c\u8fc7\u81f3\u5c11\u4e09\u6b21\u7684\u6f14\u5458\u548c\u5bfc\u6f14","__typename":"AppliedTranslationNode"},{"questionId":"1137","title":"\u9ad8\u5ea6\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1138","title":"\u7231\u751f\u6c14\u7684\u4e66\u5e97\u8001\u677f","__typename":"AppliedTranslationNode"},{"questionId":"1139","title":"\u4ea4\u6362\u4e00\u6b21\u7684\u5148\u524d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1140","title":"\u8ddd\u79bb\u76f8\u7b49\u7684\u6761\u5f62\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1141","title":"\u6700\u591a\u53ef\u4ee5\u4e70\u5230\u7684\u82f9\u679c\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1142","title":"\u8fdb\u51fb\u7684\u9a91\u58eb","__typename":"AppliedTranslationNode"},{"questionId":"1143","title":"\u627e\u51fa\u6240\u6709\u884c\u4e2d\u6700\u5c0f\u516c\u5171\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1144","title":"\u6c34\u8d44\u6e90\u5206\u914d\u4f18\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1145","title":"\u5143\u7d20\u548c\u4e3a\u76ee\u6807\u503c\u7684\u5b50\u77e9\u9635\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1146","title":"\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1147","title":"\u6309\u5217\u7ffb\u8f6c\u5f97\u5230\u6700\u5927\u503c\u7b49\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1148","title":"\u8d1f\u4e8c\u8fdb\u5236\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1149","title":"\u4e09\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1150","title":"\u67e5\u627e\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1151","title":"\u6b65\u8fdb\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1152","title":"\u77e9\u9635\u4e2d 1 \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1153","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1154","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1155","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1156","title":"Bigram \u5206\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1157","title":"\u6839\u5230\u53f6\u8def\u5f84\u4e0a\u7684\u4e0d\u8db3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1159","title":"\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1160","title":"\u6d3b\u5b57\u5370\u5237","__typename":"AppliedTranslationNode"},{"questionId":"1161","title":"\u9879\u76ee\u5458\u5de5 I","__typename":"AppliedTranslationNode"},{"questionId":"1162","title":"\u9879\u76ee\u5458\u5de5II","__typename":"AppliedTranslationNode"},{"questionId":"1163","title":"\u9879\u76ee\u5458\u5de5 III","__typename":"AppliedTranslationNode"},{"questionId":"1164","title":"\u7b49\u5dee\u6570\u5217\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1165","title":"\u5b89\u6392\u4f1a\u8bae\u65e5\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1166","title":"\u629b\u63b7\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1167","title":"\u5efa\u9020\u8857\u533a\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1168","title":"\u590d\u5199\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1169","title":"\u53d7\u6807\u7b7e\u5f71\u54cd\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1170","title":"\u6700\u77ed\u516c\u5171\u8d85\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1171","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1172","title":"\u9500\u552e\u5206\u6790 I ","__typename":"AppliedTranslationNode"},{"questionId":"1173","title":"\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1174","title":"\u9500\u552e\u5206\u6790III","__typename":"AppliedTranslationNode"},{"questionId":"1175","title":"\u6570\u7ec4\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1176","title":"\u529b\u6263\u6392\u884c\u699c","__typename":"AppliedTranslationNode"},{"questionId":"1177","title":"\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1178","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1179","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1180","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1181","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1182","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 IV","__typename":"AppliedTranslationNode"},{"questionId":"1183","title":"\u5927\u6837\u672c\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1184","title":"\u62fc\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"1185","title":"\u5c71\u8109\u6570\u7ec4\u4e2d\u67e5\u627e\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1186","title":"H2O \u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"1187","title":"\u4ea4\u66ff\u6253\u5370FooBar","__typename":"AppliedTranslationNode"},{"questionId":"1188","title":"\u82b1\u62ec\u53f7\u5c55\u5f00 II","__typename":"AppliedTranslationNode"},{"questionId":"1189","title":"\u52a0\u5bc6\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1190","title":"\u6700\u5c0f\u516c\u5171\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1191","title":"\u8fd1\u4e49\u8bcd\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1192","title":"\u5206\u4eab\u5de7\u514b\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1193","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 V","__typename":"AppliedTranslationNode"},{"questionId":"1194","title":"\u4e8c\u53c9\u6811\u5bfb\u8def","__typename":"AppliedTranslationNode"},{"questionId":"1195","title":"\u5206\u7cd6\u679c II","__typename":"AppliedTranslationNode"},{"questionId":"1196","title":"\u586b\u5145\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1197","title":"\u89e3\u6790\u5e03\u5c14\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1198","title":"\u5c0f\u4f17\u4e66\u7c4d","__typename":"AppliedTranslationNode"},{"questionId":"1199","title":"\u5341\u516d\u8fdb\u5236\u9b54\u672f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1200","title":"\u5220\u9664\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1201","title":"\u5220\u9664\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1202","title":"\u5220\u9664\u56de\u6587\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1203","title":"\u6309\u5e8f\u6253\u5370","__typename":"AppliedTranslationNode"},{"questionId":"1204","title":"\u6bcf\u65e5\u65b0\u7528\u6237\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1205","title":"IP \u5730\u5740\u65e0\u6548\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1206","title":"\u822a\u73ed\u9884\u8ba2\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1207","title":"\u5220\u70b9\u6210\u6797","__typename":"AppliedTranslationNode"},{"questionId":"1208","title":"\u6709\u6548\u62ec\u53f7\u7684\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1209","title":"\u8bbe\u8ba1\u6709\u9650\u963b\u585e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1210","title":"\u5220\u9664\u67d0\u4e9b\u5143\u7d20\u540e\u7684\u6570\u7ec4\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1211","title":"\u5b57\u6bcd\u7ec4\u5408\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1212","title":"\u987a\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1213","title":"\u4e0d\u76f8\u4ea4\u7684\u63e1\u624b","__typename":"AppliedTranslationNode"},{"questionId":"1214","title":"\u6bcf\u4f4d\u5b66\u751f\u7684\u6700\u9ad8\u6210\u7ee9","__typename":"AppliedTranslationNode"},{"questionId":"1215","title":"\u62a5\u544a\u7684\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1216","title":"\u6253\u5370\u96f6\u4e0e\u5947\u5076\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1217","title":"\u6570\u7ec4\u7684\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1218","title":"\u6700\u6df1\u53f6\u8282\u70b9\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1219","title":"\u8868\u73b0\u826f\u597d\u7684\u6700\u957f\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1220","title":"\u6700\u5c0f\u7684\u5fc5\u8981\u56e2\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1221","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc725%\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1222","title":"\u5220\u9664\u88ab\u8986\u76d6\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1223","title":"\u5e26\u9608\u503c\u7684\u56fe\u8fde\u901a\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1224","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"1225","title":"\u67e5\u8be2\u6d3b\u8dc3\u4e1a\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1226","title":"\u7528\u6237\u8d2d\u4e70\u5e73\u53f0","__typename":"AppliedTranslationNode"},{"questionId":"1227","title":"\u7b49\u4ef7\u591a\u7c73\u8bfa\u9aa8\u724c\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1228","title":"\u53f6\u503c\u7684\u6700\u5c0f\u4ee3\u4ef7\u751f\u6210\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1229","title":"\u989c\u8272\u4ea4\u66ff\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1230","title":"\u7edd\u5bf9\u503c\u8868\u8fbe\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1231","title":"\u5c06\u6bcf\u4e2a\u5143\u7d20\u66ff\u6362\u4e3a\u53f3\u4fa7\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1232","title":"\u8f6c\u53d8\u6570\u7ec4\u540e\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1233","title":"\u77e9\u5f62\u5185\u8239\u53ea\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1234","title":"\u6700\u5927\u5f97\u5206\u7684\u8def\u5f84\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1236","title":"\u7b2c N \u4e2a\u6cf0\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1237","title":"\u62a5\u544a\u7684\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"1238","title":"\u5b57\u6bcd\u677f\u4e0a\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1239","title":"\u6700\u5927\u7684\u4ee5 1 \u4e3a\u8fb9\u754c\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1240","title":"\u77f3\u5b50\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"1241","title":"\u89e3\u538b\u7f29\u7f16\u7801\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1242","title":"\u77e9\u9635\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1243","title":"\u7956\u7236\u8282\u70b9\u503c\u4e3a\u5076\u6570\u7684\u8282\u70b9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1244","title":"\u4e0d\u540c\u7684\u5faa\u73af\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1245","title":"\u67e5\u8be2\u8fd130\u5929\u6d3b\u8dc3\u7528\u6237\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1246","title":"\u8fc7\u53bb30\u5929\u7684\u7528\u6237\u6d3b\u52a8 II","__typename":"AppliedTranslationNode"},{"questionId":"1247","title":"\u9012\u51cf\u5143\u7d20\u4f7f\u6570\u7ec4\u5448\u952f\u9f7f\u72b6","__typename":"AppliedTranslationNode"},{"questionId":"1248","title":"\u4e8c\u53c9\u6811\u7740\u8272\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1249","title":"\u5feb\u7167\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1250","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1251","title":"\u6bb5\u5f0f\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1252","title":"\u7834\u574f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1253","title":"\u5c06\u77e9\u9635\u6309\u5bf9\u89d2\u7ebf\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1254","title":"\u5c42\u6570\u6700\u6df1\u53f6\u5b50\u8282\u70b9\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1255","title":"\u7ffb\u8f6c\u5b50\u6570\u7ec4\u5f97\u5230\u6700\u5927\u7684\u6570\u7ec4\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1256","title":"\u6570\u7ec4\u5e8f\u53f7\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1257","title":"\u77e9\u9635\u8f6c\u6362\u540e\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1258","title":"\u6587\u7ae0\u6d4f\u89c8 I","__typename":"AppliedTranslationNode"},{"questionId":"1259","title":"\u6587\u7ae0\u6d4f\u89c8 II","__typename":"AppliedTranslationNode"},{"questionId":"1260","title":"\u4e00\u5e74\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1261","title":"\u5355\u5b57\u7b26\u91cd\u590d\u5b50\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1262","title":"\u5b50\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1263","title":"\u63b7\u9ab0\u5b50\u7684N\u79cd\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1264","title":"\u53ef\u4ee5\u8f93\u5165\u7684\u6700\u5927\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1267","title":"\u4ece\u94fe\u8868\u4e2d\u5220\u53bb\u603b\u548c\u503c\u4e3a\u96f6\u7684\u8fde\u7eed\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1268","title":"\u5e02\u573a\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1269","title":"\u5e02\u573a\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1270","title":"\u9910\u76d8\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1271","title":"\u7f51\u7edc\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1272","title":"\u67e5\u8be2\u65e0\u6548\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1273","title":"\u6bd4\u8f83\u5b57\u7b26\u4e32\u6700\u5c0f\u5b57\u6bcd\u51fa\u73b0\u9891\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"1274","title":"\u65e5\u671f\u4e4b\u95f4\u9694\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1275","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1276","title":"\u6700\u63a5\u8fd1\u7684\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1277","title":"\u5f62\u6210\u4e09\u7684\u6700\u5927\u500d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1278","title":"\u6307\u5b9a\u65e5\u671f\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1279","title":"\u8d28\u6570\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1280","title":"\u5065\u8eab\u8ba1\u5212\u8bc4\u4f30","__typename":"AppliedTranslationNode"},{"questionId":"1281","title":"\u6784\u5efa\u56de\u6587\u4e32\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"1282","title":"\u731c\u5b57\u8c1c","__typename":"AppliedTranslationNode"},{"questionId":"1283","title":"\u8f6c\u53d8\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1284","title":"\u56db\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1285","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u53d8\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"1286","title":"\u5e26\u9650\u5236\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1287","title":"\u516c\u4ea4\u7ad9\u95f4\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1288","title":"\u5220\u9664\u4e00\u6b21\u5f97\u5230\u5b50\u6570\u7ec4\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1289","title":"\u4e00\u5468\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1290","title":"\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1291","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 I","__typename":"AppliedTranslationNode"},{"questionId":"1292","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 II","__typename":"AppliedTranslationNode"},{"questionId":"1293","title":"\u5b58\u5728\u8fde\u7eed\u4e09\u4e2a\u5947\u6570\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1295","title":"\u6536\u96c6\u8db3\u591f\u82f9\u679c\u7684\u6700\u5c0f\u82b1\u56ed\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1296","title":"\u6811\u8282\u70b9\u7684\u7b2c K \u4e2a\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1297","title":"\u201c\u6c14\u7403\u201d \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1298","title":"\u53cd\u8f6c\u6bcf\u5bf9\u62ec\u53f7\u95f4\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1299","title":"K \u6b21\u4e32\u8054\u540e\u6700\u5927\u5b50\u6570\u7ec4\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1300","title":"\u67e5\u627e\u96c6\u7fa4\u5185\u7684\u300c\u5173\u952e\u8fde\u63a5\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1301","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u90e8\u95e8\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1302","title":"\u5220\u9664\u5b57\u7b26\u4f7f\u5b57\u7b26\u4e32\u53d8\u597d","__typename":"AppliedTranslationNode"},{"questionId":"1304","title":"\u6700\u957f\u5feb\u4e50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1305","title":"\u961f\u5217\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1306","title":"\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1307","title":"\u4e11\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1308","title":"\u4ea4\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1309","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1311","title":"\u6700\u5927\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1313","title":"\u7edf\u8ba1\u4e3a\u8681\u7fa4\u6784\u7b51\u623f\u95f4\u7684\u4e0d\u540c\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1316","title":"\u4ea4\u66ff\u6253\u5370\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1317","title":"\u6bcf\u6708\u4ea4\u6613 I","__typename":"AppliedTranslationNode"},{"questionId":"1318","title":"\u9526\u6807\u8d5b\u4f18\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1319","title":"\u72ec\u4e00\u65e0\u4e8c\u7684\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1320","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"1321","title":"\u5c3d\u53ef\u80fd\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1322","title":"\u7a7f\u8fc7\u8ff7\u5bab\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1324","title":"\u7403\u4f1a\u843d\u4f55\u5904","__typename":"AppliedTranslationNode"},{"questionId":"1325","title":"\u6982\u7387\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1326","title":"\u5411\u4e0b\u53d6\u6574\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1327","title":"\u6700\u540e\u4e00\u4e2a\u80fd\u8fdb\u5165\u7535\u68af\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1328","title":"\u6bcf\u6708\u4ea4\u6613II","__typename":"AppliedTranslationNode"},{"questionId":"1329","title":"\u73a9\u7b79\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1330","title":"\u6700\u957f\u5b9a\u5dee\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1331","title":"\u9ec4\u91d1\u77ff\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"1332","title":"\u7edf\u8ba1\u5143\u97f3\u5b57\u6bcd\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1336","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1337","title":"\u8bbe\u8ba1\u8df3\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1338","title":"\u67e5\u8be2\u7ed3\u679c\u7684\u8d28\u91cf\u548c\u5360\u6bd4","__typename":"AppliedTranslationNode"},{"questionId":"1339","title":"\u67e5\u8be2\u7403\u961f\u79ef\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1340","title":"\u54f2\u5b66\u5bb6\u8fdb\u9910","__typename":"AppliedTranslationNode"},{"questionId":"1341","title":"\u5206\u5272\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1342","title":"\u53ef\u4ee5\u653b\u51fb\u56fd\u738b\u7684\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"1343","title":"\u63b7\u9ab0\u5b50\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"1344","title":"\u6700\u5927\u76f8\u7b49\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1345","title":"\u5b57\u7b26\u4e32\u7684\u5de6\u53f3\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1349","title":"\u7f00\u70b9\u6210\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1350","title":"\u5220\u9664\u5b50\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"1351","title":"\u66ff\u6362\u5b50\u4e32\u5f97\u5230\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1352","title":"\u89c4\u5212\u517c\u804c\u5de5\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1357","title":"\u62a5\u544a\u7cfb\u7edf\u72b6\u6001\u7684\u8fde\u7eed\u65e5\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1358","title":"\u627e\u51fa\u7ed9\u5b9a\u65b9\u7a0b\u7684\u6b63\u6574\u6570\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"1359","title":"\u5faa\u73af\u7801\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1360","title":"\u4e32\u8054\u5b57\u7b26\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1361","title":"\u94fa\u74f7\u7816","__typename":"AppliedTranslationNode"},{"questionId":"1362","title":"\u98de\u673a\u5ea7\u4f4d\u5206\u914d\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1364","title":"\u540c\u79ef\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1366","title":"\u7b2c\u4e00\u4e2a\u552f\u4e00\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1367","title":"\u5806\u53e0\u957f\u65b9\u4f53\u7684\u6700\u5927\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1368","title":"\u591a\u7ebf\u7a0b\u7f51\u9875\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1369","title":"\u4ea4\u6362\u5b57\u7b26\u4f7f\u5f97\u5b57\u7b26\u4e32\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"1370","title":"\u7edf\u8ba1\u300c\u4f18\u7f8e\u5b50\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1371","title":"\u79fb\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1372","title":"\u68c0\u67e5\u300c\u597d\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1374","title":"\u81f3\u5c11\u6709\u4e00\u4e2a 1 \u7684\u6700\u5de6\u7aef\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1377","title":"\u6bcf\u4e2a\u5e16\u5b50\u7684\u8bc4\u8bba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1378","title":"\u5947\u6570\u503c\u5355\u5143\u683c\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1379","title":"\u91cd\u6784 2 \u884c\u4e8c\u8fdb\u5236\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1380","title":"\u7edf\u8ba1\u5c01\u95ed\u5c9b\u5c7f\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1381","title":"\u5f97\u5206\u6700\u9ad8\u7684\u5355\u8bcd\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1384","title":"\u627e\u51fa\u9002\u5e94\u5c4f\u5e55\u7684\u6700\u5927\u5b57\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1386","title":"\u4e8c\u7ef4\u7f51\u683c\u8fc1\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1387","title":"\u5728\u53d7\u6c61\u67d3\u7684\u4e8c\u53c9\u6811\u4e2d\u67e5\u627e\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1388","title":"\u53ef\u88ab\u4e09\u6574\u9664\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1389","title":"\u63a8\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1390","title":"\u5e73\u5747\u552e\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1391","title":"\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1395","title":"\u8bbf\u95ee\u6240\u6709\u70b9\u7684\u6700\u5c0f\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1396","title":"\u7edf\u8ba1\u53c2\u4e0e\u901a\u4fe1\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1397","title":"\u641c\u7d22\u63a8\u8350\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1398","title":"\u505c\u5728\u539f\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1399","title":"\u9875\u9762\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1400","title":"\u627e\u51fa\u4e95\u5b57\u68cb\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1401","title":"\u4e0d\u6d6a\u8d39\u539f\u6599\u7684\u6c49\u5821\u5236\u4f5c\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1402","title":"\u7edf\u8ba1\u5168\u4e3a 1 \u7684\u6b63\u65b9\u5f62\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1403","title":"\u5206\u5272\u56de\u6587\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1404","title":"\u9006\u5e8f\u6253\u5370\u4e0d\u53ef\u53d8\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1405","title":"\u5411\u516c\u53f8CEO\u6c47\u62a5\u5de5\u4f5c\u7684\u6240\u6709\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1406","title":"\u6574\u6570\u7684\u5404\u4f4d\u79ef\u548c\u4e4b\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1407","title":"\u7528\u6237\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1408","title":"\u4f7f\u7ed3\u679c\u4e0d\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c0f\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1409","title":"\u8f6c\u5316\u4e3a\u5168\u96f6\u77e9\u9635\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1410","title":"\u7ea2\u7eff\u706f\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1411","title":"\u4e8c\u8fdb\u5236\u94fe\u8868\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1413","title":"\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u6b63\u65b9\u5f62\u7684\u6700\u5927\u8fb9\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1414","title":"\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1415","title":"\u5b66\u751f\u4eec\u53c2\u52a0\u5404\u79d1\u6d4b\u8bd5\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1420","title":"\u627e\u5230\u8fde\u7eed\u533a\u95f4\u7684\u5f00\u59cb\u548c\u7ed3\u675f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1421","title":"\u7edf\u8ba1\u4f4d\u6570\u4e3a\u5076\u6570\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1422","title":"\u5212\u5206\u6570\u7ec4\u4e3a\u8fde\u7eed\u6570\u5b57\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1423","title":"\u5b50\u4e32\u7684\u6700\u5927\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1424","title":"\u4f60\u80fd\u4ece\u76d2\u5b50\u91cc\u83b7\u5f97\u7684\u6700\u5927\u7cd6\u679c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1425","title":"\u4e0d\u540c\u56fd\u5bb6\u7684\u5929\u6c14\u7c7b\u578b","__typename":"AppliedTranslationNode"},{"questionId":"1426","title":"\u548c\u4e3a\u96f6\u7684N\u4e2a\u552f\u4e00\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1427","title":"\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u6240\u6709\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1428","title":"\u8df3\u8dc3\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1429","title":"\u53e3\u7b97\u96be\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1432","title":"\u5224\u65ad\u7ed9\u5b9a\u7684\u5e8f\u5217\u662f\u5426\u662f\u4e8c\u53c9\u6811\u4ece\u6839\u5230\u53f6\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1434","title":"\u89e3\u7801\u5b57\u6bcd\u5230\u6574\u6570\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1435","title":"\u5b50\u6570\u7ec4\u5f02\u6216\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1436","title":"\u83b7\u53d6\u4f60\u597d\u53cb\u5df2\u89c2\u770b\u7684\u89c6\u9891","__typename":"AppliedTranslationNode"},{"questionId":"1437","title":"\u8ba9\u5b57\u7b26\u4e32\u6210\u4e3a\u56de\u6587\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1438","title":"\u6c42\u56e2\u961f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1439","title":"\u4e0d\u540c\u6027\u522b\u6bcf\u65e5\u5206\u6570\u603b\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1440","title":"\u5c06\u6574\u6570\u8f6c\u6362\u4e3a\u4e24\u4e2a\u65e0\u96f6\u6574\u6570\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1441","title":"\u6216\u8fd0\u7b97\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1442","title":"\u8fde\u901a\u7f51\u7edc\u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1443","title":"\u4e8c\u6307\u8f93\u5165\u7684\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1444","title":"\u5c06\u6570\u5b57\u53d8\u6210 0 \u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1445","title":"\u5927\u5c0f\u4e3a K \u4e14\u5e73\u5747\u503c\u5927\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1446","title":"\u65f6\u949f\u6307\u9488\u7684\u5939\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"1447","title":"\u8df3\u8dc3\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1448","title":"6 \u548c 9 \u7ec4\u6210\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1449","title":"\u7ad6\u76f4\u6253\u5370\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1450","title":"\u5220\u9664\u7ed9\u5b9a\u503c\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1451","title":"\u704c\u6e89\u82b1\u56ed\u7684\u6700\u5c11\u6c34\u9f99\u5934\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1452","title":"\u9910\u9986\u8425\u4e1a\u989d\u53d8\u5316\u589e\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1453","title":"\u5e7f\u544a\u6548\u679c","__typename":"AppliedTranslationNode"},{"questionId":"1454","title":"\u5220\u9664\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1455","title":"\u9910\u5385\u8fc7\u6ee4\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1456","title":"\u9608\u503c\u8ddd\u79bb\u5185\u90bb\u5c45\u6700\u5c11\u7684\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1457","title":"\u5de5\u4f5c\u8ba1\u5212\u7684\u6700\u4f4e\u96be\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1458","title":"\u6839\u636e\u6570\u5b57\u4e8c\u8fdb\u5236\u4e0b 1 \u7684\u6570\u76ee\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1459","title":"\u6bcf\u9694 n \u4e2a\u987e\u5ba2\u6253\u6298","__typename":"AppliedTranslationNode"},{"questionId":"1460","title":"\u5305\u542b\u6240\u6709\u4e09\u79cd\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1461","title":"\u6709\u6548\u7684\u5feb\u9012\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1462","title":"\u5217\u51fa\u6307\u5b9a\u65f6\u95f4\u6bb5\u5185\u6240\u6709\u7684\u4e0b\u5355\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1463","title":"\u77e9\u9635\u4e2d\u6218\u6597\u529b\u6700\u5f31\u7684 K \u884c","__typename":"AppliedTranslationNode"},{"questionId":"1464","title":"\u6570\u7ec4\u5927\u5c0f\u51cf\u534a","__typename":"AppliedTranslationNode"},{"questionId":"1465","title":"\u5206\u88c2\u4e8c\u53c9\u6811\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1466","title":"\u8df3\u8dc3\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1467","title":"\u6bcf\u6b21\u8bbf\u95ee\u7684\u4ea4\u6613\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1468","title":"\u68c0\u67e5\u6574\u6570\u53ca\u5176\u4e24\u500d\u6570\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1469","title":"\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1470","title":"\u63a8\u6587\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1471","title":"\u53c2\u52a0\u8003\u8bd5\u7684\u6700\u5927\u5b66\u751f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1472","title":"\u4e0a\u5347\u4e0b\u964d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1473","title":"\u6bcf\u4e2a\u5143\u97f3\u5305\u542b\u5076\u6570\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1474","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u957f\u4ea4\u9519\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1475","title":"\u4e8c\u53c9\u641c\u7d22\u5b50\u6811\u7684\u6700\u5927\u952e\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1476","title":"\u7edf\u8ba1\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u8d1f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1477","title":"\u6700\u540e K \u4e2a\u6570\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1478","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1479","title":"\u591a\u6b21\u6c42\u548c\u6784\u9020\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1480","title":"\u7535\u5f71\u8bc4\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1481","title":"\u9662\u7cfb\u65e0\u6548\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1482","title":"\u6709\u591a\u5c11\u5c0f\u4e8e\u5f53\u524d\u6570\u5b57\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1483","title":"\u901a\u8fc7\u6295\u7968\u5bf9\u56e2\u961f\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1484","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1485","title":"\u4f7f\u7f51\u683c\u56fe\u81f3\u5c11\u6709\u4e00\u6761\u6709\u6548\u8def\u5f84\u7684\u6700\u5c0f\u4ee3\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1486","title":"\u4e24\u4e2a\u6570\u7ec4\u95f4\u7684\u8ddd\u79bb\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1487","title":"\u5b89\u6392\u7535\u5f71\u9662\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1488","title":"\u5c06\u6574\u6570\u6309\u6743\u91cd\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1489","title":"3n \u5757\u62ab\u8428","__typename":"AppliedTranslationNode"},{"questionId":"1490","title":"\u751f\u6210\u6bcf\u79cd\u5b57\u7b26\u90fd\u662f\u5947\u6570\u4e2a\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1491","title":"\u706f\u6ce1\u5f00\u5173 III","__typename":"AppliedTranslationNode"},{"questionId":"1492","title":"\u901a\u77e5\u6240\u6709\u5458\u5de5\u6240\u9700\u7684\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1493","title":"T \u79d2\u540e\u9752\u86d9\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1494","title":"\u6d3b\u52a8\u53c2\u4e0e\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1495","title":"\u987e\u5ba2\u7684\u53ef\u4fe1\u8054\u7cfb\u4eba\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1496","title":"\u77e9\u9635\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1497","title":"\u8bbe\u8ba1\u4e00\u4e2a\u652f\u6301\u589e\u91cf\u64cd\u4f5c\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1498","title":"\u627e\u51fa\u514b\u9686\u4e8c\u53c9\u6811\u4e2d\u7684\u76f8\u540c\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1499","title":"\u6700\u5927\u7684\u56e2\u961f\u8868\u73b0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1500","title":"\u7edf\u8ba1\u6700\u5927\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1501","title":"\u5706\u548c\u77e9\u5f62\u662f\u5426\u6709\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"1502","title":"\u6784\u9020 K \u4e2a\u56de\u6587\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1503","title":"\u505a\u83dc\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1504","title":"\u83b7\u53d6\u6700\u8fd1\u7b2c\u4e8c\u6b21\u7684\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1505","title":"\u6309\u65e2\u5b9a\u987a\u5e8f\u521b\u5efa\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1507","title":"\u68c0\u67e5\u7f51\u683c\u4e2d\u662f\u5426\u5b58\u5728\u6709\u6548\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1508","title":"\u6700\u957f\u5feb\u4e50\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1509","title":"\u4f7f\u7528\u552f\u4e00\u6807\u8bc6\u7801\u66ff\u6362\u5458\u5de5ID","__typename":"AppliedTranslationNode"},{"questionId":"1510","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1511","title":"\u7edf\u8ba1\u4f5c\u6218\u5355\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1512","title":"\u8bbe\u8ba1\u5730\u94c1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1513","title":"\u627e\u5230\u6240\u6709\u597d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1514","title":"\u9010\u6b65\u6c42\u548c\u5f97\u5230\u6b63\u6570\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1515","title":"\u548c\u4e3a K \u7684\u6700\u5c11\u6590\u6ce2\u90a3\u5951\u6570\u5b57\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1516","title":"\u957f\u5ea6\u4e3a n \u7684\u5f00\u5fc3\u5b57\u7b26\u4e32\u4e2d\u5b57\u5178\u5e8f\u7b2c k \u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1517","title":"\u6062\u590d\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1518","title":"\u6309\u5e74\u5ea6\u5217\u51fa\u9500\u552e\u603b\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1519","title":"\u975e\u9012\u589e\u987a\u5e8f\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1520","title":"\u5c06\u4e8c\u8fdb\u5236\u8868\u793a\u51cf\u5230 1 \u7684\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1522","title":"\u77f3\u5b50\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1523","title":"\u80a1\u7968\u7684\u8d44\u672c\u635f\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"1524","title":"\u6570\u7ec4\u4e2d\u7684\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1525","title":"\u67e5\u8be2\u5e26\u952e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1526","title":"HTML \u5b9e\u4f53\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1527","title":"\u7ed9 N x 3 \u7f51\u683c\u56fe\u6d82\u8272\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1528","title":"\u62e5\u6709\u6700\u591a\u7cd6\u679c\u7684\u5b69\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1529","title":"\u6539\u53d8\u4e00\u4e2a\u6574\u6570\u80fd\u5f97\u5230\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1530","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u6253\u7834\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1531","title":"\u6bcf\u4e2a\u4eba\u6234\u4e0d\u540c\u5e3d\u5b50\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1532","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1533","title":"\u70b9\u83dc\u5c55\u793a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1534","title":"\u6570\u9752\u86d9","__typename":"AppliedTranslationNode"},{"questionId":"1535","title":"\u751f\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1536","title":"\u8d2d\u4e70\u4e86\u4ea7\u54c1 A \u548c\u4ea7\u54c1 B \u5374\u6ca1\u6709\u8d2d\u4e70\u4ea7\u54c1 C \u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1537","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1538","title":"\u53ef\u83b7\u5f97\u7684\u6700\u5927\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1539","title":"\u5bf9\u89d2\u7ebf\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"1541","title":"\u6392\u540d\u9760\u524d\u7684\u65c5\u884c\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1542","title":"\u8fde\u7eed\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1543","title":"\u6700\u7b80\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1544","title":"\u7edf\u8ba1\u4e8c\u53c9\u6811\u4e2d\u597d\u8282\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1545","title":"\u6570\u4f4d\u6210\u672c\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1546","title":"\u67e5\u627e\u6210\u7ee9\u5904\u4e8e\u4e2d\u6e38\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1547","title":"\u65c5\u884c\u7ec8\u70b9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"1548","title":"\u662f\u5426\u6240\u6709 1 \u90fd\u81f3\u5c11\u76f8\u9694 k \u4e2a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1549","title":"\u7edd\u5bf9\u5dee\u4e0d\u8d85\u8fc7\u9650\u5236\u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1550","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u7b2c k \u4e2a\u6700\u5c0f\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1551","title":"\u51c0\u73b0\u503c\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1552","title":"\u7528\u6808\u64cd\u4f5c\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1553","title":"\u5f62\u6210\u4e24\u4e2a\u5f02\u6216\u76f8\u7b49\u6570\u7ec4\u7684\u4e09\u5143\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1554","title":"\u6536\u96c6\u6811\u4e0a\u6240\u6709\u82f9\u679c\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1555","title":"\u5207\u62ab\u8428\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1556","title":"\u901a\u8fc7\u7ffb\u8f6c\u5b50\u6570\u7ec4\u4f7f\u4e24\u4e2a\u6570\u7ec4\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1557","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u5305\u542b\u6240\u6709\u957f\u5ea6\u4e3a K \u7684\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1558","title":"\u8bfe\u7a0b\u8868 IV","__typename":"AppliedTranslationNode"},{"questionId":"1559","title":"\u6458\u6a31\u6843 II","__typename":"AppliedTranslationNode"},{"questionId":"1560","title":"\u5728\u65e2\u5b9a\u65f6\u95f4\u505a\u4f5c\u4e1a\u7684\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1561","title":"\u91cd\u65b0\u6392\u5217\u53e5\u5b50\u4e2d\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1562","title":"\u6536\u85cf\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1563","title":"\u5706\u5f62\u9776\u5185\u7684\u6700\u5927\u98de\u9556\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1564","title":"\u5236\u4f5c\u4f1a\u8bdd\u67f1\u72b6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1565","title":"\u8ba1\u7b97\u5e03\u5c14\u8868\u8fbe\u5f0f\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1566","title":"\u68c0\u67e5\u5355\u8bcd\u662f\u5426\u4e3a\u53e5\u4e2d\u5176\u4ed6\u5355\u8bcd\u7684\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1567","title":"\u5b9a\u957f\u5b50\u4e32\u4e2d\u5143\u97f3\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1568","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u4f2a\u56de\u6587\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1569","title":"\u4e24\u4e2a\u5b50\u5e8f\u5217\u7684\u6700\u5927\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1570","title":"\u5546\u54c1\u6298\u6263\u540e\u7684\u6700\u7ec8\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1571","title":"\u5b89\u6392\u90ae\u7b52","__typename":"AppliedTranslationNode"},{"questionId":"1572","title":"\u5b50\u77e9\u5f62\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1573","title":"\u627e\u4e24\u4e2a\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1574","title":"\u6570\u7ec4\u4e2d\u4e24\u5143\u7d20\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1575","title":"\u5207\u5272\u540e\u9762\u79ef\u6700\u5927\u7684\u86cb\u7cd5","__typename":"AppliedTranslationNode"},{"questionId":"1576","title":"\u91cd\u65b0\u89c4\u5212\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1577","title":"\u4e24\u4e2a\u76d2\u5b50\u4e2d\u7403\u7684\u989c\u8272\u6570\u76f8\u540c\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1578","title":"\u82f9\u679c\u548c\u6854\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1579","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1580","title":"\u91cd\u65b0\u6392\u5217\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1581","title":"\u6570\u7ec4\u4e2d\u7684 k \u4e2a\u6700\u5f3a\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1582","title":"\u8bbe\u8ba1\u6d4f\u89c8\u5668\u5386\u53f2\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1583","title":"\u7c89\u5237\u623f\u5b50 III","__typename":"AppliedTranslationNode"},{"questionId":"1584","title":"\u53bb\u6389\u6700\u4f4e\u5de5\u8d44\u548c\u6700\u9ad8\u5de5\u8d44\u540e\u7684\u5de5\u8d44\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1585","title":"n \u7684\u7b2c k \u4e2a\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1586","title":"\u5220\u6389\u4e00\u4e2a\u5143\u7d20\u4ee5\u540e\u5168\u4e3a 1 \u7684\u6700\u957f\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1587","title":"\u5e76\u884c\u8bfe\u7a0b II","__typename":"AppliedTranslationNode"},{"questionId":"1603","title":"\u4e00\u7ef4\u6570\u7ec4\u7684\u52a8\u6001\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1604","title":"\u4e0d\u540c\u6574\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1605","title":"\u5236\u4f5c m \u675f\u82b1\u6240\u9700\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1607","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1608","title":"\u8ba1\u7b97\u7a0e\u540e\u5de5\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"1609","title":"\u5bfb\u627e\u6240\u6709\u7684\u72ec\u751f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1610","title":"\u6570\u7ec4\u5f02\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1611","title":"\u4fdd\u8bc1\u6587\u4ef6\u540d\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"1612","title":"\u907f\u514d\u6d2a\u6c34\u6cdb\u6ee5","__typename":"AppliedTranslationNode"},{"questionId":"1613","title":"\u627e\u5230\u6700\u5c0f\u751f\u6210\u6811\u91cc\u7684\u5173\u952e\u8fb9\u548c\u4f2a\u5173\u952e\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1615","title":"\u5b50\u6570\u7ec4\u548c\u6392\u5e8f\u540e\u7684\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1616","title":"\u4e09\u6b21\u64cd\u4f5c\u540e\u6700\u5927\u503c\u4e0e\u6700\u5c0f\u503c\u7684\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1617","title":"\u77f3\u5b50\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1618","title":"\u5220\u9664\u94fe\u8868 M \u4e2a\u8282\u70b9\u4e4b\u540e\u7684 N \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1619","title":"\u5224\u65ad\u8def\u5f84\u662f\u5426\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1620","title":"\u68c0\u67e5\u6570\u7ec4\u5bf9\u662f\u5426\u53ef\u4ee5\u88ab k \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1621","title":"\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1622","title":"\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1623","title":"\u5468\u5185\u6bcf\u5929\u7684\u9500\u552e\u60c5\u51b5","__typename":"AppliedTranslationNode"},{"questionId":"1624","title":"\u514b\u9686\u542b\u968f\u673a\u6307\u9488\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1625","title":"\u6309\u65e5\u671f\u5206\u7ec4\u9500\u552e\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1626","title":"\u5224\u65ad\u80fd\u5426\u5f62\u6210\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1627","title":"\u6240\u6709\u8682\u8681\u6389\u4e0b\u6765\u524d\u7684\u6700\u540e\u4e00\u523b","__typename":"AppliedTranslationNode"},{"questionId":"1628","title":"\u7edf\u8ba1\u5168 1 \u5b50\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1629","title":"\u6700\u591a K \u6b21\u4ea4\u6362\u76f8\u90bb\u6570\u4f4d\u540e\u5f97\u5230\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1630","title":"\u5728\u533a\u95f4\u8303\u56f4\u5185\u7edf\u8ba1\u5947\u6570\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1631","title":"\u548c\u4e3a\u5947\u6570\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1632","title":"\u5b57\u7b26\u4e32\u7684\u597d\u5206\u5272\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1633","title":"\u5f62\u6210\u76ee\u6807\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6700\u5c11\u589e\u52a0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1634","title":"\u514b\u9686 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1635","title":"\u597d\u6570\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1636","title":"\u4ec5\u542b 1 \u7684\u5b50\u4e32\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1637","title":"\u538b\u7f29\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"1638","title":"\u670d\u52a1\u4e2d\u5fc3\u7684\u6700\u4f73\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1639","title":"\u4e0a\u6708\u64ad\u653e\u7684\u513f\u7ae5\u9002\u5b9c\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"1640","title":"\u8bbe\u8ba1\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1641","title":"\u53ef\u4ee5\u653e\u5fc3\u6295\u8d44\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1642","title":"\u6362\u9152\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1643","title":"\u5b50\u6811\u4e2d\u6807\u7b7e\u76f8\u540c\u7684\u8282\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1644","title":"\u6700\u591a\u7684\u4e0d\u91cd\u53e0\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1645","title":"\u627e\u5230\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u51fd\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1646","title":"\u7b2c k \u4e2a\u7f3a\u5931\u7684\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1647","title":"K \u6b21\u64cd\u4f5c\u8f6c\u53d8\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1648","title":"\u5e73\u8861\u62ec\u53f7\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1649","title":"\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u975e\u7a7a\u5b50\u6570\u7ec4\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1650","title":"\u627e\u5230 N \u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1651","title":"\u91cd\u65b0\u6392\u5217\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1652","title":"\u706f\u6ce1\u5f00\u5173 IV","__typename":"AppliedTranslationNode"},{"questionId":"1653","title":"\u597d\u53f6\u5b50\u8282\u70b9\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1654","title":"\u6d88\u8d39\u8005\u4e0b\u5355\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1655","title":"\u79fb\u52a8 N \u53c9\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1656","title":"\u7edf\u8ba1\u597d\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1657","title":"\u627e\u51fa\u6570\u7ec4\u6e38\u620f\u7684\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1658","title":"\u6392\u5e03\u4e8c\u8fdb\u5236\u7f51\u683c\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1659","title":"\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1660","title":"\u5343\u4f4d\u5206\u9694\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1661","title":"\u53ef\u4ee5\u5230\u8fbe\u6240\u6709\u70b9\u7684\u6700\u5c11\u70b9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1662","title":"\u5f97\u5230\u76ee\u6807\u6570\u7ec4\u7684\u6700\u5c11\u51fd\u6570\u8c03\u7528\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1663","title":"\u4e8c\u7ef4\u7f51\u683c\u56fe\u4e2d\u63a2\u6d4b\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1664","title":"\u67e5\u627e\u62e5\u6709\u6709\u6548\u90ae\u7bb1\u7684\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1665","title":"N \u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1666","title":"\u6574\u7406\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1667","title":"\u627e\u51fa\u7b2c N \u4e2a\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c K \u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1668","title":"\u627e\u51fa\u6700\u957f\u7684\u8d85\u8d5e\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1669","title":"\u5207\u68cd\u5b50\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1670","title":"\u60a3\u67d0\u79cd\u75be\u75c5\u7684\u60a3\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1671","title":"\u6700\u8fd1\u7684\u4e09\u7b14\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1672","title":"\u627e\u5230\u6700\u5927\u6574\u6570\u7684\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"1674","title":"\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1675","title":"\u4e24\u7403\u4e4b\u95f4\u7684\u78c1\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1676","title":"\u5403\u6389 N \u4e2a\u6a58\u5b50\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1677","title":"\u77e9\u9635\u5bf9\u89d2\u7ebf\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1678","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1679","title":"\u5220\u9664\u6700\u77ed\u7684\u5b50\u6570\u7ec4\u4f7f\u5269\u4f59\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1680","title":"\u7edf\u8ba1\u6240\u6709\u53ef\u884c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1681","title":"\u627e\u51fa\u9690\u85cf\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1682","title":"\u5706\u5f62\u8d5b\u9053\u4e0a\u7ecf\u8fc7\u6b21\u6570\u6700\u591a\u7684\u6247\u533a","__typename":"AppliedTranslationNode"},{"questionId":"1683","title":"\u4f60\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1684","title":"\u67e5\u627e\u5927\u5c0f\u4e3a M \u7684\u6700\u65b0\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1685","title":"\u77f3\u5b50\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1686","title":"\u4ea7\u54c1\u540d\u79f0\u683c\u5f0f\u4fee\u590d","__typename":"AppliedTranslationNode"},{"questionId":"1687","title":"\u56fe\u4e2d\u6700\u76f8\u4f3c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1688","title":"\u6bcf\u4ef6\u5546\u54c1\u7684\u6700\u65b0\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1689","title":"\u91cd\u590d\u81f3\u5c11 K \u6b21\u4e14\u957f\u5ea6\u4e3a M \u7684\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1690","title":"\u4e58\u79ef\u4e3a\u6b63\u6570\u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1691","title":"\u4f7f\u9646\u5730\u5206\u79bb\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1692","title":"\u5c06\u5b50\u6570\u7ec4\u91cd\u65b0\u6392\u5e8f\u5f97\u5230\u540c\u4e00\u4e2a\u4e8c\u53c9\u67e5\u627e\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1693","title":"\u6240\u6709\u5947\u6570\u957f\u5ea6\u5b50\u6570\u7ec4\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1694","title":"\u4f7f\u6570\u7ec4\u548c\u80fd\u88ab P \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1695","title":"\u6240\u6709\u6392\u5217\u4e2d\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1696","title":"\u5947\u602a\u7684\u6253\u5370\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"1697","title":"\u53ea\u6709\u4e00\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1698","title":"\u66ff\u6362\u6240\u6709\u7684\u95ee\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1699","title":"\u6570\u7684\u5e73\u65b9\u7b49\u4e8e\u4e24\u6570\u4e58\u79ef\u7684\u65b9\u6cd5\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1700","title":"\u907f\u514d\u91cd\u590d\u5b57\u6bcd\u7684\u6700\u5c0f\u5220\u9664\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1701","title":"\u4fdd\u8bc1\u56fe\u53ef\u5b8c\u5168\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1702","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981","__typename":"AppliedTranslationNode"},{"questionId":"1703","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc I","__typename":"AppliedTranslationNode"},{"questionId":"1704","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u7279\u6b8a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1705","title":"\u7edf\u8ba1\u4e0d\u5f00\u5fc3\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"1706","title":"\u8fde\u63a5\u6240\u6709\u70b9\u7684\u6700\u5c0f\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1707","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u901a\u8fc7\u6392\u5e8f\u5b50\u5b57\u7b26\u4e32\u5f97\u5230\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1708","title":"\u8bbe\u8ba1\u505c\u8f66\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1709","title":"\u8b66\u544a\u4e00\u5c0f\u65f6\u5185\u4f7f\u7528\u76f8\u540c\u5458\u5de5\u5361\u5927\u4e8e\u7b49\u4e8e\u4e09\u6b21\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1710","title":"\u627e\u5230\u5904\u7406\u6700\u591a\u8bf7\u6c42\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1711","title":"\u7ed9\u5b9a\u884c\u548c\u5217\u7684\u548c\u6c42\u53ef\u884c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1712","title":"\u6309\u6708\u7edf\u8ba1\u8ba2\u5355\u6570\u4e0e\u987e\u5ba2\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1713","title":"\u4e24\u4e2a\u7a00\u758f\u5411\u91cf\u7684\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1714","title":"\u91cd\u65b0\u6392\u5217\u5355\u8bcd\u95f4\u7684\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1715","title":"\u62c6\u5206\u5b57\u7b26\u4e32\u4f7f\u552f\u4e00\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee\u6700\u5927","__typename":"AppliedTranslationNode"},{"questionId":"1716","title":"\u77e9\u9635\u7684\u6700\u5927\u975e\u8d1f\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1717","title":"\u8fde\u901a\u4e24\u7ec4\u70b9\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1718","title":"\u4ed3\u5e93\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1719","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc II","__typename":"AppliedTranslationNode"},{"questionId":"1720","title":"\u6587\u4ef6\u5939\u64cd\u4f5c\u65e5\u5fd7\u641c\u96c6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1721","title":"\u7ecf\u8425\u6469\u5929\u8f6e\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"1722","title":"\u7687\u4f4d\u7ee7\u627f\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1723","title":"\u6700\u591a\u53ef\u8fbe\u6210\u7684\u6362\u697c\u8bf7\u6c42\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1724","title":"\u8fdb\u5e97\u5374\u672a\u8fdb\u884c\u8fc7\u4ea4\u6613\u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1725","title":"\u5927\u5c0f\u4e3a K \u7684\u4e0d\u91cd\u53e0\u7ebf\u6bb5\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1726","title":"\u7f51\u7edc\u4fe1\u53f7\u6700\u597d\u7684\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1727","title":"\u732b\u548c\u8001\u9f20 II","__typename":"AppliedTranslationNode"},{"questionId":"1728","title":"\u5947\u5999\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1729","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"1730","title":"\u7279\u6b8a\u6570\u7ec4\u7684\u7279\u5f81\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1731","title":"\u5947\u5076\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1732","title":"\u4f7f\u6574\u6570\u53d8\u4e3a 0 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1733","title":"\u53ef\u89c1\u70b9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1734","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981 II","__typename":"AppliedTranslationNode"},{"questionId":"1735","title":"\u6bcf\u4f4d\u987e\u5ba2\u6700\u7ecf\u5e38\u8ba2\u8d2d\u7684\u5546\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1736","title":"\u6839\u636e\u4e2d\u7f00\u8868\u8fbe\u5f0f\u6784\u9020\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1737","title":"\u62ec\u53f7\u7684\u6700\u5927\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1738","title":"\u6700\u5927\u7f51\u7edc\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1739","title":"\u5206\u5272\u4e24\u4e2a\u5b57\u7b26\u4e32\u5f97\u5230\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1740","title":"\u7edf\u8ba1\u5b50\u6811\u4e2d\u57ce\u5e02\u4e4b\u95f4\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1741","title":"\u6309\u7167\u9891\u7387\u5c06\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1742","title":"\u4e24\u70b9\u4e4b\u95f4\u4e0d\u5305\u542b\u4efb\u4f55\u70b9\u7684\u6700\u5bbd\u5782\u76f4\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1743","title":"\u7edf\u8ba1\u53ea\u5dee\u4e00\u4e2a\u5b57\u7b26\u7684\u5b50\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1744","title":"\u901a\u8fc7\u7ed9\u5b9a\u8bcd\u5178\u6784\u9020\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1745","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u6700\u8fd1\u7684\u53f3\u4fa7\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1746","title":"\u4e24\u4e2a\u76f8\u540c\u5b57\u7b26\u4e4b\u95f4\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1747","title":"\u6267\u884c\u64cd\u4f5c\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1748","title":"\u65e0\u77db\u76fe\u7684\u6700\u4f73\u7403\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1749","title":"\u6ca1\u6709\u5356\u51fa\u7684\u5356\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1750","title":"\u68c0\u67e5\u4e24\u68f5\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811\u662f\u5426\u7b49\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1751","title":"\u6309\u952e\u6301\u7eed\u65f6\u95f4\u6700\u957f\u7684\u952e","__typename":"AppliedTranslationNode"},{"questionId":"1752","title":"\u7b49\u5dee\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1753","title":"\u6700\u5c0f\u4f53\u529b\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1755","title":"\u62c6\u70b8\u5f39","__typename":"AppliedTranslationNode"},{"questionId":"1756","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1757","title":"\u5230\u5bb6\u7684\u6700\u5c11\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1758","title":"\u5206\u914d\u91cd\u590d\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1759","title":"\u627e\u5230\u9057\u5931\u7684ID","__typename":"AppliedTranslationNode"},{"questionId":"1760","title":"\u80fd\u5426\u8fde\u63a5\u5f62\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1761","title":"\u7edf\u8ba1\u5b57\u5178\u5e8f\u5143\u97f3\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1762","title":"\u53ef\u4ee5\u5230\u8fbe\u7684\u6700\u8fdc\u5efa\u7b51","__typename":"AppliedTranslationNode"},{"questionId":"1763","title":"\u4e09\u4eba\u56fd\u5bb6\u4ee3\u8868\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1764","title":"\u6700\u5927\u91cd\u590d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1765","title":"\u5408\u5e76\u4e24\u4e2a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1766","title":"\u5f97\u5230\u5c71\u5f62\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1767","title":"\u8bbe\u8ba1\u524d\u4e2d\u540e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1768","title":"\u8bbe\u8ba1\u5e26\u89e3\u6790\u51fd\u6570\u7684\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1769","title":"\u83b7\u53d6\u751f\u6210\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1770","title":"\u5b57\u7b26\u9891\u6b21\u552f\u4e00\u7684\u6700\u5c0f\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1771","title":"\u9500\u552e\u4ef7\u503c\u51cf\u5c11\u7684\u989c\u8272\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1772","title":"\u901a\u8fc7\u6307\u4ee4\u521b\u5efa\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1773","title":"\u5404\u8d5b\u4e8b\u7684\u7528\u6237\u6ce8\u518c\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1774","title":"\u6c42\u4e24\u4e2a\u591a\u9879\u5f0f\u94fe\u8868\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1775","title":"\u8bbe\u8ba1\u6709\u5e8f\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1776","title":"\u5c06 x \u51cf\u5230 0 \u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1777","title":"\u786e\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u63a5\u8fd1","__typename":"AppliedTranslationNode"},{"questionId":"1778","title":"\u6700\u5927\u5316\u7f51\u683c\u5e78\u798f\u611f","__typename":"AppliedTranslationNode"},{"questionId":"1779","title":"Hopper \u516c\u53f8\u67e5\u8be2 I","__typename":"AppliedTranslationNode"},{"questionId":"1780","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 II","__typename":"AppliedTranslationNode"},{"questionId":"1781","title":"\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u6570\u7ec4\u662f\u5426\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1782","title":"\u5177\u6709\u7ed9\u5b9a\u6570\u503c\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1783","title":"\u751f\u6210\u5e73\u8861\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1784","title":"\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u521d\u59cb\u80fd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1786","title":"\u7edf\u8ba1\u4e00\u81f4\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1787","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u5dee\u7edd\u5bf9\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1788","title":"\u77f3\u5b50\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1789","title":"\u4ece\u4ed3\u5e93\u5230\u7801\u5934\u8fd0\u8f93\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1790","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 III","__typename":"AppliedTranslationNode"},{"questionId":"1791","title":"\u6700\u5bcc\u6709\u5ba2\u6237\u7684\u8d44\u4ea7\u603b\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1792","title":"\u627e\u51fa\u6700\u5177\u7ade\u4e89\u529b\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1793","title":"\u4f7f\u6570\u7ec4\u4e92\u8865\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1794","title":"\u6570\u7ec4\u7684\u6700\u5c0f\u504f\u79fb\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1796","title":"\u7ea0\u6b63\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1797","title":"\u8bbe\u8ba1 Goal \u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1798","title":"K \u548c\u6570\u5bf9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1799","title":"\u6700\u5c0f\u4e0d\u517c\u5bb9\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1800","title":"\u8fde\u63a5\u8fde\u7eed\u4e8c\u8fdb\u5236\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1801","title":"\u6bcf\u53f0\u673a\u5668\u7684\u8fdb\u7a0b\u5e73\u5747\u8fd0\u884c\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1802","title":"\u65e0\u6cd5\u5403\u5348\u9910\u7684\u5b66\u751f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1803","title":"\u5e73\u5747\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1804","title":"\u4fee\u6539\u540e\u7684\u6700\u5927\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1805","title":"\u5f97\u5230\u8fde\u7eed K \u4e2a 1 \u7684\u6700\u5c11\u76f8\u90bb\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1806","title":"\u6bd4\u8d5b\u4e2d\u7684\u914d\u5bf9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1807","title":"\u5341-\u4e8c\u8fdb\u5236\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1808","title":"\u77f3\u5b50\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"1809","title":"\u6570\u7ec4\u4e2d\u7279\u6b8a\u7b49\u95f4\u8ddd\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1810","title":"\u6539\u53d8\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1811","title":"\u4fee\u590d\u8868\u4e2d\u7684\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1812","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1813","title":"\u5220\u9664\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1814","title":"\u8df3\u8dc3\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1815","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1816","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 IV","__typename":"AppliedTranslationNode"},{"questionId":"1817","title":"\u8ba1\u7b97\u529b\u6263\u94f6\u884c\u7684\u94b1","__typename":"AppliedTranslationNode"},{"questionId":"1818","title":"\u5220\u9664\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1819","title":"\u6784\u5efa\u5b57\u5178\u5e8f\u6700\u5927\u7684\u53ef\u884c\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1820","title":"\u91cd\u6784\u4e00\u68f5\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1821","title":"\u53d1\u7968\u4e2d\u7684\u4ea7\u54c1\u91d1\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1822","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"1823","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u7684\u4e24\u534a\u662f\u5426\u76f8\u4f3c","__typename":"AppliedTranslationNode"},{"questionId":"1824","title":"\u5403\u82f9\u679c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1825","title":"\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1826","title":"\u4e0e\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1827","title":"\u65e0\u6548\u7684\u63a8\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1828","title":"\u8ba1\u7b97\u5206\u914d\u7cd6\u679c\u7684\u4e0d\u540c\u65b9\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1829","title":"\u5361\u8f66\u4e0a\u7684\u6700\u5927\u5355\u5143\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1830","title":"\u5927\u9910\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1831","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e09\u4e2a\u5b50\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1832","title":"\u5f97\u5230\u5b50\u5e8f\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1833","title":"\u627e\u5230\u6700\u9ad8\u6d77\u62d4","__typename":"AppliedTranslationNode"},{"questionId":"1834","title":"\u9700\u8981\u6559\u8bed\u8a00\u7684\u6700\u5c11\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1835","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1836","title":"\u751f\u6210\u4e58\u79ef\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1837","title":"\u6bcf\u5929\u7684\u9886\u5bfc\u548c\u5408\u4f19\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1838","title":"\u5b57\u7b26\u4e32\u7684\u4e0d\u540c\u5b50\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1839","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1840","title":"\u6267\u884c\u4ea4\u6362\u64cd\u4f5c\u540e\u7684\u6700\u5c0f\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1842","title":"\u4e24\u4eba\u4e4b\u95f4\u7684\u901a\u8bdd\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1843","title":"\u53ef\u4ee5\u5f62\u6210\u6700\u5927\u6b63\u65b9\u5f62\u7684\u77e9\u5f62\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1844","title":"\u76d2\u5b50\u4e2d\u5c0f\u7403\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1845","title":"\u91cd\u65b0\u6392\u5217\u540e\u7684\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1847","title":"\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1848","title":"\u552f\u4e00\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1849","title":"\u4efb\u610f\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u503c\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1850","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e24\u7aef\u76f8\u540c\u5b57\u7b26\u540e\u7684\u6700\u77ed\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1851","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee II","__typename":"AppliedTranslationNode"},{"questionId":"1852","title":"\u8bbf\u95ee\u65e5\u671f\u4e4b\u95f4\u6700\u5927\u7684\u7a7a\u6863\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1858","title":"\u66ff\u6362\u9690\u85cf\u6570\u5b57\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1859","title":"\u6ee1\u8db3\u4e09\u6761\u4ef6\u4e4b\u4e00\u9700\u6539\u53d8\u7684\u6700\u5c11\u5b57\u7b26\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1860","title":"\u627e\u51fa\u7b2c K \u5927\u7684\u5f02\u6216\u5750\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1861","title":"\u653e\u7f6e\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1862","title":"\u82f9\u679c\u548c\u6a58\u5b50\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1865","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728 II","__typename":"AppliedTranslationNode"},{"questionId":"1866","title":"\u4ece\u76f8\u90bb\u5143\u7d20\u5bf9\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1871","title":"\u56de\u6587\u4e32\u5206\u5272 IV","__typename":"AppliedTranslationNode"},{"questionId":"1872","title":"\u4f60\u80fd\u5728\u4f60\u6700\u559c\u6b22\u7684\u90a3\u5929\u5403\u5230\u4f60\u6700\u559c\u6b22\u7684\u7cd6\u679c\u5417\uff1f","__typename":"AppliedTranslationNode"},{"questionId":"1873","title":"\u6700\u957f\u7684\u7f8e\u597d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1874","title":"\u901a\u8fc7\u8fde\u63a5\u53e6\u4e00\u4e2a\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u5f97\u5230\u4e00\u4e2a\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1875","title":"\u4e92\u8d28\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1876","title":"\u5730\u56fe\u4e2d\u7684\u6700\u9ad8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1877","title":"\u6c42\u5173\u6ce8\u8005\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1878","title":"\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u7ecf\u6392\u5e8f\u548c\u8f6e\u8f6c\u5f97\u5230","__typename":"AppliedTranslationNode"},{"questionId":"1879","title":"\u79fb\u9664\u77f3\u5b50\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1880","title":"\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5927\u7684\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1881","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1882","title":"\u6bcf\u4f4d\u7ecf\u7406\u7684\u4e0b\u5c5e\u5458\u5de5\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1883","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1884","title":"\u751f\u6210\u4ea4\u66ff\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1885","title":"\u7edf\u8ba1\u540c\u6784\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1886","title":"\u888b\u5b50\u91cc\u6700\u5c11\u6570\u76ee\u7684\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1887","title":"\u4e00\u4e2a\u56fe\u4e2d\u8fde\u901a\u4e09\u5143\u7ec4\u7684\u6700\u5c0f\u5ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1888","title":"\u627e\u5230\u6700\u8fd1\u7684\u6709\u76f8\u540c X \u6216 Y \u5750\u6807\u7684\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1889","title":"\u5224\u65ad\u4e00\u4e2a\u6570\u5b57\u662f\u5426\u53ef\u4ee5\u8868\u793a\u6210\u4e09\u7684\u5e42\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1890","title":"\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u7f8e\u4e3d\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1891","title":"\u7edf\u8ba1\u70b9\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1892","title":"\u67e5\u627e\u6bcf\u4e2a\u5458\u5de5\u82b1\u8d39\u7684\u603b\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1893","title":"\u7ecf\u8fc7\u4e00\u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1894","title":"\u4ea4\u66ff\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1895","title":"\u79fb\u52a8\u6240\u6709\u7403\u5230\u6bcf\u4e2a\u76d2\u5b50\u6240\u9700\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1896","title":"\u6267\u884c\u4e58\u6cd5\u8fd0\u7b97\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1897","title":"\u7531\u5b50\u5e8f\u5217\u6784\u9020\u7684\u6700\u957f\u56de\u6587\u4e32\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1898","title":"\u5e94\u8be5\u88ab\u7981\u6b62\u7684Leetflex\u8d26\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1899","title":"\u7edf\u8ba1\u5339\u914d\u68c0\u7d22\u89c4\u5219\u7684\u7269\u54c1\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1900","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u4ef7\u683c\u7684\u751c\u70b9\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1901","title":"\u901a\u8fc7\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1902","title":"\u8f66\u961f II","__typename":"AppliedTranslationNode"},{"questionId":"1903","title":"\u8bbe\u8ba1\u6700\u8fd1\u4f7f\u7528\uff08MRU\uff09\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1904","title":"\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e8c\u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1905","title":"\u8bbe\u8ba1\u4e00\u4e2a\u9a8c\u8bc1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1906","title":"N \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1907","title":"\u7edf\u8ba1\u5f02\u6216\u503c\u5728\u8303\u56f4\u5185\u7684\u6570\u5bf9\u6709\u591a\u5c11","__typename":"AppliedTranslationNode"},{"questionId":"1908","title":"\u53ef\u56de\u6536\u4e14\u4f4e\u8102\u7684\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1909","title":"\u80fd\u770b\u5230\u6d77\u666f\u7684\u5efa\u7b51\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1910","title":"\u68c0\u67e5\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1911","title":"\u6784\u6210\u7279\u5b9a\u548c\u9700\u8981\u6dfb\u52a0\u7684\u6700\u5c11\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1912","title":"\u4ece\u7b2c\u4e00\u4e2a\u8282\u70b9\u51fa\u53d1\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684\u53d7\u9650\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1913","title":"\u4f7f\u6240\u6709\u533a\u95f4\u7684\u5f02\u6216\u7ed3\u679c\u4e3a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1914","title":"\u5bfb\u627e\u6ca1\u6709\u88ab\u6267\u884c\u7684\u4efb\u52a1\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1915","title":"\u4ec5\u6267\u884c\u4e00\u6b21\u5b57\u7b26\u4e32\u4ea4\u6362\u80fd\u5426\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1916","title":"\u627e\u51fa\u661f\u578b\u56fe\u7684\u4e2d\u5fc3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1917","title":"\u6700\u5927\u5e73\u5747\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1918","title":"\u597d\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1919","title":"\u6309\u53d7\u6b22\u8fce\u7a0b\u5ea6\u6392\u5217\u529f\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"1920","title":"\u5224\u65ad\u56fd\u9645\u8c61\u68cb\u68cb\u76d8\u4e2d\u4e00\u4e2a\u683c\u5b50\u7684\u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1923","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 III","__typename":"AppliedTranslationNode"},{"questionId":"1924","title":"\u5f97\u5230\u65b0\u9c9c\u751c\u751c\u5708\u7684\u6700\u591a\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1925","title":"\u7edf\u8ba1\u4e00\u4e2a\u6570\u7ec4\u4e2d\u597d\u5bf9\u5b50\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1926","title":"\u6bcf\u5bb6\u5546\u5e97\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1927","title":"\u6700\u5927\u5347\u5e8f\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1928","title":"\u79ef\u538b\u8ba2\u5355\u4e2d\u7684\u8ba2\u5355\u603b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1929","title":"\u6709\u754c\u6570\u7ec4\u4e2d\u6307\u5b9a\u4e0b\u6807\u5904\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1930","title":"\u4f60\u80fd\u6784\u9020\u51fa\u8fde\u7eed\u503c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1931","title":"\u672a\u77e5\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1932","title":"\u5927\u6ee1\u8d2f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1933","title":"\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1934","title":"\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u62ec\u53f7\u5185\u5bb9","__typename":"AppliedTranslationNode"},{"questionId":"1935","title":"\u8fd8\u539f\u6392\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b65\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1936","title":"\u597d\u56e0\u5b50\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1937","title":"\u6700\u5927\u5316\u82b1\u56ed\u7684\u7f8e\u89c2\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1938","title":"\u6700\u5c11\u64cd\u4f5c\u4f7f\u6570\u7ec4\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1939","title":"\u7edf\u8ba1\u4e00\u4e2a\u5706\u4e2d\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1940","title":"\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1941","title":"\u4f7f\u5b57\u7b26\u4e32\u6709\u5e8f\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1942","title":"\u5458\u5de5\u7684\u76f4\u5c5e\u90e8\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"1943","title":"\u7edf\u8ba1\u8ddd\u79bb\u6700\u5c0f\u7684\u5b50\u4e32\u5bf9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1944","title":"\u622a\u65ad\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1945","title":"\u67e5\u627e\u7528\u6237\u6d3b\u8dc3\u5206\u949f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1946","title":"\u7edd\u5bf9\u5dee\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1947","title":"\u5e8f\u5217\u4e2d\u4e0d\u540c\u6700\u5927\u516c\u7ea6\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1948","title":"\u6bcf\u4e2a\u4ea7\u54c1\u5728\u4e0d\u540c\u5546\u5e97\u7684\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1949","title":"\u5b9e\u73b0 Trie \uff08\u524d\u7f00\u6811\uff09 II","__typename":"AppliedTranslationNode"},{"questionId":"1950","title":"\u6570\u7ec4\u5143\u7d20\u79ef\u7684\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1951","title":"\u627e\u51fa\u6e38\u620f\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1952","title":"\u6700\u5c11\u4fa7\u8df3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1953","title":"\u6c42\u51fa MK \u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1954","title":"\u5c06\u6240\u6709\u6570\u5b57\u7528\u5b57\u7b26\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1955","title":"\u5ea7\u4f4d\u9884\u7ea6\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1956","title":"\u51cf\u5c0f\u548c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\u540e\u7684\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1957","title":"\u6700\u8fd1\u7684\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1958","title":"\u6ca1\u6709\u5e7f\u544a\u7684\u5267\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1959","title":"\u9690\u85cf\u7f51\u683c\u4e0b\u7684\u6700\u5c0f\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1960","title":"\u5224\u65ad\u53e5\u5b50\u662f\u5426\u4e3a\u5168\u5b57\u6bcd\u53e5","__typename":"AppliedTranslationNode"},{"questionId":"1961","title":"\u96ea\u7cd5\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1962","title":"\u5355\u7ebf\u7a0b CPU","__typename":"AppliedTranslationNode"},{"questionId":"1963","title":"\u6240\u6709\u6570\u5bf9\u6309\u4f4d\u4e0e\u7ed3\u679c\u7684\u5f02\u6216\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1964","title":"\u5bfb\u627e\u9762\u8bd5\u5019\u9009\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1965","title":"K \u8fdb\u5236\u8868\u793a\u4e0b\u7684\u5404\u4f4d\u6570\u5b57\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1966","title":"\u6700\u9ad8\u9891\u5143\u7d20\u7684\u9891\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1967","title":"\u6240\u6709\u5143\u97f3\u6309\u987a\u5e8f\u6392\u5e03\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1968","title":"\u6700\u9ad8\u5efa\u7b51\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1969","title":"\u6700\u591a\u9080\u8bf7\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1970","title":"\u5c06\u53e5\u5b50\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1971","title":"\u589e\u957f\u7684\u5185\u5b58\u6cc4\u9732","__typename":"AppliedTranslationNode"},{"questionId":"1972","title":"\u65cb\u8f6c\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1974","title":"\u5bfb\u627e\u4eca\u5e74\u5177\u6709\u6b63\u6536\u5165\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1975","title":"\u5230\u76ee\u6807\u5143\u7d20\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1976","title":"\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u9012\u51cf\u7684\u8fde\u7eed\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1977","title":"\u5305\u542b\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1978","title":"\u90bb\u4f4d\u4ea4\u6362\u7684\u6700\u5c0f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1980","title":"\u6709\u7f3a\u9677\u7684\u4f20\u611f\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1981","title":"\u6bcf\u5929\u7684\u6700\u5927\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1982","title":"\u4ece\u672a\u6392\u5e8f\u7684\u94fe\u8868\u4e2d\u79fb\u9664\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1983","title":"\u4eba\u53e3\u6700\u591a\u7684\u5e74\u4efd","__typename":"AppliedTranslationNode"},{"questionId":"1984","title":"\u4e0b\u6807\u5bf9\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1985","title":"\u5b50\u6570\u7ec4\u6700\u5c0f\u4e58\u79ef\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1986","title":"\u6709\u5411\u56fe\u4e2d\u6700\u5927\u989c\u8272\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1987","title":"\u957f\u5ea6\u4e3a\u4e09\u4e14\u5404\u5b57\u7b26\u4e0d\u540c\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1988","title":"\u6570\u7ec4\u4e2d\u6700\u5927\u6570\u5bf9\u548c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1989","title":"\u4e24\u4e2a\u6570\u7ec4\u6700\u5c0f\u7684\u5f02\u6216\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1990","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u4e09\u4e2a\u83f1\u5f62\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1991","title":"\u8054\u8d5b\u4fe1\u606f\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1993","title":"\u627e\u51fa\u6240\u6709\u5b50\u96c6\u7684\u5f02\u6216\u603b\u548c\u518d\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1994","title":"\u6784\u6210\u4ea4\u66ff\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1995","title":"\u627e\u51fa\u548c\u4e3a\u6307\u5b9a\u503c\u7684\u4e0b\u6807\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1996","title":"\u6070\u6709 K \u6839\u6728\u68cd\u53ef\u4ee5\u770b\u5230\u7684\u6392\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1997","title":"\u4e0b\u4e2a\u7531\u76f8\u540c\u6570\u5b57\u6784\u6210\u7684\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1999","title":"\u54ea\u79cd\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u66f4\u957f","__typename":"AppliedTranslationNode"},{"questionId":"2000","title":"\u51c6\u65f6\u5230\u8fbe\u7684\u5217\u8f66\u6700\u5c0f\u65f6\u901f","__typename":"AppliedTranslationNode"},{"questionId":"2001","title":"\u8df3\u8dc3\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"2002","title":"\u77f3\u5b50\u6e38\u620f VIII","__typename":"AppliedTranslationNode"},{"questionId":"2003","title":"\u6bcf\u4e2a\u5b50\u6570\u7ec4\u7684\u6570\u5b57\u79cd\u7c7b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2004","title":"\u8f6c\u6362\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"2005","title":"\u68c0\u67e5\u662f\u5426\u533a\u57df\u5185\u6240\u6709\u6574\u6570\u90fd\u88ab\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"2006","title":"\u627e\u5230\u9700\u8981\u8865\u5145\u7c89\u7b14\u7684\u5b66\u751f\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2008","title":"\u53cd\u8f6c\u8868\u8fbe\u5f0f\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2009","title":"\u5305\u542b\u6240\u6709\u524d\u7f00\u7684\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"2010","title":"\u68c0\u67e5\u67d0\u5355\u8bcd\u662f\u5426\u7b49\u4e8e\u4e24\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2011","title":"\u63d2\u5165\u540e\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2012","title":"\u4f7f\u7528\u670d\u52a1\u5668\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"2013","title":"\u51c6\u65f6\u62b5\u8fbe\u4f1a\u8bae\u73b0\u573a\u7684\u6700\u5c0f\u8df3\u8fc7\u4f11\u606f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2015","title":"\u5224\u65ad\u77e9\u9635\u7ecf\u8f6e\u8f6c\u540e\u662f\u5426\u4e00\u81f4","__typename":"AppliedTranslationNode"},{"questionId":"2016","title":"\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49\u7684\u51cf\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2017","title":"\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u7b26\u4ea4\u66ff\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2018","title":"\u88c5\u5305\u88f9\u7684\u6700\u5c0f\u6d6a\u8d39\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2019","title":"\u4e24\u4e2a\u884c\u7a0b\u7f16\u7801\u6570\u7ec4\u7684\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2020","title":"\u5220\u9664\u4e00\u4e2a\u5143\u7d20\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"2021","title":"\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u51fa\u73b0\u7684\u7ed9\u5b9a\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2022","title":"\u6700\u5927\u5b50\u5e8f\u5217\u4ea4\u66ff\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2023","title":"\u8bbe\u8ba1\u7535\u5f71\u79df\u501f\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"2024","title":"\u8ba1\u7b97\u7279\u6b8a\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"2025","title":"\u91cd\u65b0\u5206\u914d\u5b57\u7b26\u4f7f\u6240\u6709\u5b57\u7b26\u4e32\u90fd\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"2026","title":"\u5408\u5e76\u82e5\u5e72\u4e09\u5143\u7ec4\u4ee5\u5f62\u6210\u76ee\u6807\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2027","title":"\u53ef\u79fb\u9664\u5b57\u7b26\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2028","title":"\u6700\u4f73\u8fd0\u52a8\u5458\u7684\u6bd4\u62fc\u56de\u5408","__typename":"AppliedTranslationNode"},{"questionId":"2029","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u6700\u5c0f\u4e58\u79ef\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2031","title":"\u9e21\u86cb\u6389\u843d-\u4e24\u679a\u9e21\u86cb","__typename":"AppliedTranslationNode"},{"questionId":"2032","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6700\u5927\u5947\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2033","title":"\u4f60\u5b8c\u6210\u7684\u5b8c\u6574\u5bf9\u5c40\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2034","title":"\u67e5\u8be2\u5dee\u7edd\u5bf9\u503c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2035","title":"\u7edf\u8ba1\u5b50\u5c9b\u5c7f","__typename":"AppliedTranslationNode"},{"questionId":"2037","title":"\u7edf\u8ba1\u5e73\u65b9\u548c\u4e09\u5143\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2038","title":"\u8ff7\u5bab\u4e2d\u79bb\u5165\u53e3\u6700\u8fd1\u7684\u51fa\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"2039","title":"\u6c42\u548c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2040","title":"\u89c4\u5b9a\u65f6\u95f4\u5185\u5230\u8fbe\u7ec8\u70b9\u7684\u6700\u5c0f\u82b1\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"2041","title":"2020\u5e74\u6700\u540e\u4e00\u6b21\u767b\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"2042","title":"\u4e24\u4e2a\u6570\u5bf9\u4e4b\u95f4\u7684\u6700\u5927\u4e58\u79ef\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2043","title":"\u5faa\u73af\u8f6e\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"2044","title":"\u6700\u7f8e\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2045","title":"\u5272\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"2046","title":"\u9875\u9762\u63a8\u8350\u2161","__typename":"AppliedTranslationNode"},{"questionId":"2047","title":"\u627e\u51fa\u9876\u5cf0\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"2048","title":"\u57fa\u4e8e\u6392\u5217\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2049","title":"\u6d88\u706d\u602a\u7269\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2050","title":"\u7edf\u8ba1\u597d\u6570\u5b57\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2051","title":"\u6700\u957f\u516c\u5171\u5b50\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"2053","title":"\u68c0\u67e5\u662f\u5426\u6240\u6709\u5b57\u7b26\u51fa\u73b0\u6b21\u6570\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"2054","title":"\u6700\u5c0f\u672a\u88ab\u5360\u636e\u6905\u5b50\u7684\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2055","title":"\u63cf\u8ff0\u7ed8\u753b\u7ed3\u679c","__typename":"AppliedTranslationNode"},{"questionId":"2057","title":"\u6309\u5206\u7c7b\u7edf\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"2058","title":"\u6570\u7ec4\u4e32\u8054","__typename":"AppliedTranslationNode"},{"questionId":"2059","title":"\u957f\u5ea6\u4e3a 3 \u7684\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2060","title":"\u5408\u5e76\u591a\u68f5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"2061","title":"\u7528\u4e09\u79cd\u4e0d\u540c\u989c\u8272\u4e3a\u7f51\u683c\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"2062","title":"Nim \u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"2064","title":"\u5174\u8da3\u76f8\u540c\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"2066","title":"\u65b0\u589e\u7684\u6700\u5c11\u53f0\u9636\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2067","title":"\u6263\u5206\u540e\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"2068","title":"\u67e5\u8be2\u6700\u5927\u57fa\u56e0\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2069","title":"\u7b2c K \u5c0f\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2070","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u5206\u89e3\u4e3a\u503c\u5747\u7b49\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2071","title":"\u6392\u5e8f\u6570\u7ec4\u4e4b\u95f4\u7684\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2072","title":"\u6240\u6709\u5b50\u6570\u7ec4\u6700\u5c0f\u503c\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2073","title":"\u611f\u67d3 K \u79cd\u75c5\u6bd2\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2076","title":"\u5b57\u7b26\u4e32\u8f6c\u5316\u540e\u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2077","title":"\u5b50\u5b57\u7b26\u4e32\u7a81\u53d8\u540e\u53ef\u80fd\u5f97\u5230\u7684\u6700\u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2078","title":"\u6700\u5927\u517c\u5bb9\u6027\u8bc4\u5206\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2079","title":"\u5220\u9664\u7cfb\u7edf\u4e2d\u7684\u91cd\u590d\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"2080","title":"\u68c0\u67e5\u64cd\u4f5c\u662f\u5426\u5408\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"2081","title":"K \u6b21\u8c03\u6574\u6570\u7ec4\u5927\u5c0f\u6d6a\u8d39\u7684\u6700\u5c0f\u603b\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2083","title":"\u4e09\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2084","title":"\u4f60\u53ef\u4ee5\u5de5\u4f5c\u7684\u6700\u5927\u5468\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2085","title":"\u6784\u9020\u5143\u7d20\u4e0d\u7b49\u4e8e\u4e24\u76f8\u90bb\u5143\u7d20\u5e73\u5747\u503c\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2086","title":"\u7edf\u8ba1\u7279\u6b8a\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2088","title":"\u4f7f\u7528\u7279\u6b8a\u6253\u5b57\u673a\u952e\u5165\u5355\u8bcd\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2089","title":"\u6700\u5927\u65b9\u9635\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2090","title":"\u5230\u8fbe\u76ee\u7684\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2091","title":"\u5212\u5206\u6570\u5b57\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2093","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u4e3a\u6570\u7ec4\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2094","title":"\u79fb\u9664\u77f3\u5b50\u4f7f\u603b\u6570\u6700\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"2095","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2096","title":"\u627e\u51fa\u5230\u6bcf\u4e2a\u4f4d\u7f6e\u4e3a\u6b62\u6700\u957f\u7684\u6709\u6548\u969c\u788d\u8d5b\u8dd1\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"2098","title":"\u67e5\u8be2\u5177\u6709\u6700\u591a\u5171\u540c\u5173\u6ce8\u8005\u7684\u6240\u6709\u4e24\u4e24\u7ed3\u5bf9\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2099","title":"\u4f5c\u4e3a\u5b50\u5b57\u7b26\u4e32\u51fa\u73b0\u5728\u5355\u8bcd\u4e2d\u7684\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2100","title":"\u6570\u7ec4\u5143\u7d20\u7684\u6700\u5c0f\u975e\u96f6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2101","title":"\u4f60\u80fd\u7a7f\u8fc7\u77e9\u9635\u7684\u6700\u540e\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2102","title":"\u627e\u5230\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"2103","title":"\u627e\u5230\u6240\u6709\u7684\u519c\u573a\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2104","title":"\u6811\u4e0a\u7684\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"2105","title":"\u597d\u5b50\u96c6\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2106","title":"\u627e\u51fa\u6570\u7ec4\u7684\u6700\u5927\u516c\u7ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2107","title":"\u627e\u51fa\u4e0d\u540c\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2108","title":"\u6700\u5c0f\u5316\u76ee\u6807\u503c\u4e0e\u6240\u9009\u5143\u7d20\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2109","title":"\u4ece\u5b50\u96c6\u7684\u548c\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2112","title":"\u5b66\u751f\u5206\u6570\u7684\u6700\u5c0f\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2113","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c K \u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2114","title":"\u5b8c\u6210\u4efb\u52a1\u7684\u6700\u5c11\u5de5\u4f5c\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"2115","title":"\u4e0d\u540c\u7684\u597d\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2116","title":"\u5dee\u7684\u7edd\u5bf9\u503c\u4e3a K \u7684\u6570\u5bf9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2117","title":"\u4ece\u53cc\u500d\u6570\u7ec4\u4e2d\u8fd8\u539f\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2118","title":"\u51fa\u79df\u8f66\u7684\u6700\u5927\u76c8\u5229","__typename":"AppliedTranslationNode"},{"questionId":"2119","title":"\u4f7f\u6570\u7ec4\u8fde\u7eed\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2122","title":"\u7edf\u8ba1\u7279\u6b8a\u56db\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2123","title":"\u6e38\u620f\u4e2d\u5f31\u89d2\u8272\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2124","title":"\u8bbf\u95ee\u5b8c\u6240\u6709\u623f\u95f4\u7684\u7b2c\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2125","title":"\u6570\u7ec4\u7684\u6700\u5927\u516c\u56e0\u6570\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"2128","title":"\u53cd\u8f6c\u5355\u8bcd\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2129","title":"\u53ef\u4e92\u6362\u77e9\u5f62\u7684\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2130","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5e8f\u5217\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2131","title":"\u6bcf\u68f5\u5b50\u6811\u5185\u7f3a\u5931\u7684\u6700\u5c0f\u57fa\u56e0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2132","title":"\u5c06\u4e00\u7ef4\u6570\u7ec4\u8f6c\u53d8\u6210\u4e8c\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2133","title":"\u8fde\u63a5\u540e\u7b49\u4e8e\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"2134","title":"\u8003\u8bd5\u7684\u6700\u5927\u56f0\u6270\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"2135","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u591a\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2137","title":"\u6267\u884c\u64cd\u4f5c\u540e\u7684\u53d8\u91cf\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2138","title":"\u6570\u7ec4\u7f8e\u4e3d\u503c\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2139","title":"\u68c0\u6d4b\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"2140","title":"\u91cd\u590d K \u6b21\u7684\u6700\u957f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2144","title":"\u589e\u91cf\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2145","title":"\u7f51\u683c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2146","title":"\u5224\u65ad\u5355\u8bcd\u662f\u5426\u80fd\u653e\u5165\u586b\u5b57\u6e38\u620f\u5185","__typename":"AppliedTranslationNode"},{"questionId":"2147","title":"\u89e3\u51fa\u6570\u5b66\u8868\u8fbe\u5f0f\u7684\u5b66\u751f\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2154","title":"\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2155","title":"\u627e\u51fa\u7f3a\u5931\u7684\u89c2\u6d4b\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"2156","title":"\u77f3\u5b50\u6e38\u620f IX","__typename":"AppliedTranslationNode"},{"questionId":"2157","title":"\u542b\u7279\u5b9a\u5b57\u6bcd\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2159","title":"\u81f3\u5c11\u5728\u4e24\u4e2a\u6570\u7ec4\u4e2d\u51fa\u73b0\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2160","title":"\u83b7\u53d6\u5355\u503c\u7f51\u683c\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2161","title":"\u80a1\u7968\u4ef7\u683c\u6ce2\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"2162","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u4e2a\u6570\u7ec4\u5e76\u6700\u5c0f\u5316\u6570\u7ec4\u548c\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100002","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100003","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100004","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100005","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100006","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100007","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100008","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100009","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100010","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100011","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100012","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100013","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100014","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100015","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100016","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100017","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100018","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100019","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100020","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100021","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100022","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100023","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100024","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100025","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100026","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100027","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100028","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100029","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100030","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100031","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100032","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100033","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100034","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100035","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100036","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100037","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100038","title":"\u78b0\u649e\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100039","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100040","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100041","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100042","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100043","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100044","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100045","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100046","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100047","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100048","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100049","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100050","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100051","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100052","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100065","title":"\u6700\u5c0f\u4ea4\u6362\u6b21\u6570\u4f7f\u5f97\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100091","title":"\u529b\u6263\u8c61\u68cb\u5b66\u5802","__typename":"AppliedTranslationNode"},{"questionId":"100092","title":"\u5206\u5f0f\u5316\u7b80","__typename":"AppliedTranslationNode"},{"questionId":"100093","title":"\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"100094","title":"\u53d1 LeetCoin","__typename":"AppliedTranslationNode"},{"questionId":"100096","title":"\u673a\u5668\u4eba\u5927\u5192\u9669","__typename":"AppliedTranslationNode"},{"questionId":"100103","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100104","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100105","title":"\u56f4\u6210\u4e00\u5708","__typename":"AppliedTranslationNode"},{"questionId":"100106","title":"\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100107","title":"\u731c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100125","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570 - LC","__typename":"AppliedTranslationNode"},{"questionId":"100129","title":"\u5458\u5de5\u4e92\u8bc4","__typename":"AppliedTranslationNode"},{"questionId":"100130","title":"\u7535\u68af","__typename":"AppliedTranslationNode"},{"questionId":"100136","title":"\u5b57\u7b26\u4e32\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"100139","title":"\u6d4b\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100144","title":"\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100146","title":"\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"100147","title":"\u6d88\u9664\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100148","title":"PK","__typename":"AppliedTranslationNode"},{"questionId":"100149","title":"\u5408\u5e76\u4efb\u52a1\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100151","title":"\u56fd\u5bb6\u7ed3\u76df -- 952 \u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"100152","title":"\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100153","title":"\u5feb\u9012\u5458\u6d3e\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"100154","title":"\u8fde\u8fde\u770b","__typename":"AppliedTranslationNode"},{"questionId":"100157","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"100158","title":"\u5224\u5b9a\u5b57\u7b26\u662f\u5426\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100159","title":"\u5224\u5b9a\u662f\u5426\u4e92\u4e3a\u5b57\u7b26\u91cd\u6392","__typename":"AppliedTranslationNode"},{"questionId":"100160","title":"URL\u5316","__typename":"AppliedTranslationNode"},{"questionId":"100161","title":"\u5b57\u7b26\u4e32\u538b\u7f29","__typename":"AppliedTranslationNode"},{"questionId":"100162","title":"\u5b57\u7b26\u4e32\u8f6e\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"100163","title":"\u79fb\u9664\u91cd\u590d\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100164","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100167","title":"\u94fe\u8868\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"100168","title":"\u73af\u8def\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"100169","title":"\u6808\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100170","title":"\u5316\u6808\u4e3a\u961f","__typename":"AppliedTranslationNode"},{"questionId":"100171","title":"\u8282\u70b9\u95f4\u901a\u8def","__typename":"AppliedTranslationNode"},{"questionId":"100172","title":"\u4e09\u5408\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100173","title":"\u6808\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100174","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100175","title":"\u7279\u5b9a\u6df1\u5ea6\u8282\u70b9\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100176","title":"\u68c0\u67e5\u5e73\u8861\u6027","__typename":"AppliedTranslationNode"},{"questionId":"100177","title":"\u5408\u6cd5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100178","title":"\u540e\u7ee7\u8005","__typename":"AppliedTranslationNode"},{"questionId":"100179","title":"\u9996\u4e2a\u5171\u540c\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100180","title":"\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"100181","title":"\u6574\u6570\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100182","title":"\u914d\u5bf9\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100183","title":"\u4e0b\u4e00\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100184","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100185","title":"\u65cb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100186","title":"\u96f6\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100187","title":"\u5220\u9664\u4e2d\u95f4\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100188","title":"\u94fe\u8868\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100189","title":"\u897f\u6e38\u8bb0","__typename":"AppliedTranslationNode"},{"questionId":"100191","title":"\u4f18\u5316\u53c2\u8d5b\u961f\u4f0d","__typename":"AppliedTranslationNode"},{"questionId":"100193","title":"\u9ed1\u767d\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"100194","title":"2048 \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100195","title":"\u5806\u76d8\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100196","title":"\u7ed8\u5236\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100197","title":"\u4e09\u6b65\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100198","title":"\u5e42\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"100199","title":"\u9012\u5f52\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100200","title":"\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"100201","title":"\u989c\u8272\u586b\u5145","__typename":"AppliedTranslationNode"},{"questionId":"100202","title":"\u5806\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100203","title":"\u4e8c\u8fdb\u5236\u6570\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100206","title":"\u70b9\u4eae\u5723\u8bde\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100207","title":"\u8ff7\u5bab\u91cd\u529b\u7403","__typename":"AppliedTranslationNode"},{"questionId":"100208","title":"\u65e9\u9910\u9ad8\u5cf0","__typename":"AppliedTranslationNode"},{"questionId":"100209","title":"\u6768\u67f3\u7d6e\u6291\u5236\u5242","__typename":"AppliedTranslationNode"},{"questionId":"100210","title":"\u642c\u5bb6\u6253\u5305","__typename":"AppliedTranslationNode"},{"questionId":"100211","title":" \u671f\u4e2d\u8003\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100212","title":"\u5468\u516d\u5bb5\u591c\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100213","title":"\u51fa\u6e38\u603b\u7ed3","__typename":"AppliedTranslationNode"},{"questionId":"100214","title":"\u9910\u5385\u4f18\u60e0\u5238","__typename":"AppliedTranslationNode"},{"questionId":"100215","title":"\u51fa\u5dee\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100216","title":"\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"100217","title":"\u6700\u62e5\u5835\u7684\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"100218","title":"\u5165\u5b66\u8003\u8bd5\u7b97\u6cd5\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100219","title":"\u5783\u573e\u90ae\u4ef6\u8fc7\u6ee4\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"100220","title":"\u672c\u5468\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"100221","title":"\u4e34\u65f6\u70b9\u9910\u5458","__typename":"AppliedTranslationNode"},{"questionId":"100222","title":"\u5c0f\u7ec4\u8ba8\u8bba","__typename":"AppliedTranslationNode"},{"questionId":"100223","title":"\u91c7\u8d2d\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"100226","title":"\u7b97\u6cd5\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"100228","title":"\u52a8\u7269\u6536\u5bb9\u6240","__typename":"AppliedTranslationNode"},{"questionId":"100229","title":"\u68c0\u67e5\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100230","title":"\u7ffb\u8f6c\u6570\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"100231","title":"\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"100232","title":"\u641c\u7d22\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100233","title":"\u516b\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"100234","title":"\u57fa\u7ad9\u5730\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"100235","title":"\u7f16\u7a0b\u8bed\u8a00\u504f\u597d\u8c03\u67e5","__typename":"AppliedTranslationNode"},{"questionId":"100236","title":"\u964d\u566a\u8033\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100237","title":"\u51fa\u5dee\u8def\u7ebf II","__typename":"AppliedTranslationNode"},{"questionId":"100238","title":"\u4e92\u4fe1\u534f\u5546\u673a\u5236 II","__typename":"AppliedTranslationNode"},{"questionId":"100239","title":"TLV \u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"100240","title":"\u9b54\u672f\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"100241","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100242","title":"\u7a00\u758f\u6570\u7ec4\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"100246","title":"\u5458\u5de5\u8fd0\u52a8\u4f1a","__typename":"AppliedTranslationNode"},{"questionId":"100247","title":"\u65f6\u95f4\u7247\u8f6e\u8f6c\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100248","title":"\u6700\u77ed\u5269\u4f59\u65f6\u95f4\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100249","title":"\u6570\u636e\u590d\u539f","__typename":"AppliedTranslationNode"},{"questionId":"100250","title":"\u8eab\u9ad8\u4f18\u52bf","__typename":"AppliedTranslationNode"},{"questionId":"100251","title":"\u5b9a\u4ef7\u7b56\u7565","__typename":"AppliedTranslationNode"},{"questionId":"100252","title":"\u4e1a\u7ee9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"100253","title":"\u8bfb\u4e66\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100254","title":"\u5956\u91d1\u8ba1\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100255","title":"\u529e\u516c\u5ba4\u996e\u6c34\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100256","title":"\u9ad8\u94c1\u9009\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"100257","title":"\u5730\u94c1\u7968","__typename":"AppliedTranslationNode"},{"questionId":"100258","title":"\u4ea4\u6362\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100259","title":"\u5355\u8bcd\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"100260","title":"\u4ea4\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100261","title":"\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100262","title":"\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100263","title":"SyM \u7684 \ud83d\udd11","__typename":"AppliedTranslationNode"},{"questionId":"100264","title":"\u5206\u82f9\u679c","__typename":"AppliedTranslationNode"},{"questionId":"100265","title":"qqqqqqqqqqqqqqqy \u7684\u70ed\u8eab\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100266","title":"\u5c0f\u80d6\u5b50\u7684\u65e5\u5e38","__typename":"AppliedTranslationNode"},{"questionId":"100267","title":"\u7406\u7425\u73c0\u73e0","__typename":"AppliedTranslationNode"},{"questionId":"100269","title":"\u72fc\u4eba\u6740\u6a21\u62df\u5668","__typename":"AppliedTranslationNode"},{"questionId":"100272","title":"\ud83d\udc2d\u5e74\u5feb\u4e50","__typename":"AppliedTranslationNode"},{"questionId":"100273","title":"\u7528\u4e24\u4e2a\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100274","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100275","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100276","title":"\u4e8c\u7ef4\u6570\u7ec4\u4e2d\u7684\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"100277","title":"\u9752\u86d9\u8df3\u53f0\u9636\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100278","title":"\u65cb\u8f6c\u6570\u7ec4\u7684\u6700\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100279","title":"\u77e9\u9635\u4e2d\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100280","title":"\u66ff\u6362\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"100281","title":"\u673a\u5668\u4eba\u7684\u8fd0\u52a8\u8303\u56f4","__typename":"AppliedTranslationNode"},{"questionId":"100282","title":"\u4ece\u5c3e\u5230\u5934\u6253\u5370\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100283","title":"\u91cd\u5efa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100284","title":"\u526a\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100285","title":"\u526a\u7ef3\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"100286","title":"\u5408\u5e76\u4e24\u4e2a\u6392\u5e8f\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100287","title":"\u6811\u7684\u5b50\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"100288","title":"\u4e8c\u53c9\u6811\u7684\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"100289","title":"\u5bf9\u79f0\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100290","title":"\u8868\u793a\u6570\u503c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100291","title":"\u8c03\u6574\u6570\u7ec4\u987a\u5e8f\u4f7f\u5947\u6570\u4f4d\u4e8e\u5076\u6570\u524d\u9762","__typename":"AppliedTranslationNode"},{"questionId":"100292","title":"\u4e8c\u8fdb\u5236\u4e2d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100293","title":"\u987a\u65f6\u9488\u6253\u5370\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100294","title":"\u94fe\u8868\u4e2d\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100295","title":"\u6570\u503c\u7684\u6574\u6570\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"100296","title":"\u6253\u5370\u4ece1\u5230\u6700\u5927\u7684n\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100297","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"100298","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100299","title":"\u5220\u9664\u94fe\u8868\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100300","title":"\u590d\u6742\u94fe\u8868\u7684\u590d\u5236","__typename":"AppliedTranslationNode"},{"questionId":"100301","title":"\u6700\u5c0f\u7684k\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100302","title":"\u5305\u542bmin\u51fd\u6570\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"100303","title":"\u6570\u636e\u6d41\u4e2d\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100304","title":"\u8fde\u7eed\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100305","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e0e\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100306","title":"\u6808\u7684\u538b\u5165\u3001\u5f39\u51fa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100307","title":"\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100308","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100309","title":"1\uff5en \u6574\u6570\u4e2d 1 \u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100310","title":"\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc7\u4e00\u534a\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100311","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100312","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"100313","title":"\u6570\u5b57\u5e8f\u5217\u4e2d\u67d0\u4e00\u4f4d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100314","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 III","__typename":"AppliedTranslationNode"},{"questionId":"100315","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u540e\u5e8f\u904d\u5386\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100316","title":"\u7b2c\u4e00\u4e2a\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"100317","title":"\u4e8c\u53c9\u6811\u4e2d\u548c\u4e3a\u67d0\u4e00\u503c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100318","title":"\u6570\u7ec4\u4e2d\u7684\u9006\u5e8f\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"100319","title":"\u4e8c\u53c9\u6811\u7684\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100320","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100321","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"100322","title":"\u548c\u4e3as\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100323","title":"\u628a\u6570\u7ec4\u6392\u6210\u6700\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100324","title":"\u548c\u4e3as\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100325","title":"\u628a\u6570\u5b57\u7ffb\u8bd1\u6210\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100326","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u516c\u5171\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100327","title":"\u793c\u7269\u7684\u6700\u5927\u4ef7\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100328","title":"\u7ffb\u8f6c\u5355\u8bcd\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100329","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u6570\u5b57 I","__typename":"AppliedTranslationNode"},{"questionId":"100330","title":"\u5de6\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100331","title":"0\uff5en-1\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100332","title":"\u6700\u957f\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100333","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u7b2ck\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100334","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100335","title":"\u4e0d\u7528\u52a0\u51cf\u4e58\u9664\u505a\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100336","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100337","title":"\u961f\u5217\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100338","title":"\u6784\u5efa\u4e58\u79ef\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100339","title":"n\u4e2a\u9ab0\u5b50\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100340","title":"\u628a\u5b57\u7b26\u4e32\u8f6c\u6362\u6210\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100341","title":"\u6251\u514b\u724c\u4e2d\u7684\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100342","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100343","title":"\u5706\u5708\u4e2d\u6700\u540e\u5269\u4e0b\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100344","title":"\u80a1\u7968\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"100345","title":"\u6c421+2+\u2026+n","__typename":"AppliedTranslationNode"},{"questionId":"100346","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100347","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100348","title":"\u6709\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100349","title":"\u6700\u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100350","title":"\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100351","title":"\u751f\u5b58\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100352","title":"\u8df3\u6c34\u677f","__typename":"AppliedTranslationNode"},{"questionId":"100353","title":"\u5e73\u5206\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"100354","title":"\u6700\u4f73\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100355","title":"\u73e0\u7391\u5999\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100356","title":"\u90e8\u5206\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000001","title":"test-1","__typename":"AppliedTranslationNode"},{"questionId":"1000002","title":"\u627e\u51fa\u9690\u85cf\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000003","title":"\u8fde\u7eed\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000004","title":"\u6a21\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000005","title":"\u6c34\u57df\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"1000006","title":"\u4e00\u6b21\u7f16\u8f91","__typename":"AppliedTranslationNode"},{"questionId":"1000007","title":"\u8fd4\u56de\u5012\u6570\u7b2c k \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000008","title":"\u5206\u5272\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000009","title":"\u6c42\u548c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000010","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000011","title":"\u8ff7\u8def\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000012","title":"\u5408\u5e76\u6392\u5e8f\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000013","title":"\u5cf0\u4e0e\u8c37","__typename":"AppliedTranslationNode"},{"questionId":"1000015","title":"\u6c49\u8bfa\u5854\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000016","title":"\u6392\u5e8f\u77e9\u9635\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"1000017","title":"\u9636\u4e58\u5c3e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000018","title":"\u6574\u6570\u7684\u82f1\u8bed\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"1000019","title":"BiNode","__typename":"AppliedTranslationNode"},{"questionId":"1000020","title":"\u6062\u590d\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1000021","title":"\u6700\u5c0fK\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000022","title":"\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000023","title":"\u6309\u6469\u5e08","__typename":"AppliedTranslationNode"},{"questionId":"1000024","title":"\u591a\u6b21\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"1000025","title":"\u4e0d\u7528\u52a0\u53f7\u7684\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000026","title":"LRU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000027","title":"\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000028","title":"\u8fde\u7eed\u4e2d\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000029","title":"\u76f4\u65b9\u56fe\u7684\u6c34\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000030","title":"\u5355\u8bcd\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1000031","title":"\u5e03\u5c14\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"1000032","title":"\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000033","title":" \u5b57\u6bcd\u4e0e\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000034","title":"2\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000035","title":"\u5a74\u513f\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000036","title":"\u9a6c\u620f\u56e2\u4eba\u5854","__typename":"AppliedTranslationNode"},{"questionId":"1000037","title":"\u7b2c k \u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000038","title":"\u4e3b\u8981\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1000039","title":"\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000040","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000041","title":"\u6570\u5b57\u6d41\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1000042","title":"\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000043","title":"\u6700\u77ed\u8d85\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000044","title":"\u6d88\u5931\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000045","title":"\u6700\u5927\u9ed1\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000046","title":"\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000047","title":"T9\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000048","title":"\u4ea4\u6362\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000049","title":"\u5355\u8bcd\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000050","title":"\u5170\u987f\u8682\u8681","__typename":"AppliedTranslationNode"},{"questionId":"1000051","title":"\u7a00\u758f\u76f8\u4f3c\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000055","title":"\u4e24\u6570\u4e4b\u548c II 3","__typename":"AppliedTranslationNode"},{"questionId":"1000056","title":"\u62ff\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1000057","title":"\u5267\u60c5\u89e6\u53d1\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000058","title":"\u9b54\u672f\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000059","title":"\u5207\u5206\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000060","title":"\u5377\u79ef\u795e\u7ecf\u7f51\u7edc","__typename":"AppliedTranslationNode"},{"questionId":"1000061","title":"\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000062","title":"\u4e8c\u53c9\u6811\u4efb\u52a1\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000063","title":"\u4f20\u9012\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000085","title":"\u6e38\u4e50\u56ed\u7684\u6e38\u89c8\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000086","title":"\u671f\u671b\u4e2a\u6570\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1000087","title":"\u5c0f\u5f20\u5237\u9898\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000088","title":"\u6e38\u4e50\u56ed\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000089","title":"\u4e8c\u53c9\u6811\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000090","title":"\u6700\u5c0f\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000091","title":"\u6700\u5c0f\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000092","title":"\u4f1a\u8bae\u9009\u5740","__typename":"AppliedTranslationNode"},{"questionId":"1000093","title":"\u5bfb\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000095","title":"\u6570\u5b66\u5174\u8da3\u601d\u8003\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000096","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000097","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u524d\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000098","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000099","title":"\u3010\u6807\u7a0b\u6709\u95ee\u9898\u3011\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000100","title":"\u6c42\u4e8c\u7ef4\u6570\u7ec4\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000101","title":"\u6dfb\u52a0\u6700\u5c11\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000102","title":"\u524d\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000103","title":"\u5224\u65ad\u4e8c\u53c9\u6811\u662f\u5426\u662f\u4e00\u4e2a\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000104","title":"\u5c06\u5806\u8f6c\u6362\u4e3a\u4e00\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000105","title":"\u67e5\u627e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000106","title":"\u6811\u4e0a\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1000107","title":"\u4e8c\u53c9\u6811\u4e0a\u4e24\u70b9\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000108","title":"\u5224\u65ad\u8fde\u901a\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000109","title":"\u6700\u5c11\u7684\u64cd\u4f5c\u4f7f\u5c0f\u9547\u5b58\u5728\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1000110","title":"\u6709\u5e8f\u6570\u7ec4\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000111","title":"\u4e8c\u53c9\u67e5\u627e\u6811\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"1000112","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u6700\u540e\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000114","title":"\u5b9e\u73b0\u52a8\u6001\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000115","title":"\u4e58\u79ef\u6700\u5927\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000116","title":"\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1000117","title":"\u6811\u4e0a\u6700\u63a5\u8fd1\u7684\u4e24\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000118","title":"\u7ea6\u745f\u592b\u73af\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000119","title":"\u8ba1\u7b97\u8282\u70b9\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000120","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000121","title":"\u6ed1\u52a8\u7a97\u53e3\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000122","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"1000123","title":"\u5408\u5e76 K \u4e2a\u6700\u5c0f\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000124","title":"\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000125","title":"\u7b80\u5355\u8ba1\u7b97\u5668 V","__typename":"AppliedTranslationNode"},{"questionId":"1000126","title":"\u627e\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570II","__typename":"AppliedTranslationNode"},{"questionId":"1000127","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"1000128","title":"hanhan \u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000129","title":"\u5957\u5708\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000130","title":"\u79cb\u53f6\u6536\u85cf\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000131","title":"\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000132","title":"\u5bfc\u822a\u88c5\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000133","title":"\u5feb\u901f\u516c\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1000134","title":"\u8ffd\u9010\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000135","title":"\u79ef\u5206\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000136","title":"\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000137","title":"\u5927\u6570\u6c42\u4f59","__typename":"AppliedTranslationNode"},{"questionId":"1000138","title":"\u53e4\u8463\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000139","title":"\u901f\u7b97\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000140","title":"\u9ed1\u767d\u65b9\u683c\u753b","__typename":"AppliedTranslationNode"},{"questionId":"1000141","title":"\u6392\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000142","title":"\u7334\u5b50\u6253\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000143","title":"\u5bb6\u65cf\u5173\u7cfb","__typename":"AppliedTranslationNode"},{"questionId":"1000144","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000145","title":"OCR\u8bc6\u522b","__typename":"AppliedTranslationNode"},{"questionId":"1000146","title":"\u65e9\u9910\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000147","title":"\u9ed1\u76d2\u5149\u7ebf\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1000148","title":"\u98de\u8239\u68cb\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000149","title":"\u5206\u5272\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1000150","title":"\u53e4\u8001\u7684\u6e38\u620f\u673a","__typename":"AppliedTranslationNode"},{"questionId":"1000151","title":"01 \u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000152","title":"\u6392\u5217\u5c0f\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1000153","title":"\u82f1\u6587\u5355\u8bcd\u62fc\u5199\u7ea0\u9519\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1000154","title":"\u9b54\u6cd5\u6743\u6756\u5f3a\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1000155","title":"\u706b\u8f66\u7f16\u7ec4\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000156","title":"\u6700\u4fbf\u5b9c\u7684\u673a\u7968","__typename":"AppliedTranslationNode"},{"questionId":"1000157","title":"\u5b85\u7537\u7684\u751f\u6d3b","__typename":"AppliedTranslationNode"},{"questionId":"1000158","title":"\u4ea4\u901a\u8f68\u8ff9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000159","title":"\u7834\u8bd1\u5bc6\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000160","title":"DIST","__typename":"AppliedTranslationNode"},{"questionId":"1000161","title":"Hilbert \u66f2\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000162","title":"\u9879\u76ee\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000163","title":"\u7b97\u5f0f\u8f6c\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1000164","title":"\u5730\u7816\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000166","title":"\u7b80\u5355\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000167","title":"\u591a\u6e90 D \u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000168","title":"\u5de5\u4eba\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000169","title":"\u4e00\u5143\u4e00\u6b21\u65b9\u7a0b\u6c42\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000170","title":"\u5783\u573e\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000171","title":"\u91cd\u590d\u5b57\u7b26\u4e32\u91cd\u547d\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000172","title":"\u5192\u6ce1\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000173","title":"\u627e\u51fa\u6700\u957f\u5b57\u7b26\u4e32\u5e76\u8f93\u51fa","__typename":"AppliedTranslationNode"},{"questionId":"1000174","title":"\u8ba1\u7b97\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000175","title":"\u63a5\u9a7e\u6700\u77ed\u8ddd\u79bb\u7b97\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000176","title":"\u51e0\u4f55\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"1000177","title":"\u5207\u5272\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000178","title":"\u5e8f\u5217\u79fb\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1000179","title":"\u8bf7\u5b9e\u73b0\u51fd\u6570 parseQueryString","__typename":"AppliedTranslationNode"},{"questionId":"1000181","title":"\u8bf7\u5b9e\u73b0\u4e0b\u9762\u7684\u94fe\u5f0f\u8c03\u7528\u51fd\u6570\uff0c\u4ee5\u4f7f\u5176\u80fd\u591f\u5b9e\u73b0\u94fe\u5f0f\u8c03\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1000182","title":"7. \u5316\u5b66\u516c\u5f0f\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000183","title":"3. \u53e4\u751f\u7269\u8840\u7f18\u8fdc\u8fd1\u5224\u5b9a","__typename":"AppliedTranslationNode"},{"questionId":"1000184","title":"10. \u6570\u7ec4\u7ec4\u6210\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000185","title":"16. \u6700\u77ed\u79fb\u52a8\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000186","title":"2. \u53d1\u4e0b\u5348\u8336","__typename":"AppliedTranslationNode"},{"questionId":"1000187","title":"4. \u673a\u5668\u4eba\u8df3\u8dc3\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000188","title":"6. \u590f\u5b63\u7279\u60e0","__typename":"AppliedTranslationNode"},{"questionId":"1000189","title":"\u5c0f\u7f8e\u7684\u7528\u6237\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000190","title":"\u5c0f\u7f8e\u7684\u4ed3\u5e93\u6574\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000191","title":"\u5c0f\u7f8e\u7684\u8dd1\u817f\u4ee3\u8d2d","__typename":"AppliedTranslationNode"},{"questionId":"1000192","title":"\u5c0f\u56e2\u7684\u590d\u5236\u7c98\u8d34","__typename":"AppliedTranslationNode"},{"questionId":"1000193","title":"\u5c0f\u7f8e\u7684\u533a\u57df\u4f1a\u8bae","__typename":"AppliedTranslationNode"},{"questionId":"1000194","title":"\u5c0f\u56e2\u7684\u795e\u79d8\u6697\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000195","title":"\u5c0f\u56e2\u7684\u9009\u8c03\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000196","title":"\u5c0f\u56e2\u65e0\u8def\u53ef\u9003","__typename":"AppliedTranslationNode"},{"questionId":"1000197","title":"\u5c0f\u56e2\u7684\u88c5\u9970\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1000198","title":"\u5c0f\u56e2\u7684\u9ed8\u5951\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000199","title":"\u642d\u914d\u51fa\u552e","__typename":"AppliedTranslationNode"},{"questionId":"1000200","title":"\u5c0f\u7f8e\u7684\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1000201","title":"\u504f\u7231\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000202","title":"\u5c0f\u56e2\u7684 AB \u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000203","title":"\u5341\u5b57\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1000204","title":"\u5b8c\u5168\u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000205","title":"\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000206","title":"5-sum","__typename":"AppliedTranslationNode"},{"questionId":"1000207","title":"\u5e8f\u5217\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000208","title":"\u7f16\u8f91\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"1000209","title":"\u6700\u591a\u7684\u786c\u5e01\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000210","title":"\u6700\u5c11\u7684\u786c\u5e01\u79cd\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000211","title":"\u5b50\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000212","title":"\u5b50\u4e32\u5305\u542b\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000213","title":"\u53d6\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000214","title":"\u6811\u7684\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000215","title":"\u91c7\u8d2d\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1000216","title":"\u4e50\u56e2\u7ad9\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1000217","title":"\u7279\u6b8a\u4e8c\u8fdb\u5236\u8868\u793a\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000218","title":"\u53d8\u6362\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000219","title":"\u6279\u91cf\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1000220","title":"\u7535\u52a8\u8f66\u6e38\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1000221","title":"\u84c4\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"1000222","title":"\u6700\u591a\u724c\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000223","title":"\u5b88\u536b\u57ce\u5821","__typename":"AppliedTranslationNode"},{"questionId":"1000224","title":"\u9b54\u5854\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000225","title":"\u4e0b\u8f7d\u63d2\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"1000226","title":"\u5b8c\u6210\u4e00\u534a\u9898\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000227","title":"\u4e3b\u9898\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000228","title":"\u6574\u6570\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000229","title":"\u5141\u8bb8\u91cd\u590d\u9009\u62e9\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000230","title":"\u524d n \u4e2a\u6570\u5b57\u4e8c\u8fdb\u5236\u4e2d 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000231","title":"\u4e8c\u8fdb\u5236\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000232","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000233","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 ","__typename":"AppliedTranslationNode"},{"questionId":"1000234","title":"\u6ca1\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000235","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217 ","__typename":"AppliedTranslationNode"},{"questionId":"1000236","title":"\u5355\u8bcd\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000237","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000238","title":"\u751f\u6210\u5339\u914d\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000239","title":"\u6570\u7ec4\u4e2d\u548c\u4e3a 0 \u7684\u4e09\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000240","title":"\u5206\u5272\u56de\u6587\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000241","title":"\u590d\u539f IP ","__typename":"AppliedTranslationNode"},{"questionId":"1000242","title":"\u548c\u5927\u4e8e\u7b49\u4e8e target \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000243","title":"\u722c\u697c\u68af\u7684\u6700\u5c11\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1000244","title":"\u4e58\u79ef\u5c0f\u4e8e K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000245","title":"\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000246","title":"\u548c\u4e3a k \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000247","title":"0 \u548c 1 \u4e2a\u6570\u76f8\u540c\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000248","title":"\u5de6\u53f3\u4e24\u8fb9\u5b50\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1000249","title":"\u4e8c\u7ef4\u5b50\u77e9\u9635\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000250","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000251","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000252","title":"\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000253","title":"\u542b\u6709\u6240\u6709\u5b57\u7b26\u7684\u6700\u77ed\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000254","title":"\u6709\u6548\u7684\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000255","title":"\u6700\u591a\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u5f97\u5230\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000256","title":"\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000257","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c n \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000258","title":"\u94fe\u8868\u4e2d\u73af\u7684\u5165\u53e3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000259","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u91cd\u5408\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000260","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000261","title":"\u94fe\u8868\u4e2d\u7684\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1000262","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000263","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000264","title":"\u5c55\u5e73\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000265","title":"\u6392\u5e8f\u7684\u5faa\u73af\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000266","title":"\u73af\u5f62\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000267","title":"\u63d2\u5165\u3001\u5220\u9664\u548c\u968f\u673a\u8bbf\u95ee\u90fd\u662f O(1) \u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000268","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1000269","title":"\u7ffb\u8f6c\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1000270","title":"\u6700\u8fd1\u6700\u5c11\u4f7f\u7528\u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000271","title":"\u6700\u957f\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000272","title":"\u6700\u5c11\u56de\u6587\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"1000273","title":"\u6709\u6548\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000274","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000275","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000276","title":"\u5916\u661f\u8bed\u8a00\u662f\u5426\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000277","title":"\u5b57\u7b26\u4e32\u4ea4\u7ec7","__typename":"AppliedTranslationNode"},{"questionId":"1000278","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000279","title":"\u540e\u7f00\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1000280","title":"\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000281","title":"\u5c0f\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"1000282","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000283","title":"\u76f4\u65b9\u56fe\u6700\u5927\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000284","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1000285","title":"\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000286","title":"\u4e09\u89d2\u5f62\u4e2d\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000287","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000288","title":"\u52a0\u51cf\u7684\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000289","title":"\u6700\u5c11\u7684\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000290","title":"\u6392\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000291","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000292","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000293","title":"\u6700\u8fd1\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000294","title":"\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000295","title":"\u5f80\u5b8c\u5168\u4e8c\u53c9\u6811\u6dfb\u52a0\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000296","title":"\u77e9\u9635\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000297","title":"\u4e8c\u53c9\u6811\u6bcf\u5c42\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000298","title":"\u4e8c\u53c9\u6811\u6700\u5e95\u5c42\u6700\u5de6\u8fb9\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000299","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u4fa7\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000300","title":"\u5355\u8bcd\u6f14\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"1000301","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"1000302","title":"\u5f00\u5bc6\u7801\u9501","__typename":"AppliedTranslationNode"},{"questionId":"1000303","title":"\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000304","title":"\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000305","title":"\u8ba1\u7b97\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000306","title":"\u4ece\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u7684\u8def\u5f84\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000307","title":"\u5411\u4e0b\u7684\u8def\u5f84\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000308","title":"\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000309","title":"\u8282\u70b9\u4e4b\u548c\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000310","title":"\u8bfe\u7a0b\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000311","title":"\u5c55\u5e73\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000312","title":"\u5916\u661f\u6587\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000313","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"1000314","title":"\u91cd\u5efa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000315","title":"\u6240\u6709\u5927\u4e8e\u7b49\u4e8e\u8282\u70b9\u7684\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000316","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000317","title":"\u76f8\u4f3c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000318","title":"\u591a\u4f59\u7684\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1000319","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u4e24\u4e2a\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000320","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000321","title":"\u503c\u548c\u4e0b\u6807\u4e4b\u5dee\u90fd\u5728\u7ed9\u5b9a\u7684\u8303\u56f4\u5185","__typename":"AppliedTranslationNode"},{"questionId":"1000322","title":"\u65e5\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000323","title":"\u6570\u636e\u6d41\u7684\u7b2c K \u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000324","title":"\u51fa\u73b0\u9891\u7387\u6700\u9ad8\u7684 k \u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000325","title":"\u5b9e\u73b0\u524d\u7f00\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000326","title":"\u548c\u6700\u5c0f\u7684 k \u4e2a\u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1000327","title":"\u66ff\u6362\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000328","title":"\u795e\u5947\u7684\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000329","title":"\u6700\u77ed\u7684\u5355\u8bcd\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000330","title":"\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000331","title":"\u6700\u5927\u7684\u5f02\u6216","__typename":"AppliedTranslationNode"},{"questionId":"1000332","title":"\u67e5\u627e\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000333","title":"\u5c71\u5cf0\u6570\u7ec4\u7684\u9876\u90e8","__typename":"AppliedTranslationNode"},{"questionId":"1000334","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000335","title":"\u6309\u6743\u91cd\u751f\u6210\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000336","title":"\u6c42\u5e73\u65b9\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000337","title":"\u72d2\u72d2\u5403\u9999\u8549","__typename":"AppliedTranslationNode"},{"questionId":"1000338","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000339","title":"\u6570\u7ec4\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000340","title":"\u6570\u7ec4\u4e2d\u7684\u7b2c k \u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000341","title":"\u94fe\u8868\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000342","title":"\u5408\u5e76\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000343","title":"\u6240\u6709\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000344","title":"\u542b\u6709 k \u4e2a\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000345","title":"\u8def\u5f84\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000346","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000347","title":"\u8f66\u961f\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000348","title":"\u8f66\u8f86\u5b89\u6392","__typename":"AppliedTranslationNode"},{"questionId":"1000349","title":"\u8def\u5f84\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000350","title":"\u8c01\u6321\u4f4f\u4e86\u6211\u7684\u7ea2\u7eff\u706f","__typename":"AppliedTranslationNode"},{"questionId":"1000351","title":"\u65b0\u589e\u7684\u4e13\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000352","title":"\u6700\u5927\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000353","title":"\u5f55\u53d6\u5206\u6570\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000354","title":"\u8c03\u6574\u7535\u5e73","__typename":"AppliedTranslationNode"},{"questionId":"1000355","title":"\u7b7e\u5230\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000356","title":"\u81ea\u884c\u8f66\u62c9\u529b\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"1000358","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000359","title":"\u73af\u5f62\u95ef\u5173\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000360","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000361","title":"\u5165\u573a\u5b89\u68c0","__typename":"AppliedTranslationNode"},{"questionId":"1000362","title":"\u5f00\u5e55\u5f0f\u7130\u706b","__typename":"AppliedTranslationNode"},{"questionId":"1000363","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000364","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000367","title":"\u5341\u5b57\u8def\u53e3\u7684\u4ea4\u901a","__typename":"AppliedTranslationNode"},{"questionId":"1000368","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000369","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000370","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000371","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000373","title":"\u5fd7\u613f\u8005\u8c03\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000374","title":"\u65e0\u9650\u68cb\u5c40","__typename":"AppliedTranslationNode"},{"questionId":"1000375","title":"\u81ea\u884c\u8f66\u70ab\u6280\u8d5b\u573a","__typename":"AppliedTranslationNode"},{"questionId":"1000378","title":"\u95f4\u9694\u5220\u9664\u94fe\u8868\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000379","title":"\u5730\u94c1\u8def\u7ebf\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000382","title":"\u67f1\u72b6\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000383","title":"\u7535\u5b66\u5b9e\u9a8c\u8bfe","__typename":"AppliedTranslationNode"}]}} \ No newline at end of file +{"data":{"translations":[{"questionId":"1","title":"\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2","title":"\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"3","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"4","title":"\u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"5","title":"\u6700\u957f\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"6","title":"Z \u5b57\u5f62\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"7","title":"\u6574\u6570\u53cd\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"8","title":"\u5b57\u7b26\u4e32\u8f6c\u6362\u6574\u6570 (atoi)","__typename":"AppliedTranslationNode"},{"questionId":"9","title":"\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"10","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"11","title":"\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"12","title":"\u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"13","title":"\u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"14","title":"\u6700\u957f\u516c\u5171\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"15","title":"\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"16","title":"\u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"17","title":"\u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"18","title":"\u56db\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"19","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c N \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"20","title":"\u6709\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"21","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"22","title":"\u62ec\u53f7\u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"23","title":"\u5408\u5e76K\u4e2a\u5347\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"24","title":"\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"25","title":"K \u4e2a\u4e00\u7ec4\u7ffb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"26","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"27","title":"\u79fb\u9664\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"28","title":"\u5b9e\u73b0 strStr()","__typename":"AppliedTranslationNode"},{"questionId":"29","title":"\u4e24\u6570\u76f8\u9664","__typename":"AppliedTranslationNode"},{"questionId":"30","title":"\u4e32\u8054\u6240\u6709\u5355\u8bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"31","title":"\u4e0b\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"32","title":"\u6700\u957f\u6709\u6548\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"33","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"34","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"35","title":"\u641c\u7d22\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"36","title":"\u6709\u6548\u7684\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"37","title":"\u89e3\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"38","title":"\u5916\u89c2\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"39","title":"\u7ec4\u5408\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"40","title":"\u7ec4\u5408\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"41","title":"\u7f3a\u5931\u7684\u7b2c\u4e00\u4e2a\u6b63\u6570","__typename":"AppliedTranslationNode"},{"questionId":"42","title":"\u63a5\u96e8\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"43","title":"\u5b57\u7b26\u4e32\u76f8\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"44","title":"\u901a\u914d\u7b26\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"45","title":"\u8df3\u8dc3\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"46","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"47","title":"\u5168\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"48","title":"\u65cb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"49","title":"\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"50","title":"Pow(x, n)","__typename":"AppliedTranslationNode"},{"questionId":"51","title":"N \u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"52","title":"N\u7687\u540e II","__typename":"AppliedTranslationNode"},{"questionId":"53","title":"\u6700\u5927\u5b50\u5e8f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"54","title":"\u87ba\u65cb\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"55","title":"\u8df3\u8dc3\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"56","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"57","title":"\u63d2\u5165\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"58","title":"\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"59","title":"\u87ba\u65cb\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"60","title":"\u6392\u5217\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"61","title":"\u65cb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"62","title":"\u4e0d\u540c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"63","title":"\u4e0d\u540c\u8def\u5f84 II","__typename":"AppliedTranslationNode"},{"questionId":"64","title":"\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"65","title":"\u6709\u6548\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"66","title":"\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"67","title":"\u4e8c\u8fdb\u5236\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"68","title":"\u6587\u672c\u5de6\u53f3\u5bf9\u9f50","__typename":"AppliedTranslationNode"},{"questionId":"69","title":"Sqrt(x)","__typename":"AppliedTranslationNode"},{"questionId":"70","title":"\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"71","title":"\u7b80\u5316\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"72","title":"\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"73","title":"\u77e9\u9635\u7f6e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"74","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"75","title":"\u989c\u8272\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"76","title":"\u6700\u5c0f\u8986\u76d6\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"77","title":"\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"78","title":"\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"79","title":"\u5355\u8bcd\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"80","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"81","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"82","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"83","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"84","title":"\u67f1\u72b6\u56fe\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"85","title":"\u6700\u5927\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"86","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"87","title":"\u6270\u4e71\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"88","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"89","title":"\u683c\u96f7\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"90","title":"\u5b50\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"91","title":"\u89e3\u7801\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"92","title":"\u53cd\u8f6c\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"93","title":"\u590d\u539f IP \u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"94","title":"\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"95","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"96","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"97","title":"\u4ea4\u9519\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"98","title":"\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"99","title":"\u6062\u590d\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100","title":"\u76f8\u540c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"101","title":"\u5bf9\u79f0\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"102","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"103","title":"\u4e8c\u53c9\u6811\u7684\u952f\u9f7f\u5f62\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"104","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"105","title":"\u4ece\u524d\u5e8f\u4e0e\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"106","title":"\u4ece\u4e2d\u5e8f\u4e0e\u540e\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"107","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"108","title":"\u5c06\u6709\u5e8f\u6570\u7ec4\u8f6c\u6362\u4e3a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"109","title":"\u6709\u5e8f\u94fe\u8868\u8f6c\u6362\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"110","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"111","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"112","title":"\u8def\u5f84\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"113","title":"\u8def\u5f84\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"114","title":"\u4e8c\u53c9\u6811\u5c55\u5f00\u4e3a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"115","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"116","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488","__typename":"AppliedTranslationNode"},{"questionId":"117","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488 II","__typename":"AppliedTranslationNode"},{"questionId":"118","title":"\u6768\u8f89\u4e09\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"119","title":"\u6768\u8f89\u4e09\u89d2 II","__typename":"AppliedTranslationNode"},{"questionId":"120","title":"\u4e09\u89d2\u5f62\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"121","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a","__typename":"AppliedTranslationNode"},{"questionId":"122","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"123","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a III","__typename":"AppliedTranslationNode"},{"questionId":"124","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u5927\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"125","title":"\u9a8c\u8bc1\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"126","title":"\u5355\u8bcd\u63a5\u9f99 II","__typename":"AppliedTranslationNode"},{"questionId":"127","title":"\u5355\u8bcd\u63a5\u9f99","__typename":"AppliedTranslationNode"},{"questionId":"128","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"129","title":"\u6c42\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"130","title":"\u88ab\u56f4\u7ed5\u7684\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"131","title":"\u5206\u5272\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"132","title":"\u5206\u5272\u56de\u6587\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"133","title":"\u514b\u9686\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"134","title":"\u52a0\u6cb9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"135","title":"\u5206\u53d1\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"136","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"137","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 II","__typename":"AppliedTranslationNode"},{"questionId":"138","title":"\u590d\u5236\u5e26\u968f\u673a\u6307\u9488\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"139","title":"\u5355\u8bcd\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"140","title":"\u5355\u8bcd\u62c6\u5206 II","__typename":"AppliedTranslationNode"},{"questionId":"141","title":"\u73af\u5f62\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"142","title":"\u73af\u5f62\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"143","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"144","title":"\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"145","title":"\u4e8c\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"146","title":"LRU \u7f13\u5b58\u673a\u5236","__typename":"AppliedTranslationNode"},{"questionId":"147","title":"\u5bf9\u94fe\u8868\u8fdb\u884c\u63d2\u5165\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"148","title":"\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"149","title":"\u76f4\u7ebf\u4e0a\u6700\u591a\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"150","title":"\u9006\u6ce2\u5170\u8868\u8fbe\u5f0f\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"151","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"152","title":"\u4e58\u79ef\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"153","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"154","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"155","title":"\u6700\u5c0f\u6808","__typename":"AppliedTranslationNode"},{"questionId":"156","title":"\u4e0a\u4e0b\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"157","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"158","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26 II","__typename":"AppliedTranslationNode"},{"questionId":"159","title":"\u81f3\u591a\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"160","title":"\u76f8\u4ea4\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"161","title":"\u76f8\u9694\u4e3a 1 \u7684\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"162","title":"\u5bfb\u627e\u5cf0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"163","title":"\u7f3a\u5931\u7684\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"164","title":"\u6700\u5927\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"165","title":"\u6bd4\u8f83\u7248\u672c\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"166","title":"\u5206\u6570\u5230\u5c0f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"167","title":"\u4e24\u6570\u4e4b\u548c II - \u8f93\u5165\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"168","title":"Excel\u8868\u5217\u540d\u79f0","__typename":"AppliedTranslationNode"},{"questionId":"169","title":"\u591a\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"170","title":"\u4e24\u6570\u4e4b\u548c III - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"171","title":"Excel \u8868\u5217\u5e8f\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"172","title":"\u9636\u4e58\u540e\u7684\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"173","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"174","title":"\u5730\u4e0b\u57ce\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"175","title":"\u7ec4\u5408\u4e24\u4e2a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"176","title":"\u7b2c\u4e8c\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"177","title":"\u7b2cN\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"178","title":"\u5206\u6570\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"179","title":"\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"180","title":"\u8fde\u7eed\u51fa\u73b0\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"181","title":"\u8d85\u8fc7\u7ecf\u7406\u6536\u5165\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"182","title":"\u67e5\u627e\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"183","title":"\u4ece\u4e0d\u8ba2\u8d2d\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"184","title":"\u90e8\u95e8\u5de5\u8d44\u6700\u9ad8\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"185","title":"\u90e8\u95e8\u5de5\u8d44\u524d\u4e09\u9ad8\u7684\u6240\u6709\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"186","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd II","__typename":"AppliedTranslationNode"},{"questionId":"187","title":"\u91cd\u590d\u7684DNA\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"188","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a IV","__typename":"AppliedTranslationNode"},{"questionId":"189","title":"\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"190","title":"\u98a0\u5012\u4e8c\u8fdb\u5236\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"191","title":"\u4f4d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"192","title":"\u7edf\u8ba1\u8bcd\u9891","__typename":"AppliedTranslationNode"},{"questionId":"193","title":"\u6709\u6548\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"194","title":"\u8f6c\u7f6e\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"195","title":"\u7b2c\u5341\u884c","__typename":"AppliedTranslationNode"},{"questionId":"196","title":"\u5220\u9664\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"197","title":"\u4e0a\u5347\u7684\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"198","title":"\u6253\u5bb6\u52ab\u820d","__typename":"AppliedTranslationNode"},{"questionId":"199","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"200","title":"\u5c9b\u5c7f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"201","title":"\u6570\u5b57\u8303\u56f4\u6309\u4f4d\u4e0e","__typename":"AppliedTranslationNode"},{"questionId":"202","title":"\u5feb\u4e50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"203","title":"\u79fb\u9664\u94fe\u8868\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"204","title":"\u8ba1\u6570\u8d28\u6570","__typename":"AppliedTranslationNode"},{"questionId":"205","title":"\u540c\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"206","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"207","title":"\u8bfe\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"208","title":"\u5b9e\u73b0 Trie (\u524d\u7f00\u6811)","__typename":"AppliedTranslationNode"},{"questionId":"209","title":"\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"210","title":"\u8bfe\u7a0b\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"211","title":"\u6dfb\u52a0\u4e0e\u641c\u7d22\u5355\u8bcd - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"212","title":"\u5355\u8bcd\u641c\u7d22 II","__typename":"AppliedTranslationNode"},{"questionId":"213","title":"\u6253\u5bb6\u52ab\u820d II","__typename":"AppliedTranslationNode"},{"questionId":"214","title":"\u6700\u77ed\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"215","title":"\u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"216","title":"\u7ec4\u5408\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"217","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"218","title":"\u5929\u9645\u7ebf\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"219","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"220","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"221","title":"\u6700\u5927\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"222","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"223","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"224","title":"\u57fa\u672c\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"225","title":"\u7528\u961f\u5217\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"226","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"227","title":"\u57fa\u672c\u8ba1\u7b97\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"228","title":"\u6c47\u603b\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"229","title":"\u6c42\u4f17\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"230","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"231","title":"2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"232","title":"\u7528\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"233","title":"\u6570\u5b57 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"234","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"235","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"236","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"237","title":"\u5220\u9664\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"238","title":"\u9664\u81ea\u8eab\u4ee5\u5916\u6570\u7ec4\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"239","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"240","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"241","title":"\u4e3a\u8fd0\u7b97\u8868\u8fbe\u5f0f\u8bbe\u8ba1\u4f18\u5148\u7ea7","__typename":"AppliedTranslationNode"},{"questionId":"242","title":"\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"243","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"244","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"245","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb III","__typename":"AppliedTranslationNode"},{"questionId":"246","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"247","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"248","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"249","title":"\u79fb\u4f4d\u5b57\u7b26\u4e32\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"250","title":"\u7edf\u8ba1\u540c\u503c\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"251","title":"\u5c55\u5f00\u4e8c\u7ef4\u5411\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"252","title":"\u4f1a\u8bae\u5ba4","__typename":"AppliedTranslationNode"},{"questionId":"253","title":"\u4f1a\u8bae\u5ba4 II","__typename":"AppliedTranslationNode"},{"questionId":"254","title":"\u56e0\u5b50\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"255","title":"\u9a8c\u8bc1\u524d\u5e8f\u904d\u5386\u5e8f\u5217\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"256","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"257","title":"\u4e8c\u53c9\u6811\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"258","title":"\u5404\u4f4d\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"259","title":"\u8f83\u5c0f\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"260","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 III","__typename":"AppliedTranslationNode"},{"questionId":"261","title":"\u4ee5\u56fe\u5224\u6811","__typename":"AppliedTranslationNode"},{"questionId":"262","title":"\u884c\u7a0b\u548c\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"263","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"264","title":"\u4e11\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"265","title":"\u7c89\u5237\u623f\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"266","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"267","title":"\u56de\u6587\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"268","title":"\u4e22\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"269","title":"\u706b\u661f\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"270","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c","__typename":"AppliedTranslationNode"},{"questionId":"271","title":"\u5b57\u7b26\u4e32\u7684\u7f16\u7801\u4e0e\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"272","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"273","title":"\u6574\u6570\u8f6c\u6362\u82f1\u6587\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"274","title":"H \u6307\u6570","__typename":"AppliedTranslationNode"},{"questionId":"275","title":"H \u6307\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"276","title":"\u6805\u680f\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"277","title":"\u641c\u5bfb\u540d\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"278","title":"\u7b2c\u4e00\u4e2a\u9519\u8bef\u7684\u7248\u672c","__typename":"AppliedTranslationNode"},{"questionId":"279","title":"\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"280","title":"\u6446\u52a8\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"281","title":"\u952f\u9f7f\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"282","title":"\u7ed9\u8868\u8fbe\u5f0f\u6dfb\u52a0\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"283","title":"\u79fb\u52a8\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"284","title":"\u7aa5\u63a2\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"285","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"286","title":"\u5899\u4e0e\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"287","title":"\u5bfb\u627e\u91cd\u590d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"288","title":"\u5355\u8bcd\u7684\u552f\u4e00\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"289","title":"\u751f\u547d\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"290","title":"\u5355\u8bcd\u89c4\u5f8b","__typename":"AppliedTranslationNode"},{"questionId":"291","title":"\u5355\u8bcd\u89c4\u5f8b II","__typename":"AppliedTranslationNode"},{"questionId":"292","title":"Nim \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"293","title":"\u7ffb\u8f6c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"294","title":"\u7ffb\u8f6c\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"295","title":"\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"296","title":"\u6700\u4f73\u7684\u78b0\u5934\u5730\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"297","title":"\u4e8c\u53c9\u6811\u7684\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"298","title":"\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"299","title":"\u731c\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"300","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"301","title":"\u5220\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"302","title":"\u5305\u542b\u5168\u90e8\u9ed1\u8272\u50cf\u7d20\u7684\u6700\u5c0f\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"303","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"304","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"305","title":"\u5c9b\u5c7f\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"306","title":"\u7d2f\u52a0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"307","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u53ef\u4fee\u6539","__typename":"AppliedTranslationNode"},{"questionId":"308","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"309","title":"\u6700\u4f73\u4e70\u5356\u80a1\u7968\u65f6\u673a\u542b\u51b7\u51bb\u671f","__typename":"AppliedTranslationNode"},{"questionId":"310","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"311","title":"\u7a00\u758f\u77e9\u9635\u7684\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"312","title":"\u6233\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"313","title":"\u8d85\u7ea7\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"314","title":"\u4e8c\u53c9\u6811\u7684\u5782\u76f4\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"315","title":"\u8ba1\u7b97\u53f3\u4fa7\u5c0f\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"316","title":"\u53bb\u9664\u91cd\u590d\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"317","title":"\u79bb\u5efa\u7b51\u7269\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"318","title":"\u6700\u5927\u5355\u8bcd\u957f\u5ea6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"319","title":"\u706f\u6ce1\u5f00\u5173","__typename":"AppliedTranslationNode"},{"questionId":"320","title":"\u5217\u4e3e\u5355\u8bcd\u7684\u5168\u90e8\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"321","title":"\u62fc\u63a5\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"322","title":"\u96f6\u94b1\u5151\u6362","__typename":"AppliedTranslationNode"},{"questionId":"323","title":"\u65e0\u5411\u56fe\u4e2d\u8fde\u901a\u5206\u91cf\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"324","title":"\u6446\u52a8\u6392\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"325","title":"\u548c\u7b49\u4e8e k \u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"326","title":"3\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"327","title":"\u533a\u95f4\u548c\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"328","title":"\u5947\u5076\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"329","title":"\u77e9\u9635\u4e2d\u7684\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"330","title":"\u6309\u8981\u6c42\u8865\u9f50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"331","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"332","title":"\u91cd\u65b0\u5b89\u6392\u884c\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"333","title":"\u6700\u5927 BST \u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"334","title":"\u9012\u589e\u7684\u4e09\u5143\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"335","title":"\u8def\u5f84\u4ea4\u53c9","__typename":"AppliedTranslationNode"},{"questionId":"336","title":"\u56de\u6587\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"337","title":"\u6253\u5bb6\u52ab\u820d III","__typename":"AppliedTranslationNode"},{"questionId":"338","title":"\u6bd4\u7279\u4f4d\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"339","title":"\u5d4c\u5957\u5217\u8868\u6743\u91cd\u548c","__typename":"AppliedTranslationNode"},{"questionId":"340","title":"\u81f3\u591a\u5305\u542b K \u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"341","title":"\u6241\u5e73\u5316\u5d4c\u5957\u5217\u8868\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"342","title":"4\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"343","title":"\u6574\u6570\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"344","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"345","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"346","title":"\u6570\u636e\u6d41\u4e2d\u7684\u79fb\u52a8\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"347","title":"\u524d K \u4e2a\u9ad8\u9891\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"348","title":"\u8bbe\u8ba1\u4e95\u5b57\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"349","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"350","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"351","title":"\u5b89\u5353\u7cfb\u7edf\u624b\u52bf\u89e3\u9501","__typename":"AppliedTranslationNode"},{"questionId":"352","title":"\u5c06\u6570\u636e\u6d41\u53d8\u4e3a\u591a\u4e2a\u4e0d\u76f8\u4ea4\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"353","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"354","title":"\u4fc4\u7f57\u65af\u5957\u5a03\u4fe1\u5c01\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"355","title":"\u8bbe\u8ba1\u63a8\u7279","__typename":"AppliedTranslationNode"},{"questionId":"356","title":"\u76f4\u7ebf\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"357","title":"\u8ba1\u7b97\u5404\u4e2a\u4f4d\u6570\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"358","title":"K \u8ddd\u79bb\u95f4\u9694\u91cd\u6392\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"359","title":"\u65e5\u5fd7\u901f\u7387\u9650\u5236\u5668","__typename":"AppliedTranslationNode"},{"questionId":"360","title":"\u6709\u5e8f\u8f6c\u5316\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"361","title":"\u8f70\u70b8\u654c\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"362","title":"\u6572\u51fb\u8ba1\u6570\u5668","__typename":"AppliedTranslationNode"},{"questionId":"363","title":"\u77e9\u5f62\u533a\u57df\u4e0d\u8d85\u8fc7 K \u7684\u6700\u5927\u6570\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"364","title":"\u52a0\u6743\u5d4c\u5957\u5e8f\u5217\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"365","title":"\u6c34\u58f6\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"366","title":"\u5bfb\u627e\u4e8c\u53c9\u6811\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"367","title":"\u6709\u6548\u7684\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"368","title":"\u6700\u5927\u6574\u9664\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"369","title":"\u7ed9\u5355\u94fe\u8868\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"370","title":"\u533a\u95f4\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"371","title":"\u4e24\u6574\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"372","title":"\u8d85\u7ea7\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"373","title":"\u67e5\u627e\u548c\u6700\u5c0f\u7684K\u5bf9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"374","title":"\u731c\u6570\u5b57\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"375","title":"\u731c\u6570\u5b57\u5927\u5c0f II","__typename":"AppliedTranslationNode"},{"questionId":"376","title":"\u6446\u52a8\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"377","title":"\u7ec4\u5408\u603b\u548c \u2163","__typename":"AppliedTranslationNode"},{"questionId":"378","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"379","title":"\u7535\u8bdd\u76ee\u5f55\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"380","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"381","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20 - \u5141\u8bb8\u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"382","title":"\u94fe\u8868\u968f\u673a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"383","title":"\u8d4e\u91d1\u4fe1","__typename":"AppliedTranslationNode"},{"questionId":"384","title":"\u6253\u4e71\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"385","title":"\u8ff7\u4f60\u8bed\u6cd5\u5206\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"386","title":"\u5b57\u5178\u5e8f\u6392\u6570","__typename":"AppliedTranslationNode"},{"questionId":"387","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c\u4e00\u4e2a\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"388","title":"\u6587\u4ef6\u7684\u6700\u957f\u7edd\u5bf9\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"389","title":"\u627e\u4e0d\u540c","__typename":"AppliedTranslationNode"},{"questionId":"390","title":"\u6d88\u9664\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"391","title":"\u5b8c\u7f8e\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"392","title":"\u5224\u65ad\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"393","title":"UTF-8 \u7f16\u7801\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"394","title":"\u5b57\u7b26\u4e32\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"395","title":"\u81f3\u5c11\u6709 K \u4e2a\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"396","title":"\u65cb\u8f6c\u51fd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"397","title":"\u6574\u6570\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"398","title":"\u968f\u673a\u6570\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"399","title":"\u9664\u6cd5\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"400","title":"\u7b2c N \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"401","title":"\u4e8c\u8fdb\u5236\u624b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"402","title":"\u79fb\u6389 K \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"403","title":"\u9752\u86d9\u8fc7\u6cb3","__typename":"AppliedTranslationNode"},{"questionId":"404","title":"\u5de6\u53f6\u5b50\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"405","title":"\u6570\u5b57\u8f6c\u6362\u4e3a\u5341\u516d\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"406","title":"\u6839\u636e\u8eab\u9ad8\u91cd\u5efa\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"407","title":"\u63a5\u96e8\u6c34 II","__typename":"AppliedTranslationNode"},{"questionId":"408","title":"\u6709\u6548\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"409","title":"\u6700\u957f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"410","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"411","title":"\u6700\u77ed\u72ec\u5360\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"412","title":"Fizz Buzz","__typename":"AppliedTranslationNode"},{"questionId":"413","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"414","title":"\u7b2c\u4e09\u5927\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"415","title":"\u5b57\u7b26\u4e32\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"416","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"417","title":"\u592a\u5e73\u6d0b\u5927\u897f\u6d0b\u6c34\u6d41\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"418","title":"\u5c4f\u5e55\u53ef\u663e\u793a\u53e5\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"419","title":"\u7532\u677f\u4e0a\u7684\u6218\u8230","__typename":"AppliedTranslationNode"},{"questionId":"420","title":"\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668","__typename":"AppliedTranslationNode"},{"questionId":"421","title":"\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"422","title":"\u6709\u6548\u7684\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"423","title":"\u4ece\u82f1\u6587\u4e2d\u91cd\u5efa\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"424","title":"\u66ff\u6362\u540e\u7684\u6700\u957f\u91cd\u590d\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"425","title":"\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"432","title":"\u5168 O(1) \u7684\u6570\u636e\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"433","title":"\u6700\u5c0f\u57fa\u56e0\u53d8\u5316","__typename":"AppliedTranslationNode"},{"questionId":"434","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"435","title":"\u65e0\u91cd\u53e0\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"436","title":"\u5bfb\u627e\u53f3\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"437","title":"\u8def\u5f84\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"438","title":"\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"439","title":"\u4e09\u5143\u8868\u8fbe\u5f0f\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"440","title":"\u5b57\u5178\u5e8f\u7684\u7b2cK\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"441","title":"\u6392\u5217\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"442","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"443","title":"\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"444","title":"\u5e8f\u5217\u91cd\u5efa","__typename":"AppliedTranslationNode"},{"questionId":"445","title":"\u4e24\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"446","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206 II - \u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"447","title":"\u56de\u65cb\u9556\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"448","title":"\u627e\u5230\u6240\u6709\u6570\u7ec4\u4e2d\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"449","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"450","title":"\u5220\u9664\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"451","title":"\u6839\u636e\u5b57\u7b26\u51fa\u73b0\u9891\u7387\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"452","title":"\u7528\u6700\u5c11\u6570\u91cf\u7684\u7bad\u5f15\u7206\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"453","title":"\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"454","title":"\u56db\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"455","title":"\u5206\u53d1\u997c\u5e72","__typename":"AppliedTranslationNode"},{"questionId":"456","title":"132 \u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"457","title":"\u73af\u5f62\u6570\u7ec4\u662f\u5426\u5b58\u5728\u5faa\u73af","__typename":"AppliedTranslationNode"},{"questionId":"458","title":"\u53ef\u601c\u7684\u5c0f\u732a","__typename":"AppliedTranslationNode"},{"questionId":"459","title":"\u91cd\u590d\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"460","title":"LFU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"461","title":"\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"462","title":"\u6700\u5c11\u79fb\u52a8\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49 II","__typename":"AppliedTranslationNode"},{"questionId":"463","title":"\u5c9b\u5c7f\u7684\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"464","title":"\u6211\u80fd\u8d62\u5417","__typename":"AppliedTranslationNode"},{"questionId":"465","title":"\u6700\u4f18\u8d26\u5355\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"466","title":"\u7edf\u8ba1\u91cd\u590d\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"467","title":"\u73af\u7ed5\u5b57\u7b26\u4e32\u4e2d\u552f\u4e00\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"468","title":"\u9a8c\u8bc1IP\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"469","title":"\u51f8\u591a\u8fb9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"471","title":"\u7f16\u7801\u6700\u77ed\u957f\u5ea6\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"472","title":"\u8fde\u63a5\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"473","title":"\u706b\u67f4\u62fc\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"474","title":"\u4e00\u548c\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"475","title":"\u4f9b\u6696\u5668","__typename":"AppliedTranslationNode"},{"questionId":"476","title":"\u6570\u5b57\u7684\u8865\u6570","__typename":"AppliedTranslationNode"},{"questionId":"477","title":"\u6c49\u660e\u8ddd\u79bb\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"479","title":"\u6700\u5927\u56de\u6587\u6570\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"480","title":"\u6ed1\u52a8\u7a97\u53e3\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"481","title":"\u795e\u5947\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"482","title":"\u5bc6\u94a5\u683c\u5f0f\u5316","__typename":"AppliedTranslationNode"},{"questionId":"483","title":"\u6700\u5c0f\u597d\u8fdb\u5236","__typename":"AppliedTranslationNode"},{"questionId":"484","title":"\u5bfb\u627e\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"485","title":"\u6700\u5927\u8fde\u7eed 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"486","title":"\u9884\u6d4b\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"487","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"488","title":"\u7956\u739b\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"489","title":"\u7b2c K \u6761\u6700\u5c0f\u6307\u4ee4","__typename":"AppliedTranslationNode"},{"questionId":"490","title":"\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"491","title":"\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"492","title":"\u6784\u9020\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"493","title":"\u7ffb\u8f6c\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"494","title":"\u76ee\u6807\u548c","__typename":"AppliedTranslationNode"},{"questionId":"495","title":"\u63d0\u83ab\u653b\u51fb","__typename":"AppliedTranslationNode"},{"questionId":"496","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"498","title":"\u5bf9\u89d2\u7ebf\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"499","title":"\u8ff7\u5bab III","__typename":"AppliedTranslationNode"},{"questionId":"500","title":"\u952e\u76d8\u884c","__typename":"AppliedTranslationNode"},{"questionId":"501","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4f17\u6570","__typename":"AppliedTranslationNode"},{"questionId":"502","title":"IPO","__typename":"AppliedTranslationNode"},{"questionId":"503","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"504","title":"\u4e03\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"505","title":"\u8ff7\u5bab II","__typename":"AppliedTranslationNode"},{"questionId":"506","title":"\u76f8\u5bf9\u540d\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"507","title":"\u5b8c\u7f8e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"508","title":"\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b50\u6811\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"509","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7 II","__typename":"AppliedTranslationNode"},{"questionId":"511","title":"\u4ece\u59cb\u70b9\u5230\u7ec8\u70b9\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"513","title":"\u627e\u6811\u5de6\u4e0b\u89d2\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"514","title":"\u81ea\u7531\u4e4b\u8def","__typename":"AppliedTranslationNode"},{"questionId":"515","title":"\u5728\u6bcf\u4e2a\u6811\u884c\u4e2d\u627e\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"516","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"517","title":"\u8d85\u7ea7\u6d17\u8863\u673a","__typename":"AppliedTranslationNode"},{"questionId":"518","title":"\u96f6\u94b1\u5151\u6362 II","__typename":"AppliedTranslationNode"},{"questionId":"520","title":"\u68c0\u6d4b\u5927\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"521","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 \u2160","__typename":"AppliedTranslationNode"},{"questionId":"522","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"523","title":"\u8fde\u7eed\u7684\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"524","title":"\u901a\u8fc7\u5220\u9664\u5b57\u6bcd\u5339\u914d\u5230\u5b57\u5178\u91cc\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"525","title":"\u8fde\u7eed\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"526","title":"\u4f18\u7f8e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"527","title":"\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"528","title":"\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"529","title":"\u626b\u96f7\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"530","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"531","title":"\u5b64\u72ec\u50cf\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"532","title":"\u6570\u7ec4\u4e2d\u7684 k-diff \u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"533","title":"\u5b64\u72ec\u50cf\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"535","title":"TinyURL \u7684\u52a0\u5bc6\u4e0e\u89e3\u5bc6","__typename":"AppliedTranslationNode"},{"questionId":"536","title":"\u4ece\u5b57\u7b26\u4e32\u751f\u6210\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"537","title":"\u590d\u6570\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"538","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"539","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"540","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u5355\u4e00\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"541","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"542","title":"01 \u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"543","title":"\u4e8c\u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"544","title":"\u8f93\u51fa\u6bd4\u8d5b\u5339\u914d\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"545","title":"\u4e8c\u53c9\u6811\u7684\u8fb9\u754c","__typename":"AppliedTranslationNode"},{"questionId":"546","title":"\u79fb\u9664\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"547","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"548","title":"\u5c06\u6570\u7ec4\u5206\u5272\u6210\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"549","title":"\u4e8c\u53c9\u6811\u4e2d\u6700\u957f\u7684\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"550","title":"\u83b7\u53d6\u98df\u7269\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"551","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 I","__typename":"AppliedTranslationNode"},{"questionId":"552","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"553","title":"\u6700\u4f18\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"554","title":"\u7816\u5899","__typename":"AppliedTranslationNode"},{"questionId":"555","title":"\u5206\u5272\u8fde\u63a5\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"556","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"557","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd III","__typename":"AppliedTranslationNode"},{"questionId":"560","title":"\u548c\u4e3a K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"561","title":"\u6570\u7ec4\u62c6\u5206 I","__typename":"AppliedTranslationNode"},{"questionId":"562","title":"\u77e9\u9635\u4e2d\u6700\u957f\u7684\u8fde\u7eed1\u7ebf\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"563","title":"\u4e8c\u53c9\u6811\u7684\u5761\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"564","title":"\u5bfb\u627e\u6700\u8fd1\u7684\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"565","title":"\u6570\u7ec4\u5d4c\u5957","__typename":"AppliedTranslationNode"},{"questionId":"566","title":"\u91cd\u5851\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"567","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"568","title":"\u6700\u5927\u4f11\u5047\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"569","title":"\u5458\u5de5\u85aa\u6c34\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"570","title":"\u81f3\u5c11\u67095\u540d\u76f4\u63a5\u4e0b\u5c5e\u7684\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"571","title":"\u7ed9\u5b9a\u6570\u5b57\u7684\u9891\u7387\u67e5\u8be2\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"572","title":"\u53e6\u4e00\u68f5\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"573","title":"\u677e\u9f20\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"574","title":"\u5f53\u9009\u8005","__typename":"AppliedTranslationNode"},{"questionId":"575","title":"\u5206\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"576","title":"\u51fa\u754c\u7684\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"577","title":"\u5458\u5de5\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"578","title":"\u67e5\u8be2\u56de\u7b54\u7387\u6700\u9ad8\u7684\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"579","title":"\u67e5\u8be2\u5458\u5de5\u7684\u7d2f\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"580","title":"\u7edf\u8ba1\u5404\u4e13\u4e1a\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"581","title":"\u6700\u77ed\u65e0\u5e8f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"582","title":"\u6740\u6389\u8fdb\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"583","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u5220\u9664\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"584","title":"\u5bfb\u627e\u7528\u6237\u63a8\u8350\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"585","title":"2016\u5e74\u7684\u6295\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"586","title":"\u8ba2\u5355\u6700\u591a\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"587","title":"\u5b89\u88c5\u6805\u680f","__typename":"AppliedTranslationNode"},{"questionId":"588","title":"\u8bbe\u8ba1\u5185\u5b58\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"591","title":"\u6807\u7b7e\u9a8c\u8bc1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"592","title":"\u5206\u6570\u52a0\u51cf\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"593","title":"\u6709\u6548\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"594","title":"\u6700\u957f\u548c\u8c10\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"595","title":"\u5927\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"596","title":"\u8d85\u8fc75\u540d\u5b66\u751f\u7684\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"597","title":"\u597d\u53cb\u7533\u8bf7 I\uff1a\u603b\u4f53\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"598","title":"\u8303\u56f4\u6c42\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"599","title":"\u4e24\u4e2a\u5217\u8868\u7684\u6700\u5c0f\u7d22\u5f15\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"600","title":"\u4e0d\u542b\u8fde\u7eed1\u7684\u975e\u8d1f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"601","title":"\u4f53\u80b2\u9986\u7684\u4eba\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"602","title":"\u597d\u53cb\u7533\u8bf7 II \uff1a\u8c01\u6709\u6700\u591a\u7684\u597d\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"603","title":"\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"604","title":"\u8fed\u4ee3\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"605","title":"\u79cd\u82b1\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"606","title":"\u6839\u636e\u4e8c\u53c9\u6811\u521b\u5efa\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"607","title":"\u9500\u552e\u5458","__typename":"AppliedTranslationNode"},{"questionId":"608","title":"\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"609","title":"\u5728\u7cfb\u7edf\u4e2d\u67e5\u627e\u91cd\u590d\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"610","title":"\u5224\u65ad\u4e09\u89d2\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"611","title":"\u6709\u6548\u4e09\u89d2\u5f62\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"612","title":"\u5e73\u9762\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"613","title":"\u76f4\u7ebf\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"614","title":"\u4e8c\u7ea7\u5173\u6ce8\u8005","__typename":"AppliedTranslationNode"},{"questionId":"615","title":"\u5e73\u5747\u5de5\u8d44\uff1a\u90e8\u95e8\u4e0e\u516c\u53f8\u6bd4\u8f83","__typename":"AppliedTranslationNode"},{"questionId":"616","title":"\u7ed9\u5b57\u7b26\u4e32\u6dfb\u52a0\u52a0\u7c97\u6807\u7b7e","__typename":"AppliedTranslationNode"},{"questionId":"617","title":"\u5408\u5e76\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"618","title":"\u5b66\u751f\u5730\u7406\u4fe1\u606f\u62a5\u544a","__typename":"AppliedTranslationNode"},{"questionId":"619","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"620","title":"\u6709\u8da3\u7684\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"621","title":"\u4efb\u52a1\u8c03\u5ea6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"623","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u589e\u52a0\u4e00\u884c","__typename":"AppliedTranslationNode"},{"questionId":"624","title":"\u6570\u7ec4\u5217\u8868\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"625","title":"\u6700\u5c0f\u56e0\u5f0f\u5206\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"626","title":"\u6362\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"627","title":"\u53d8\u66f4\u6027\u522b","__typename":"AppliedTranslationNode"},{"questionId":"628","title":"\u4e09\u4e2a\u6570\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"629","title":"K\u4e2a\u9006\u5e8f\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"630","title":"\u8bfe\u7a0b\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"631","title":"\u8bbe\u8ba1 Excel \u6c42\u548c\u516c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"632","title":"\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"633","title":"\u5e73\u65b9\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"634","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u9519\u4f4d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"635","title":"\u8bbe\u8ba1\u65e5\u5fd7\u5b58\u50a8\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"636","title":"\u51fd\u6570\u7684\u72ec\u5360\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"637","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"638","title":"\u5927\u793c\u5305","__typename":"AppliedTranslationNode"},{"questionId":"639","title":"\u89e3\u7801\u65b9\u6cd5 II","__typename":"AppliedTranslationNode"},{"questionId":"640","title":"\u6c42\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"642","title":"\u8bbe\u8ba1\u641c\u7d22\u81ea\u52a8\u8865\u5168\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"643","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 I","__typename":"AppliedTranslationNode"},{"questionId":"644","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"645","title":"\u9519\u8bef\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"646","title":"\u6700\u957f\u6570\u5bf9\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"647","title":"\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"648","title":"\u5355\u8bcd\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"649","title":"Dota2 \u53c2\u8bae\u9662","__typename":"AppliedTranslationNode"},{"questionId":"650","title":"\u53ea\u6709\u4e24\u4e2a\u952e\u7684\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"651","title":"4\u952e\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"652","title":"\u5bfb\u627e\u91cd\u590d\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"653","title":"\u4e24\u6570\u4e4b\u548c IV - \u8f93\u5165 BST","__typename":"AppliedTranslationNode"},{"questionId":"654","title":"\u6700\u5927\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"655","title":"\u8f93\u51fa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"656","title":"\u91d1\u5e01\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"657","title":"\u673a\u5668\u4eba\u80fd\u5426\u8fd4\u56de\u539f\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"658","title":"\u627e\u5230 K \u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"659","title":"\u5206\u5272\u6570\u7ec4\u4e3a\u8fde\u7eed\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"660","title":"\u79fb\u9664 9","__typename":"AppliedTranslationNode"},{"questionId":"661","title":"\u56fe\u7247\u5e73\u6ed1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"662","title":"\u4e8c\u53c9\u6811\u6700\u5927\u5bbd\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"663","title":"\u5747\u5300\u6811\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"664","title":"\u5947\u602a\u7684\u6253\u5370\u673a","__typename":"AppliedTranslationNode"},{"questionId":"665","title":"\u975e\u9012\u51cf\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"666","title":"\u8def\u5f84\u603b\u548c IV","__typename":"AppliedTranslationNode"},{"questionId":"667","title":"\u4f18\u7f8e\u7684\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"668","title":"\u4e58\u6cd5\u8868\u4e2d\u7b2ck\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"669","title":"\u4fee\u526a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"670","title":"\u6700\u5927\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"671","title":"\u4e8c\u53c9\u6811\u4e2d\u7b2c\u4e8c\u5c0f\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"672","title":"\u706f\u6ce1\u5f00\u5173 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"673","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"674","title":"\u6700\u957f\u8fde\u7eed\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"675","title":"\u4e3a\u9ad8\u5c14\u592b\u6bd4\u8d5b\u780d\u6811","__typename":"AppliedTranslationNode"},{"questionId":"676","title":"\u5b9e\u73b0\u4e00\u4e2a\u9b54\u6cd5\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"677","title":"\u952e\u503c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"678","title":"\u6709\u6548\u7684\u62ec\u53f7\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"679","title":"24 \u70b9\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"680","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"681","title":"\u6700\u8fd1\u65f6\u523b","__typename":"AppliedTranslationNode"},{"questionId":"682","title":"\u68d2\u7403\u6bd4\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"683","title":"K \u4e2a\u5173\u95ed\u7684\u706f\u6ce1","__typename":"AppliedTranslationNode"},{"questionId":"684","title":"\u5197\u4f59\u8fde\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"685","title":"\u5197\u4f59\u8fde\u63a5 II","__typename":"AppliedTranslationNode"},{"questionId":"686","title":"\u91cd\u590d\u53e0\u52a0\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"687","title":"\u6700\u957f\u540c\u503c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"688","title":"\u201c\u9a6c\u201d\u5728\u68cb\u76d8\u4e0a\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"689","title":"\u4e09\u4e2a\u65e0\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"690","title":"\u5458\u5de5\u7684\u91cd\u8981\u6027","__typename":"AppliedTranslationNode"},{"questionId":"691","title":"\u8d34\u7eb8\u62fc\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"692","title":"\u524dK\u4e2a\u9ad8\u9891\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"693","title":"\u4ea4\u66ff\u4f4d\u4e8c\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"694","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"695","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"696","title":"\u8ba1\u6570\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"697","title":"\u6570\u7ec4\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"698","title":"\u5212\u5206\u4e3ak\u4e2a\u76f8\u7b49\u7684\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"699","title":"\u6389\u843d\u7684\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"711","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"712","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5c0fASCII\u5220\u9664\u548c","__typename":"AppliedTranslationNode"},{"questionId":"713","title":"\u4e58\u79ef\u5c0f\u4e8eK\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"714","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u624b\u7eed\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"715","title":"Range \u6a21\u5757","__typename":"AppliedTranslationNode"},{"questionId":"716","title":"\u6700\u5927\u6808","__typename":"AppliedTranslationNode"},{"questionId":"717","title":"1\u6bd4\u7279\u4e0e2\u6bd4\u7279\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"718","title":"\u6700\u957f\u91cd\u590d\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"719","title":"\u627e\u51fa\u7b2c k \u5c0f\u7684\u8ddd\u79bb\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"720","title":"\u8bcd\u5178\u4e2d\u6700\u957f\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"721","title":"\u8d26\u6237\u5408\u5e76","__typename":"AppliedTranslationNode"},{"questionId":"722","title":"\u5220\u9664\u6ce8\u91ca","__typename":"AppliedTranslationNode"},{"questionId":"723","title":"\u7c89\u788e\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"724","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u4e0b\u6807","__typename":"AppliedTranslationNode"},{"questionId":"725","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"726","title":"\u539f\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"727","title":"\u6700\u5c0f\u7a97\u53e3\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"728","title":"\u81ea\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"729","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 I","__typename":"AppliedTranslationNode"},{"questionId":"730","title":"\u7edf\u8ba1\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"731","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"732","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"733","title":"\u56fe\u50cf\u6e32\u67d3","__typename":"AppliedTranslationNode"},{"questionId":"734","title":"\u53e5\u5b50\u76f8\u4f3c\u6027","__typename":"AppliedTranslationNode"},{"questionId":"735","title":"\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"736","title":"Lisp \u8bed\u6cd5\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"737","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 II","__typename":"AppliedTranslationNode"},{"questionId":"738","title":"\u5355\u8c03\u9012\u589e\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"739","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"740","title":"\u5220\u9664\u5e76\u83b7\u5f97\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"741","title":"\u6458\u6a31\u6843","__typename":"AppliedTranslationNode"},{"questionId":"742","title":"\u8f6c\u6362\u6210\u5c0f\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"743","title":"\u4e8c\u53c9\u6811\u6700\u8fd1\u7684\u53f6\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"744","title":"\u7f51\u7edc\u5ef6\u8fdf\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"745","title":"\u5bfb\u627e\u6bd4\u76ee\u6807\u5b57\u6bcd\u5927\u7684\u6700\u5c0f\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"746","title":"\u524d\u7f00\u548c\u540e\u7f00\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"747","title":"\u4f7f\u7528\u6700\u5c0f\u82b1\u8d39\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"748","title":"\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"749","title":"\u6700\u77ed\u8865\u5168\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"750","title":"\u9694\u79bb\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"751","title":"\u89d2\u77e9\u5f62\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"752","title":"IP \u5230 CIDR","__typename":"AppliedTranslationNode"},{"questionId":"753","title":"\u6253\u5f00\u8f6c\u76d8\u9501","__typename":"AppliedTranslationNode"},{"questionId":"754","title":"\u7834\u89e3\u4fdd\u9669\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"755","title":"\u5230\u8fbe\u7ec8\u70b9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"756","title":"\u5012\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"757","title":"\u91d1\u5b57\u5854\u8f6c\u6362\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"758","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u5316\u4e3a\u6392\u5e8f\u7684\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"759","title":"\u8bbe\u7f6e\u4ea4\u96c6\u5927\u5c0f\u81f3\u5c11\u4e3a2","__typename":"AppliedTranslationNode"},{"questionId":"760","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u52a0\u7c97\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"761","title":"\u5458\u5de5\u7a7a\u95f2\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"762","title":"\u627e\u51fa\u53d8\u4f4d\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"763","title":"\u7279\u6b8a\u7684\u4e8c\u8fdb\u5236\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"764","title":"N \u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"765","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"766","title":"\u6241\u5e73\u5316\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"767","title":"\u4e8c\u8fdb\u5236\u8868\u793a\u4e2d\u8d28\u6570\u4e2a\u8ba1\u7b97\u7f6e\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"768","title":"\u5212\u5206\u5b57\u6bcd\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"769","title":"\u6700\u5927\u52a0\u53f7\u6807\u5fd7","__typename":"AppliedTranslationNode"},{"questionId":"770","title":"\u60c5\u4fa3\u7275\u624b","__typename":"AppliedTranslationNode"},{"questionId":"771","title":"\u5c06 N \u53c9\u6811\u7f16\u7801\u4e3a\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"772","title":"\u5efa\u7acb\u56db\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"773","title":"\u56db\u53c9\u6811\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"774","title":"N \u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"775","title":"N \u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"776","title":"N \u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"777","title":"\u6258\u666e\u5229\u8328\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"778","title":"\u91cd\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"779","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757 II","__typename":"AppliedTranslationNode"},{"questionId":"780","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757","__typename":"AppliedTranslationNode"},{"questionId":"781","title":"\u57fa\u672c\u8ba1\u7b97\u5668 IV","__typename":"AppliedTranslationNode"},{"questionId":"782","title":"\u5b9d\u77f3\u4e0e\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"783","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"784","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u63d2\u5165\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"785","title":"\u57fa\u672c\u8ba1\u7b97\u5668 III","__typename":"AppliedTranslationNode"},{"questionId":"786","title":"\u641c\u7d22\u957f\u5ea6\u672a\u77e5\u7684\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"787","title":"\u6ed1\u52a8\u8c1c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"788","title":"\u6700\u5c0f\u5316\u53bb\u52a0\u6cb9\u7ad9\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"789","title":"\u6570\u636e\u6d41\u4e2d\u7684\u7b2c K \u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"790","title":"\u5168\u5c40\u5012\u7f6e\u4e0e\u5c40\u90e8\u5012\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"791","title":"\u62c6\u5206\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"792","title":"\u4e8c\u5206\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"793","title":"\u5728LR\u5b57\u7b26\u4e32\u4e2d\u4ea4\u6362\u76f8\u90bb\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"794","title":"\u6c34\u4f4d\u4e0a\u5347\u7684\u6cf3\u6c60\u4e2d\u6e38\u6cf3","__typename":"AppliedTranslationNode"},{"questionId":"795","title":"\u7b2cK\u4e2a\u8bed\u6cd5\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"796","title":"\u5230\u8fbe\u7ec8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"797","title":"\u68ee\u6797\u4e2d\u7684\u5154\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"798","title":"\u53d8\u4e3a\u68cb\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"799","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8282\u70b9\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"800","title":"\u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"801","title":"\u5224\u65ad\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"802","title":"\u7b2c K \u4e2a\u6700\u5c0f\u7684\u7d20\u6570\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"803","title":"K \u7ad9\u4e2d\u8f6c\u5185\u6700\u4fbf\u5b9c\u7684\u822a\u73ed","__typename":"AppliedTranslationNode"},{"questionId":"804","title":"\u65cb\u8f6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"805","title":"\u9003\u8131\u963b\u788d\u8005","__typename":"AppliedTranslationNode"},{"questionId":"806","title":"\u591a\u7c73\u8bfa\u548c\u6258\u7c73\u8bfa\u5e73\u94fa","__typename":"AppliedTranslationNode"},{"questionId":"807","title":"\u81ea\u5b9a\u4e49\u5b57\u7b26\u4e32\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"808","title":"\u5339\u914d\u5b50\u5e8f\u5217\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"809","title":"\u9636\u4e58\u51fd\u6570\u540e K \u4e2a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"810","title":"\u6709\u6548\u7684\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"811","title":"\u533a\u95f4\u5b50\u6570\u7ec4\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"812","title":"\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"813","title":"\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"814","title":"\u5f97\u5206\u6700\u9ad8\u7684\u6700\u5c0f\u8f6e\u8c03","__typename":"AppliedTranslationNode"},{"questionId":"815","title":"\u9999\u69df\u5854","__typename":"AppliedTranslationNode"},{"questionId":"816","title":"\u8bbe\u8ba1\u54c8\u5e0c\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"817","title":"\u8bbe\u8ba1\u54c8\u5e0c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"818","title":"\u76f8\u4f3c RGB \u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"819","title":"\u4f7f\u5e8f\u5217\u9012\u589e\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"820","title":"\u627e\u5230\u6700\u7ec8\u7684\u5b89\u5168\u72b6\u6001","__typename":"AppliedTranslationNode"},{"questionId":"821","title":"\u6253\u7816\u5757","__typename":"AppliedTranslationNode"},{"questionId":"822","title":"\u552f\u4e00\u6469\u5c14\u65af\u5bc6\u7801\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"823","title":"\u6570\u7ec4\u7684\u5747\u503c\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"824","title":"\u5199\u5b57\u7b26\u4e32\u9700\u8981\u7684\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"825","title":"\u4fdd\u6301\u57ce\u5e02\u5929\u9645\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"826","title":"\u5206\u6c64","__typename":"AppliedTranslationNode"},{"questionId":"827","title":"\u60c5\u611f\u4e30\u5bcc\u7684\u6587\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"828","title":"\u9ed1\u677f\u5f02\u6216\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"829","title":"\u5b50\u57df\u540d\u8bbf\u95ee\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"830","title":"\u6700\u5927\u4e09\u89d2\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"831","title":"\u6700\u5927\u5e73\u5747\u503c\u548c\u7684\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"832","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"833","title":"\u516c\u4ea4\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"834","title":"\u6a21\u7cca\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"835","title":"\u94fe\u8868\u7ec4\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"836","title":"\u8d5b\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"837","title":"\u6700\u5e38\u89c1\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"838","title":"\u8bbe\u8ba1\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"839","title":"\u5355\u8bcd\u7684\u538b\u7f29\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"841","title":"\u5b57\u7b26\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"842","title":"\u7ffb\u8f6c\u5361\u7247\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"843","title":"\u5e26\u56e0\u5b50\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"850","title":"\u5faa\u73af\u6709\u5e8f\u5217\u8868\u7684\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"851","title":"\u5c71\u7f8a\u62c9\u4e01\u6587","__typename":"AppliedTranslationNode"},{"questionId":"852","title":"\u9002\u9f84\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"853","title":"\u5b89\u6392\u5de5\u4f5c\u4ee5\u8fbe\u5230\u6700\u5927\u6536\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"854","title":"\u6700\u5927\u4eba\u5de5\u5c9b","__typename":"AppliedTranslationNode"},{"questionId":"855","title":"\u7edf\u8ba1\u5b50\u4e32\u4e2d\u7684\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"856","title":"\u8fde\u7eed\u6574\u6570\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"857","title":"\u8f83\u5927\u5206\u7ec4\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"858","title":"\u9690\u85cf\u4e2a\u4eba\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"859","title":"\u8bbe\u8ba1\u5faa\u73af\u53cc\u7aef\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"860","title":"\u8bbe\u8ba1\u5faa\u73af\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"861","title":"\u7ffb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"862","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u67e5\u627e\u4e0e\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"863","title":"\u6811\u4e2d\u8ddd\u79bb\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"864","title":"\u56fe\u50cf\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"865","title":"\u626b\u5730\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"866","title":"\u77e9\u5f62\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"867","title":"\u65b021\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"868","title":"\u63a8\u591a\u7c73\u8bfa","__typename":"AppliedTranslationNode"},{"questionId":"869","title":"\u76f8\u4f3c\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"870","title":"\u77e9\u9635\u4e2d\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"871","title":"\u94a5\u5319\u548c\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"872","title":"\u5c06\u6570\u7ec4\u62c6\u5206\u6210\u6590\u6ce2\u90a3\u5951\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"873","title":"\u731c\u731c\u8fd9\u4e2a\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"874","title":"\u6bd4\u8f83\u542b\u9000\u683c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"875","title":"\u6570\u7ec4\u4e2d\u7684\u6700\u957f\u5c71\u8109","__typename":"AppliedTranslationNode"},{"questionId":"876","title":"\u4e00\u624b\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"877","title":"\u8bbf\u95ee\u6240\u6709\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"878","title":"\u5b57\u6bcd\u79fb\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"879","title":"\u5230\u6700\u8fd1\u7684\u4eba\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"880","title":"\u77e9\u5f62\u9762\u79ef II","__typename":"AppliedTranslationNode"},{"questionId":"881","title":"\u55a7\u95f9\u548c\u5bcc\u6709","__typename":"AppliedTranslationNode"},{"questionId":"882","title":"\u5c71\u8109\u6570\u7ec4\u7684\u5cf0\u9876\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"883","title":"\u8f66\u961f","__typename":"AppliedTranslationNode"},{"questionId":"884","title":"\u76f8\u4f3c\u5ea6\u4e3a K \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"885","title":"\u8003\u573a\u5c31\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"886","title":"\u62ec\u53f7\u7684\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"887","title":"\u96c7\u4f63 K \u540d\u5de5\u4eba\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"888","title":"\u955c\u9762\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"889","title":"\u4eb2\u5bc6\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"890","title":"\u67e0\u6aac\u6c34\u627e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"891","title":"\u7ffb\u8f6c\u77e9\u9635\u540e\u7684\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"892","title":"\u548c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"893","title":"\u4e8c\u53c9\u6811\u4e2d\u6240\u6709\u8ddd\u79bb\u4e3a K \u7684\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"894","title":"\u9ed1\u540d\u5355\u4e2d\u7684\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"895","title":"\u83b7\u53d6\u6240\u6709\u94a5\u5319\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"896","title":"\u5177\u6709\u6240\u6709\u6700\u6df1\u8282\u70b9\u7684\u6700\u5c0f\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"897","title":"\u56de\u6587\u7d20\u6570","__typename":"AppliedTranslationNode"},{"questionId":"898","title":"\u8f6c\u7f6e\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"899","title":"\u4e8c\u8fdb\u5236\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"900","title":"\u91cd\u65b0\u6392\u5e8f\u5f97\u5230 2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"901","title":"\u4f18\u52bf\u6d17\u724c","__typename":"AppliedTranslationNode"},{"questionId":"902","title":"\u6700\u4f4e\u52a0\u6cb9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"903","title":"\u7528 Rand7() \u5b9e\u73b0 Rand10()","__typename":"AppliedTranslationNode"},{"questionId":"904","title":"\u53f6\u5b50\u76f8\u4f3c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"905","title":"\u6700\u957f\u7684\u6590\u6ce2\u90a3\u5951\u5b50\u5e8f\u5217\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"906","title":"\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"907","title":"\u7231\u5403\u9999\u8549\u7684\u73c2\u73c2","__typename":"AppliedTranslationNode"},{"questionId":"908","title":"\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"909","title":"\u77f3\u5b50\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"910","title":"\u7b2c N \u4e2a\u795e\u5947\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"911","title":"\u76c8\u5229\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"912","title":"\u6309\u6743\u91cd\u968f\u673a\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"913","title":"\u968f\u673a\u7ffb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"914","title":"\u975e\u91cd\u53e0\u77e9\u5f62\u4e2d\u7684\u968f\u673a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"915","title":"\u5728\u5706\u5185\u968f\u673a\u751f\u6210\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"916","title":"\u7d22\u5f15\u5904\u7684\u89e3\u7801\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"917","title":"\u6551\u751f\u8247","__typename":"AppliedTranslationNode"},{"questionId":"918","title":"\u7ec6\u5206\u56fe\u4e2d\u7684\u53ef\u5230\u8fbe\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"919","title":"\u4e09\u7ef4\u5f62\u4f53\u6295\u5f71\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"920","title":"\u4e24\u53e5\u8bdd\u4e2d\u7684\u4e0d\u5e38\u89c1\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"921","title":"\u87ba\u65cb\u77e9\u9635 III","__typename":"AppliedTranslationNode"},{"questionId":"922","title":"\u53ef\u80fd\u7684\u4e8c\u5206\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"923","title":"\u9e21\u86cb\u6389\u843d","__typename":"AppliedTranslationNode"},{"questionId":"924","title":"\u516c\u5e73\u7684\u7cd6\u679c\u68d2\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"925","title":"\u6839\u636e\u524d\u5e8f\u548c\u540e\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"926","title":"\u67e5\u627e\u548c\u66ff\u6362\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"927","title":"\u5b50\u5e8f\u5217\u5bbd\u5ea6\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"928","title":"\u4e09\u7ef4\u5f62\u4f53\u7684\u8868\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"929","title":"\u7279\u6b8a\u7b49\u4ef7\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"930","title":"\u6240\u6709\u53ef\u80fd\u7684\u6ee1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"931","title":"\u6700\u5927\u9891\u7387\u6808","__typename":"AppliedTranslationNode"},{"questionId":"932","title":"\u5355\u8c03\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"933","title":"\u9012\u589e\u987a\u5e8f\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"934","title":"\u5b50\u6570\u7ec4\u6309\u4f4d\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"935","title":"\u6709\u5e8f\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"936","title":"RLE \u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"937","title":"\u80a1\u7968\u4ef7\u683c\u8de8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"938","title":"\u6700\u5927\u4e3a N \u7684\u6570\u5b57\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"939","title":"DI \u5e8f\u5217\u7684\u6709\u6548\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"940","title":"\u6c34\u679c\u6210\u7bee","__typename":"AppliedTranslationNode"},{"questionId":"941","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"942","title":"\u8d85\u7ea7\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"943","title":"\u5b50\u6570\u7ec4\u7684\u6700\u5c0f\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"944","title":"\u6700\u5c0f\u5dee\u503c I","__typename":"AppliedTranslationNode"},{"questionId":"945","title":"\u86c7\u68af\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"946","title":"\u6700\u5c0f\u5dee\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"947","title":"\u5728\u7ebf\u9009\u4e3e","__typename":"AppliedTranslationNode"},{"questionId":"948","title":"\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"949","title":"\u732b\u548c\u8001\u9f20","__typename":"AppliedTranslationNode"},{"questionId":"950","title":"\u5361\u724c\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"951","title":"\u5206\u5272\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"952","title":"\u5355\u8bcd\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"953","title":"\u4ec5\u4ec5\u53cd\u8f6c\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"954","title":"\u73af\u5f62\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"955","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u63d2\u5165\u5668","__typename":"AppliedTranslationNode"},{"questionId":"956","title":"\u64ad\u653e\u5217\u8868\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"957","title":"\u4f7f\u62ec\u53f7\u6709\u6548\u7684\u6700\u5c11\u6dfb\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"958","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"959","title":"\u4e09\u6570\u4e4b\u548c\u7684\u591a\u79cd\u53ef\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"960","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad","__typename":"AppliedTranslationNode"},{"questionId":"961","title":"\u957f\u6309\u952e\u5165","__typename":"AppliedTranslationNode"},{"questionId":"962","title":"\u5c06\u5b57\u7b26\u4e32\u7ffb\u8f6c\u5230\u5355\u8c03\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"963","title":"\u4e09\u7b49\u5206","__typename":"AppliedTranslationNode"},{"questionId":"964","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad II","__typename":"AppliedTranslationNode"},{"questionId":"965","title":"\u72ec\u7279\u7684\u7535\u5b50\u90ae\u4ef6\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"966","title":"\u548c\u76f8\u540c\u7684\u4e8c\u5143\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"967","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"968","title":"\u6f02\u4eae\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"969","title":"\u6700\u8fd1\u7684\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"971","title":"\u6700\u77ed\u7684\u6865","__typename":"AppliedTranslationNode"},{"questionId":"972","title":"\u9a91\u58eb\u62e8\u53f7\u5668","__typename":"AppliedTranslationNode"},{"questionId":"973","title":"\u6233\u5370\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"974","title":"\u91cd\u65b0\u6392\u5217\u65e5\u5fd7\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"975","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u8303\u56f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"976","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"977","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"978","title":"\u6709\u6548\u7684\u5c71\u8109\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"979","title":"\u589e\u51cf\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"980","title":"\u6700\u77ed\u8d85\u7ea7\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"981","title":"\u5220\u5217\u9020\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"982","title":"\u4f7f\u6570\u7ec4\u552f\u4e00\u7684\u6700\u5c0f\u589e\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"983","title":"\u9a8c\u8bc1\u6808\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"984","title":"\u79fb\u9664\u6700\u591a\u7684\u540c\u884c\u6216\u540c\u5217\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"985","title":"\u4ee4\u724c\u653e\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"986","title":"\u7ed9\u5b9a\u6570\u5b57\u80fd\u7ec4\u6210\u7684\u6700\u5927\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"987","title":"\u6309\u9012\u589e\u987a\u5e8f\u663e\u793a\u5361\u724c","__typename":"AppliedTranslationNode"},{"questionId":"988","title":"\u7ffb\u8f6c\u7b49\u4ef7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"989","title":"\u6309\u516c\u56e0\u6570\u8ba1\u7b97\u6700\u5927\u7ec4\u4ef6\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"990","title":"\u9a8c\u8bc1\u5916\u661f\u8bed\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"991","title":"\u4e8c\u500d\u6570\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"992","title":"\u5220\u5217\u9020\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"993","title":"\u6700\u9ad8\u7684\u5e7f\u544a\u724c","__typename":"AppliedTranslationNode"},{"questionId":"994","title":"N \u5929\u540e\u7684\u7262\u623f","__typename":"AppliedTranslationNode"},{"questionId":"998","title":"\u4e8c\u53c9\u6811\u7684\u5b8c\u5168\u6027\u68c0\u9a8c","__typename":"AppliedTranslationNode"},{"questionId":"999","title":"\u7531\u659c\u6760\u5212\u5206\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1000","title":"\u5220\u5217\u9020\u5e8f III","__typename":"AppliedTranslationNode"},{"questionId":"1001","title":"\u91cd\u590d N \u6b21\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1002","title":"\u6700\u5927\u5bbd\u5ea6\u5761","__typename":"AppliedTranslationNode"},{"questionId":"1003","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62 II","__typename":"AppliedTranslationNode"},{"questionId":"1004","title":"\u8868\u793a\u6570\u5b57\u7684\u6700\u5c11\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1005","title":"\u5355\u503c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1006","title":"\u5143\u97f3\u62fc\u5199\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1007","title":"\u8fde\u7eed\u5dee\u76f8\u540c\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1008","title":"\u76d1\u63a7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1009","title":"\u714e\u997c\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1010","title":"\u5f3a\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1011","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811\u4ee5\u5339\u914d\u5148\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1012","title":"\u76f8\u7b49\u7684\u6709\u7406\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1013","title":"\u6590\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1014","title":"\u6700\u63a5\u8fd1\u539f\u70b9\u7684 K \u4e2a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1016","title":"\u548c\u53ef\u88ab K \u6574\u9664\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1017","title":"\u5947\u5076\u8df3","__typename":"AppliedTranslationNode"},{"questionId":"1018","title":"\u4e09\u89d2\u5f62\u7684\u6700\u5927\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1019","title":"\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1020","title":"\u6700\u957f\u6e4d\u6d41\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1021","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u5206\u914d\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1022","title":"\u4e0d\u540c\u8def\u5f84 III","__typename":"AppliedTranslationNode"},{"questionId":"1023","title":"\u57fa\u4e8e\u65f6\u95f4\u7684\u952e\u503c\u5b58\u50a8","__typename":"AppliedTranslationNode"},{"questionId":"1024","title":"\u6309\u4f4d\u4e0e\u4e3a\u96f6\u7684\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1025","title":"\u6700\u4f4e\u7968\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1026","title":"\u4e0d\u542b AAA \u6216 BBB \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1027","title":"\u67e5\u8be2\u540e\u7684\u5076\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1028","title":"\u533a\u95f4\u5217\u8868\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1029","title":"\u4e8c\u53c9\u6811\u7684\u5782\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1030","title":"\u4ece\u53f6\u7ed3\u70b9\u5f00\u59cb\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1031","title":"\u6570\u7ec4\u5f62\u5f0f\u7684\u6574\u6570\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1032","title":"\u7b49\u5f0f\u65b9\u7a0b\u7684\u53ef\u6ee1\u8db3\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1033","title":"\u574f\u4e86\u7684\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1034","title":"K \u4e2a\u4e0d\u540c\u6574\u6570\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1035","title":"\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1036","title":"\u8150\u70c2\u7684\u6a58\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1037","title":"K \u8fde\u7eed\u4f4d\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1038","title":"\u6b63\u65b9\u5f62\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1039","title":"\u627e\u5230\u5c0f\u9547\u7684\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1040","title":"\u6700\u5927\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"1041","title":"\u53ef\u4ee5\u88ab\u4e00\u6b65\u6355\u83b7\u7684\u68cb\u5b50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1042","title":"\u5408\u5e76\u77f3\u5934\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1043","title":"\u7f51\u683c\u7167\u660e","__typename":"AppliedTranslationNode"},{"questionId":"1044","title":"\u67e5\u627e\u5171\u7528\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1045","title":"\u68c0\u67e5\u66ff\u6362\u540e\u7684\u8bcd\u662f\u5426\u6709\u6548","__typename":"AppliedTranslationNode"},{"questionId":"1046","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1047","title":"K \u6b21\u53d6\u53cd\u540e\u6700\u5927\u5316\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1048","title":"\u7b28\u9636\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"1049","title":"\u884c\u76f8\u7b49\u7684\u6700\u5c11\u591a\u7c73\u8bfa\u65cb\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"1050","title":"\u524d\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1051","title":"\u5f62\u6210\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1052","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1053","title":"\u6700\u5c0f\u5316\u820d\u5165\u8bef\u5dee\u4ee5\u6ee1\u8db3\u76ee\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1054","title":"\u5341\u8fdb\u5236\u6574\u6570\u7684\u53cd\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1055","title":"\u603b\u6301\u7eed\u65f6\u95f4\u53ef\u88ab 60 \u6574\u9664\u7684\u6b4c\u66f2","__typename":"AppliedTranslationNode"},{"questionId":"1056","title":"\u5728 D \u5929\u5185\u9001\u8fbe\u5305\u88f9\u7684\u80fd\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1057","title":"\u81f3\u5c11\u6709 1 \u4f4d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1058","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5217\u6700\u5c0f\u7684\u7b49\u6548\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1059","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7f3a\u5931\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1060","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1061","title":"\u6709\u6548\u5b50\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1062","title":"\u5c06\u6570\u7ec4\u5206\u6210\u548c\u76f8\u7b49\u7684\u4e09\u4e2a\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1063","title":"\u6700\u4f73\u89c2\u5149\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1064","title":"\u53ef\u88ab K \u6574\u9664\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1065","title":"\u5b50\u4e32\u80fd\u8868\u793a\u4ece 1 \u5230 N \u6570\u5b57\u7684\u4e8c\u8fdb\u5236\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1066","title":"\u4e0d\u52a8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1067","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d II","__typename":"AppliedTranslationNode"},{"questionId":"1068","title":"\u8303\u56f4\u5185\u7684\u6570\u5b57\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1069","title":"\u6613\u6df7\u6dc6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1070","title":"\u8d1f\u4e8c\u8fdb\u5236\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1071","title":"\u53ef\u88ab 5 \u6574\u9664\u7684\u4e8c\u8fdb\u5236\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1072","title":"\u94fe\u8868\u4e2d\u7684\u4e0b\u4e00\u4e2a\u66f4\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1073","title":"\u98de\u5730\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1074","title":"\u524d\u4e94\u79d1\u7684\u5747\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1075","title":"\u5b57\u7b26\u4e32\u7684\u7d22\u5f15\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1076","title":"\u82b1\u62ec\u53f7\u5c55\u5f00","__typename":"AppliedTranslationNode"},{"questionId":"1077","title":"\u6613\u6df7\u6dc6\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"1078","title":"\u5220\u9664\u6700\u5916\u5c42\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1079","title":"\u4ece\u6839\u5230\u53f6\u7684\u4e8c\u8fdb\u5236\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1080","title":"\u9a7c\u5cf0\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1081","title":"\u89c6\u9891\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1082","title":"\u6700\u5c0f\u5143\u7d20\u5404\u6570\u4f4d\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1083","title":"\u5c0f\u4e8e K \u7684\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1084","title":"\u957f\u5ea6\u4e3a K \u7684\u65e0\u91cd\u590d\u5b57\u7b26\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1085","title":"\u5f7c\u6b64\u719f\u8bc6\u7684\u6700\u65e9\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1086","title":"\u9664\u6570\u535a\u5f08","__typename":"AppliedTranslationNode"},{"questionId":"1087","title":"\u6700\u957f\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1088","title":"\u4e00\u6708\u6709\u591a\u5c11\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1089","title":"\u5220\u53bb\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3","__typename":"AppliedTranslationNode"},{"questionId":"1090","title":"\u963f\u59c6\u65af\u7279\u6717\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1091","title":"\u5b50\u6811\u7684\u6700\u5927\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1092","title":"\u8282\u70b9\u4e0e\u5176\u7956\u5148\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1093","title":"\u4ece\u5148\u5e8f\u904d\u5386\u8fd8\u539f\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1094","title":"\u8ddd\u79bb\u987a\u5e8f\u6392\u5217\u77e9\u9635\u5355\u5143\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1095","title":"\u4e24\u5730\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1096","title":"\u4e24\u4e2a\u975e\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1097","title":"\u5b57\u7b26\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1098","title":"\u6700\u5927\u552f\u4e00\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1099","title":"\u5f97\u5206\u6700\u9ad8\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1100","title":"\u6700\u4f4e\u6210\u672c\u8054\u901a\u6240\u6709\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1101","title":"\u5e73\u884c\u8bfe\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1102","title":"\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u5728\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1103","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed","__typename":"AppliedTranslationNode"},{"questionId":"1104","title":"\u8fb9\u6846\u7740\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1105","title":"\u4e0d\u76f8\u4ea4\u7684\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1106","title":"\u9003\u79bb\u5927\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1107","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1","__typename":"AppliedTranslationNode"},{"questionId":"1108","title":"\u7528\u6237\u7f51\u7ad9\u8bbf\u95ee\u884c\u4e3a\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1110","title":"\u516c\u8def\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1111","title":"\u591a\u8fb9\u5f62\u4e09\u89d2\u5256\u5206\u7684\u6700\u4f4e\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1112","title":"\u62fc\u5199\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1113","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed II","__typename":"AppliedTranslationNode"},{"questionId":"1114","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1115","title":"\u6709\u6548\u7684\u56de\u65cb\u9556","__typename":"AppliedTranslationNode"},{"questionId":"1116","title":"\u6700\u5927\u5c42\u5185\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1117","title":"\u5730\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1118","title":"\u5c06\u6570\u7ec4\u5206\u6210\u51e0\u4e2a\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1119","title":"\u56f0\u4e8e\u73af\u4e2d\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1120","title":"\u4e0d\u90bb\u63a5\u690d\u82b1","__typename":"AppliedTranslationNode"},{"questionId":"1121","title":"\u5206\u9694\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1122","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1123","title":"\u5355\u884c\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1124","title":"\u5b57\u7b26\u4e32\u8f6c\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1125","title":"\u8bbe\u8ba1\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1126","title":"\u8fde\u63a5\u68d2\u6750\u7684\u6700\u4f4e\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1127","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1128","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"1129","title":"\u6700\u957f\u5b57\u7b26\u4e32\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"1130","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"1131","title":"\u7edf\u8ba1\u53ea\u542b\u5355\u4e00\u5b57\u6bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1132","title":"\u524d\u540e\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1133","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5728\u6700\u540e\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1134","title":"\u4e0e\u76ee\u6807\u989c\u8272\u95f4\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1135","title":"\u4e70\u4e0b\u6240\u6709\u4ea7\u54c1\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1136","title":"\u5408\u4f5c\u8fc7\u81f3\u5c11\u4e09\u6b21\u7684\u6f14\u5458\u548c\u5bfc\u6f14","__typename":"AppliedTranslationNode"},{"questionId":"1137","title":"\u9ad8\u5ea6\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1138","title":"\u7231\u751f\u6c14\u7684\u4e66\u5e97\u8001\u677f","__typename":"AppliedTranslationNode"},{"questionId":"1139","title":"\u4ea4\u6362\u4e00\u6b21\u7684\u5148\u524d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1140","title":"\u8ddd\u79bb\u76f8\u7b49\u7684\u6761\u5f62\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1141","title":"\u6700\u591a\u53ef\u4ee5\u4e70\u5230\u7684\u82f9\u679c\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1142","title":"\u8fdb\u51fb\u7684\u9a91\u58eb","__typename":"AppliedTranslationNode"},{"questionId":"1143","title":"\u627e\u51fa\u6240\u6709\u884c\u4e2d\u6700\u5c0f\u516c\u5171\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1144","title":"\u6c34\u8d44\u6e90\u5206\u914d\u4f18\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1145","title":"\u5143\u7d20\u548c\u4e3a\u76ee\u6807\u503c\u7684\u5b50\u77e9\u9635\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1146","title":"\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1147","title":"\u6309\u5217\u7ffb\u8f6c\u5f97\u5230\u6700\u5927\u503c\u7b49\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1148","title":"\u8d1f\u4e8c\u8fdb\u5236\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1149","title":"\u4e09\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1150","title":"\u67e5\u627e\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1151","title":"\u6b65\u8fdb\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1152","title":"\u77e9\u9635\u4e2d 1 \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1153","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1154","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1155","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1156","title":"Bigram \u5206\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1157","title":"\u6839\u5230\u53f6\u8def\u5f84\u4e0a\u7684\u4e0d\u8db3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1159","title":"\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1160","title":"\u6d3b\u5b57\u5370\u5237","__typename":"AppliedTranslationNode"},{"questionId":"1161","title":"\u9879\u76ee\u5458\u5de5 I","__typename":"AppliedTranslationNode"},{"questionId":"1162","title":"\u9879\u76ee\u5458\u5de5II","__typename":"AppliedTranslationNode"},{"questionId":"1163","title":"\u9879\u76ee\u5458\u5de5 III","__typename":"AppliedTranslationNode"},{"questionId":"1164","title":"\u7b49\u5dee\u6570\u5217\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1165","title":"\u5b89\u6392\u4f1a\u8bae\u65e5\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1166","title":"\u629b\u63b7\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1167","title":"\u5efa\u9020\u8857\u533a\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1168","title":"\u590d\u5199\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1169","title":"\u53d7\u6807\u7b7e\u5f71\u54cd\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1170","title":"\u6700\u77ed\u516c\u5171\u8d85\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1171","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1172","title":"\u9500\u552e\u5206\u6790 I ","__typename":"AppliedTranslationNode"},{"questionId":"1173","title":"\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1174","title":"\u9500\u552e\u5206\u6790III","__typename":"AppliedTranslationNode"},{"questionId":"1175","title":"\u6570\u7ec4\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1176","title":"\u529b\u6263\u6392\u884c\u699c","__typename":"AppliedTranslationNode"},{"questionId":"1177","title":"\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1178","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1179","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1180","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1181","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1182","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 IV","__typename":"AppliedTranslationNode"},{"questionId":"1183","title":"\u5927\u6837\u672c\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1184","title":"\u62fc\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"1185","title":"\u5c71\u8109\u6570\u7ec4\u4e2d\u67e5\u627e\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1186","title":"H2O \u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"1187","title":"\u4ea4\u66ff\u6253\u5370FooBar","__typename":"AppliedTranslationNode"},{"questionId":"1188","title":"\u82b1\u62ec\u53f7\u5c55\u5f00 II","__typename":"AppliedTranslationNode"},{"questionId":"1189","title":"\u52a0\u5bc6\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1190","title":"\u6700\u5c0f\u516c\u5171\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1191","title":"\u8fd1\u4e49\u8bcd\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1192","title":"\u5206\u4eab\u5de7\u514b\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1193","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 V","__typename":"AppliedTranslationNode"},{"questionId":"1194","title":"\u4e8c\u53c9\u6811\u5bfb\u8def","__typename":"AppliedTranslationNode"},{"questionId":"1195","title":"\u5206\u7cd6\u679c II","__typename":"AppliedTranslationNode"},{"questionId":"1196","title":"\u586b\u5145\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1197","title":"\u89e3\u6790\u5e03\u5c14\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1198","title":"\u5c0f\u4f17\u4e66\u7c4d","__typename":"AppliedTranslationNode"},{"questionId":"1199","title":"\u5341\u516d\u8fdb\u5236\u9b54\u672f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1200","title":"\u5220\u9664\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1201","title":"\u5220\u9664\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1202","title":"\u5220\u9664\u56de\u6587\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1203","title":"\u6309\u5e8f\u6253\u5370","__typename":"AppliedTranslationNode"},{"questionId":"1204","title":"\u6bcf\u65e5\u65b0\u7528\u6237\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1205","title":"IP \u5730\u5740\u65e0\u6548\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1206","title":"\u822a\u73ed\u9884\u8ba2\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1207","title":"\u5220\u70b9\u6210\u6797","__typename":"AppliedTranslationNode"},{"questionId":"1208","title":"\u6709\u6548\u62ec\u53f7\u7684\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1209","title":"\u8bbe\u8ba1\u6709\u9650\u963b\u585e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1210","title":"\u5220\u9664\u67d0\u4e9b\u5143\u7d20\u540e\u7684\u6570\u7ec4\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1211","title":"\u5b57\u6bcd\u7ec4\u5408\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1212","title":"\u987a\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1213","title":"\u4e0d\u76f8\u4ea4\u7684\u63e1\u624b","__typename":"AppliedTranslationNode"},{"questionId":"1214","title":"\u6bcf\u4f4d\u5b66\u751f\u7684\u6700\u9ad8\u6210\u7ee9","__typename":"AppliedTranslationNode"},{"questionId":"1215","title":"\u62a5\u544a\u7684\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1216","title":"\u6253\u5370\u96f6\u4e0e\u5947\u5076\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1217","title":"\u6570\u7ec4\u7684\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1218","title":"\u6700\u6df1\u53f6\u8282\u70b9\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1219","title":"\u8868\u73b0\u826f\u597d\u7684\u6700\u957f\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1220","title":"\u6700\u5c0f\u7684\u5fc5\u8981\u56e2\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1221","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc725%\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1222","title":"\u5220\u9664\u88ab\u8986\u76d6\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1223","title":"\u5e26\u9608\u503c\u7684\u56fe\u8fde\u901a\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1224","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"1225","title":"\u67e5\u8be2\u6d3b\u8dc3\u4e1a\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1226","title":"\u7528\u6237\u8d2d\u4e70\u5e73\u53f0","__typename":"AppliedTranslationNode"},{"questionId":"1227","title":"\u7b49\u4ef7\u591a\u7c73\u8bfa\u9aa8\u724c\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1228","title":"\u53f6\u503c\u7684\u6700\u5c0f\u4ee3\u4ef7\u751f\u6210\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1229","title":"\u989c\u8272\u4ea4\u66ff\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1230","title":"\u7edd\u5bf9\u503c\u8868\u8fbe\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1231","title":"\u5c06\u6bcf\u4e2a\u5143\u7d20\u66ff\u6362\u4e3a\u53f3\u4fa7\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1232","title":"\u8f6c\u53d8\u6570\u7ec4\u540e\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1233","title":"\u77e9\u5f62\u5185\u8239\u53ea\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1234","title":"\u6700\u5927\u5f97\u5206\u7684\u8def\u5f84\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1236","title":"\u7b2c N \u4e2a\u6cf0\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1237","title":"\u62a5\u544a\u7684\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"1238","title":"\u5b57\u6bcd\u677f\u4e0a\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1239","title":"\u6700\u5927\u7684\u4ee5 1 \u4e3a\u8fb9\u754c\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1240","title":"\u77f3\u5b50\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"1241","title":"\u89e3\u538b\u7f29\u7f16\u7801\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1242","title":"\u77e9\u9635\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1243","title":"\u7956\u7236\u8282\u70b9\u503c\u4e3a\u5076\u6570\u7684\u8282\u70b9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1244","title":"\u4e0d\u540c\u7684\u5faa\u73af\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1245","title":"\u67e5\u8be2\u8fd130\u5929\u6d3b\u8dc3\u7528\u6237\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1246","title":"\u8fc7\u53bb30\u5929\u7684\u7528\u6237\u6d3b\u52a8 II","__typename":"AppliedTranslationNode"},{"questionId":"1247","title":"\u9012\u51cf\u5143\u7d20\u4f7f\u6570\u7ec4\u5448\u952f\u9f7f\u72b6","__typename":"AppliedTranslationNode"},{"questionId":"1248","title":"\u4e8c\u53c9\u6811\u7740\u8272\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1249","title":"\u5feb\u7167\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1250","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1251","title":"\u6bb5\u5f0f\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1252","title":"\u7834\u574f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1253","title":"\u5c06\u77e9\u9635\u6309\u5bf9\u89d2\u7ebf\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1254","title":"\u5c42\u6570\u6700\u6df1\u53f6\u5b50\u8282\u70b9\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1255","title":"\u7ffb\u8f6c\u5b50\u6570\u7ec4\u5f97\u5230\u6700\u5927\u7684\u6570\u7ec4\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1256","title":"\u6570\u7ec4\u5e8f\u53f7\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1257","title":"\u77e9\u9635\u8f6c\u6362\u540e\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1258","title":"\u6587\u7ae0\u6d4f\u89c8 I","__typename":"AppliedTranslationNode"},{"questionId":"1259","title":"\u6587\u7ae0\u6d4f\u89c8 II","__typename":"AppliedTranslationNode"},{"questionId":"1260","title":"\u4e00\u5e74\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1261","title":"\u5355\u5b57\u7b26\u91cd\u590d\u5b50\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1262","title":"\u5b50\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1263","title":"\u63b7\u9ab0\u5b50\u7684N\u79cd\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1264","title":"\u53ef\u4ee5\u8f93\u5165\u7684\u6700\u5927\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1267","title":"\u4ece\u94fe\u8868\u4e2d\u5220\u53bb\u603b\u548c\u503c\u4e3a\u96f6\u7684\u8fde\u7eed\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1268","title":"\u5e02\u573a\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1269","title":"\u5e02\u573a\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1270","title":"\u9910\u76d8\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1271","title":"\u7f51\u7edc\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1272","title":"\u67e5\u8be2\u65e0\u6548\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1273","title":"\u6bd4\u8f83\u5b57\u7b26\u4e32\u6700\u5c0f\u5b57\u6bcd\u51fa\u73b0\u9891\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"1274","title":"\u65e5\u671f\u4e4b\u95f4\u9694\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1275","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1276","title":"\u6700\u63a5\u8fd1\u7684\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1277","title":"\u5f62\u6210\u4e09\u7684\u6700\u5927\u500d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1278","title":"\u6307\u5b9a\u65e5\u671f\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1279","title":"\u8d28\u6570\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1280","title":"\u5065\u8eab\u8ba1\u5212\u8bc4\u4f30","__typename":"AppliedTranslationNode"},{"questionId":"1281","title":"\u6784\u5efa\u56de\u6587\u4e32\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"1282","title":"\u731c\u5b57\u8c1c","__typename":"AppliedTranslationNode"},{"questionId":"1283","title":"\u8f6c\u53d8\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1284","title":"\u56db\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1285","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u53d8\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"1286","title":"\u5e26\u9650\u5236\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1287","title":"\u516c\u4ea4\u7ad9\u95f4\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1288","title":"\u5220\u9664\u4e00\u6b21\u5f97\u5230\u5b50\u6570\u7ec4\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1289","title":"\u4e00\u5468\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1290","title":"\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1291","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 I","__typename":"AppliedTranslationNode"},{"questionId":"1292","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 II","__typename":"AppliedTranslationNode"},{"questionId":"1293","title":"\u5b58\u5728\u8fde\u7eed\u4e09\u4e2a\u5947\u6570\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1295","title":"\u6536\u96c6\u8db3\u591f\u82f9\u679c\u7684\u6700\u5c0f\u82b1\u56ed\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1296","title":"\u6811\u8282\u70b9\u7684\u7b2c K \u4e2a\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1297","title":"\u201c\u6c14\u7403\u201d \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1298","title":"\u53cd\u8f6c\u6bcf\u5bf9\u62ec\u53f7\u95f4\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1299","title":"K \u6b21\u4e32\u8054\u540e\u6700\u5927\u5b50\u6570\u7ec4\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1300","title":"\u67e5\u627e\u96c6\u7fa4\u5185\u7684\u300c\u5173\u952e\u8fde\u63a5\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1301","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u90e8\u95e8\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1302","title":"\u5220\u9664\u5b57\u7b26\u4f7f\u5b57\u7b26\u4e32\u53d8\u597d","__typename":"AppliedTranslationNode"},{"questionId":"1304","title":"\u6700\u957f\u5feb\u4e50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1305","title":"\u961f\u5217\u4e2d\u53ef\u4ee5\u770b\u5230\u7684\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1306","title":"\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1307","title":"\u4e11\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1308","title":"\u4ea4\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1309","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1311","title":"\u6700\u5927\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1313","title":"\u7edf\u8ba1\u4e3a\u8681\u7fa4\u6784\u7b51\u623f\u95f4\u7684\u4e0d\u540c\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1316","title":"\u4ea4\u66ff\u6253\u5370\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1317","title":"\u6bcf\u6708\u4ea4\u6613 I","__typename":"AppliedTranslationNode"},{"questionId":"1318","title":"\u9526\u6807\u8d5b\u4f18\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1319","title":"\u72ec\u4e00\u65e0\u4e8c\u7684\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1320","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"1321","title":"\u5c3d\u53ef\u80fd\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1322","title":"\u7a7f\u8fc7\u8ff7\u5bab\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1324","title":"\u7403\u4f1a\u843d\u4f55\u5904","__typename":"AppliedTranslationNode"},{"questionId":"1325","title":"\u6982\u7387\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1326","title":"\u5411\u4e0b\u53d6\u6574\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1327","title":"\u6700\u540e\u4e00\u4e2a\u80fd\u8fdb\u5165\u7535\u68af\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1328","title":"\u6bcf\u6708\u4ea4\u6613II","__typename":"AppliedTranslationNode"},{"questionId":"1329","title":"\u73a9\u7b79\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1330","title":"\u6700\u957f\u5b9a\u5dee\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1331","title":"\u9ec4\u91d1\u77ff\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"1332","title":"\u7edf\u8ba1\u5143\u97f3\u5b57\u6bcd\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1336","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1337","title":"\u8bbe\u8ba1\u8df3\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1338","title":"\u67e5\u8be2\u7ed3\u679c\u7684\u8d28\u91cf\u548c\u5360\u6bd4","__typename":"AppliedTranslationNode"},{"questionId":"1339","title":"\u67e5\u8be2\u7403\u961f\u79ef\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1340","title":"\u54f2\u5b66\u5bb6\u8fdb\u9910","__typename":"AppliedTranslationNode"},{"questionId":"1341","title":"\u5206\u5272\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1342","title":"\u53ef\u4ee5\u653b\u51fb\u56fd\u738b\u7684\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"1343","title":"\u63b7\u9ab0\u5b50\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"1344","title":"\u6700\u5927\u76f8\u7b49\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1345","title":"\u5b57\u7b26\u4e32\u7684\u5de6\u53f3\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1349","title":"\u7f00\u70b9\u6210\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1350","title":"\u5220\u9664\u5b50\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"1351","title":"\u66ff\u6362\u5b50\u4e32\u5f97\u5230\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1352","title":"\u89c4\u5212\u517c\u804c\u5de5\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1357","title":"\u62a5\u544a\u7cfb\u7edf\u72b6\u6001\u7684\u8fde\u7eed\u65e5\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1358","title":"\u627e\u51fa\u7ed9\u5b9a\u65b9\u7a0b\u7684\u6b63\u6574\u6570\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"1359","title":"\u5faa\u73af\u7801\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1360","title":"\u4e32\u8054\u5b57\u7b26\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1361","title":"\u94fa\u74f7\u7816","__typename":"AppliedTranslationNode"},{"questionId":"1362","title":"\u98de\u673a\u5ea7\u4f4d\u5206\u914d\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1364","title":"\u540c\u79ef\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1366","title":"\u7b2c\u4e00\u4e2a\u552f\u4e00\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1367","title":"\u5806\u53e0\u957f\u65b9\u4f53\u7684\u6700\u5927\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1368","title":"\u591a\u7ebf\u7a0b\u7f51\u9875\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1369","title":"\u4ea4\u6362\u5b57\u7b26\u4f7f\u5f97\u5b57\u7b26\u4e32\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"1370","title":"\u7edf\u8ba1\u300c\u4f18\u7f8e\u5b50\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1371","title":"\u79fb\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1372","title":"\u68c0\u67e5\u300c\u597d\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1374","title":"\u81f3\u5c11\u6709\u4e00\u4e2a 1 \u7684\u6700\u5de6\u7aef\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1377","title":"\u6bcf\u4e2a\u5e16\u5b50\u7684\u8bc4\u8bba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1378","title":"\u5947\u6570\u503c\u5355\u5143\u683c\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1379","title":"\u91cd\u6784 2 \u884c\u4e8c\u8fdb\u5236\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1380","title":"\u7edf\u8ba1\u5c01\u95ed\u5c9b\u5c7f\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1381","title":"\u5f97\u5206\u6700\u9ad8\u7684\u5355\u8bcd\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1384","title":"\u627e\u51fa\u9002\u5e94\u5c4f\u5e55\u7684\u6700\u5927\u5b57\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1386","title":"\u4e8c\u7ef4\u7f51\u683c\u8fc1\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1387","title":"\u5728\u53d7\u6c61\u67d3\u7684\u4e8c\u53c9\u6811\u4e2d\u67e5\u627e\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1388","title":"\u53ef\u88ab\u4e09\u6574\u9664\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1389","title":"\u63a8\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1390","title":"\u5e73\u5747\u552e\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1391","title":"\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1395","title":"\u8bbf\u95ee\u6240\u6709\u70b9\u7684\u6700\u5c0f\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1396","title":"\u7edf\u8ba1\u53c2\u4e0e\u901a\u4fe1\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1397","title":"\u641c\u7d22\u63a8\u8350\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1398","title":"\u505c\u5728\u539f\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1399","title":"\u9875\u9762\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1400","title":"\u627e\u51fa\u4e95\u5b57\u68cb\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1401","title":"\u4e0d\u6d6a\u8d39\u539f\u6599\u7684\u6c49\u5821\u5236\u4f5c\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1402","title":"\u7edf\u8ba1\u5168\u4e3a 1 \u7684\u6b63\u65b9\u5f62\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1403","title":"\u5206\u5272\u56de\u6587\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1404","title":"\u9006\u5e8f\u6253\u5370\u4e0d\u53ef\u53d8\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1405","title":"\u5411\u516c\u53f8CEO\u6c47\u62a5\u5de5\u4f5c\u7684\u6240\u6709\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1406","title":"\u6574\u6570\u7684\u5404\u4f4d\u79ef\u548c\u4e4b\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1407","title":"\u7528\u6237\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1408","title":"\u4f7f\u7ed3\u679c\u4e0d\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c0f\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1409","title":"\u8f6c\u5316\u4e3a\u5168\u96f6\u77e9\u9635\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1410","title":"\u7ea2\u7eff\u706f\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1411","title":"\u4e8c\u8fdb\u5236\u94fe\u8868\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1413","title":"\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u6b63\u65b9\u5f62\u7684\u6700\u5927\u8fb9\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1414","title":"\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1415","title":"\u5b66\u751f\u4eec\u53c2\u52a0\u5404\u79d1\u6d4b\u8bd5\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1420","title":"\u627e\u5230\u8fde\u7eed\u533a\u95f4\u7684\u5f00\u59cb\u548c\u7ed3\u675f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1421","title":"\u7edf\u8ba1\u4f4d\u6570\u4e3a\u5076\u6570\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1422","title":"\u5212\u5206\u6570\u7ec4\u4e3a\u8fde\u7eed\u6570\u5b57\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1423","title":"\u5b50\u4e32\u7684\u6700\u5927\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1424","title":"\u4f60\u80fd\u4ece\u76d2\u5b50\u91cc\u83b7\u5f97\u7684\u6700\u5927\u7cd6\u679c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1425","title":"\u4e0d\u540c\u56fd\u5bb6\u7684\u5929\u6c14\u7c7b\u578b","__typename":"AppliedTranslationNode"},{"questionId":"1426","title":"\u548c\u4e3a\u96f6\u7684N\u4e2a\u552f\u4e00\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1427","title":"\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u6240\u6709\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1428","title":"\u8df3\u8dc3\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1429","title":"\u53e3\u7b97\u96be\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1432","title":"\u5224\u65ad\u7ed9\u5b9a\u7684\u5e8f\u5217\u662f\u5426\u662f\u4e8c\u53c9\u6811\u4ece\u6839\u5230\u53f6\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1434","title":"\u89e3\u7801\u5b57\u6bcd\u5230\u6574\u6570\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1435","title":"\u5b50\u6570\u7ec4\u5f02\u6216\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1436","title":"\u83b7\u53d6\u4f60\u597d\u53cb\u5df2\u89c2\u770b\u7684\u89c6\u9891","__typename":"AppliedTranslationNode"},{"questionId":"1437","title":"\u8ba9\u5b57\u7b26\u4e32\u6210\u4e3a\u56de\u6587\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1438","title":"\u6c42\u56e2\u961f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1439","title":"\u4e0d\u540c\u6027\u522b\u6bcf\u65e5\u5206\u6570\u603b\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1440","title":"\u5c06\u6574\u6570\u8f6c\u6362\u4e3a\u4e24\u4e2a\u65e0\u96f6\u6574\u6570\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1441","title":"\u6216\u8fd0\u7b97\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1442","title":"\u8fde\u901a\u7f51\u7edc\u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1443","title":"\u4e8c\u6307\u8f93\u5165\u7684\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1444","title":"\u5c06\u6570\u5b57\u53d8\u6210 0 \u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1445","title":"\u5927\u5c0f\u4e3a K \u4e14\u5e73\u5747\u503c\u5927\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1446","title":"\u65f6\u949f\u6307\u9488\u7684\u5939\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"1447","title":"\u8df3\u8dc3\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1448","title":"6 \u548c 9 \u7ec4\u6210\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1449","title":"\u7ad6\u76f4\u6253\u5370\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1450","title":"\u5220\u9664\u7ed9\u5b9a\u503c\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1451","title":"\u704c\u6e89\u82b1\u56ed\u7684\u6700\u5c11\u6c34\u9f99\u5934\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1452","title":"\u9910\u9986\u8425\u4e1a\u989d\u53d8\u5316\u589e\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1453","title":"\u5e7f\u544a\u6548\u679c","__typename":"AppliedTranslationNode"},{"questionId":"1454","title":"\u5220\u9664\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1455","title":"\u9910\u5385\u8fc7\u6ee4\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1456","title":"\u9608\u503c\u8ddd\u79bb\u5185\u90bb\u5c45\u6700\u5c11\u7684\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1457","title":"\u5de5\u4f5c\u8ba1\u5212\u7684\u6700\u4f4e\u96be\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1458","title":"\u6839\u636e\u6570\u5b57\u4e8c\u8fdb\u5236\u4e0b 1 \u7684\u6570\u76ee\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1459","title":"\u6bcf\u9694 n \u4e2a\u987e\u5ba2\u6253\u6298","__typename":"AppliedTranslationNode"},{"questionId":"1460","title":"\u5305\u542b\u6240\u6709\u4e09\u79cd\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1461","title":"\u6709\u6548\u7684\u5feb\u9012\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1462","title":"\u5217\u51fa\u6307\u5b9a\u65f6\u95f4\u6bb5\u5185\u6240\u6709\u7684\u4e0b\u5355\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1463","title":"\u77e9\u9635\u4e2d\u6218\u6597\u529b\u6700\u5f31\u7684 K \u884c","__typename":"AppliedTranslationNode"},{"questionId":"1464","title":"\u6570\u7ec4\u5927\u5c0f\u51cf\u534a","__typename":"AppliedTranslationNode"},{"questionId":"1465","title":"\u5206\u88c2\u4e8c\u53c9\u6811\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1466","title":"\u8df3\u8dc3\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1467","title":"\u6bcf\u6b21\u8bbf\u95ee\u7684\u4ea4\u6613\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1468","title":"\u68c0\u67e5\u6574\u6570\u53ca\u5176\u4e24\u500d\u6570\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1469","title":"\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1470","title":"\u63a8\u6587\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1471","title":"\u53c2\u52a0\u8003\u8bd5\u7684\u6700\u5927\u5b66\u751f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1472","title":"\u4e0a\u5347\u4e0b\u964d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1473","title":"\u6bcf\u4e2a\u5143\u97f3\u5305\u542b\u5076\u6570\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1474","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u957f\u4ea4\u9519\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1475","title":"\u4e8c\u53c9\u641c\u7d22\u5b50\u6811\u7684\u6700\u5927\u952e\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1476","title":"\u7edf\u8ba1\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u8d1f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1477","title":"\u6700\u540e K \u4e2a\u6570\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1478","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1479","title":"\u591a\u6b21\u6c42\u548c\u6784\u9020\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1480","title":"\u7535\u5f71\u8bc4\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1481","title":"\u9662\u7cfb\u65e0\u6548\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1482","title":"\u6709\u591a\u5c11\u5c0f\u4e8e\u5f53\u524d\u6570\u5b57\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1483","title":"\u901a\u8fc7\u6295\u7968\u5bf9\u56e2\u961f\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1484","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1485","title":"\u4f7f\u7f51\u683c\u56fe\u81f3\u5c11\u6709\u4e00\u6761\u6709\u6548\u8def\u5f84\u7684\u6700\u5c0f\u4ee3\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1486","title":"\u4e24\u4e2a\u6570\u7ec4\u95f4\u7684\u8ddd\u79bb\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1487","title":"\u5b89\u6392\u7535\u5f71\u9662\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1488","title":"\u5c06\u6574\u6570\u6309\u6743\u91cd\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1489","title":"3n \u5757\u62ab\u8428","__typename":"AppliedTranslationNode"},{"questionId":"1490","title":"\u751f\u6210\u6bcf\u79cd\u5b57\u7b26\u90fd\u662f\u5947\u6570\u4e2a\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1491","title":"\u706f\u6ce1\u5f00\u5173 III","__typename":"AppliedTranslationNode"},{"questionId":"1492","title":"\u901a\u77e5\u6240\u6709\u5458\u5de5\u6240\u9700\u7684\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1493","title":"T \u79d2\u540e\u9752\u86d9\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1494","title":"\u6d3b\u52a8\u53c2\u4e0e\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1495","title":"\u987e\u5ba2\u7684\u53ef\u4fe1\u8054\u7cfb\u4eba\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1496","title":"\u77e9\u9635\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1497","title":"\u8bbe\u8ba1\u4e00\u4e2a\u652f\u6301\u589e\u91cf\u64cd\u4f5c\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1498","title":"\u627e\u51fa\u514b\u9686\u4e8c\u53c9\u6811\u4e2d\u7684\u76f8\u540c\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1499","title":"\u6700\u5927\u7684\u56e2\u961f\u8868\u73b0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1500","title":"\u7edf\u8ba1\u6700\u5927\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1501","title":"\u5706\u548c\u77e9\u5f62\u662f\u5426\u6709\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"1502","title":"\u6784\u9020 K \u4e2a\u56de\u6587\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1503","title":"\u505a\u83dc\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1504","title":"\u83b7\u53d6\u6700\u8fd1\u7b2c\u4e8c\u6b21\u7684\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1505","title":"\u6309\u65e2\u5b9a\u987a\u5e8f\u521b\u5efa\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1507","title":"\u68c0\u67e5\u7f51\u683c\u4e2d\u662f\u5426\u5b58\u5728\u6709\u6548\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1508","title":"\u6700\u957f\u5feb\u4e50\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1509","title":"\u4f7f\u7528\u552f\u4e00\u6807\u8bc6\u7801\u66ff\u6362\u5458\u5de5ID","__typename":"AppliedTranslationNode"},{"questionId":"1510","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1511","title":"\u7edf\u8ba1\u4f5c\u6218\u5355\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1512","title":"\u8bbe\u8ba1\u5730\u94c1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1513","title":"\u627e\u5230\u6240\u6709\u597d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1514","title":"\u9010\u6b65\u6c42\u548c\u5f97\u5230\u6b63\u6570\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1515","title":"\u548c\u4e3a K \u7684\u6700\u5c11\u6590\u6ce2\u90a3\u5951\u6570\u5b57\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1516","title":"\u957f\u5ea6\u4e3a n \u7684\u5f00\u5fc3\u5b57\u7b26\u4e32\u4e2d\u5b57\u5178\u5e8f\u7b2c k \u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1517","title":"\u6062\u590d\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1518","title":"\u6309\u5e74\u5ea6\u5217\u51fa\u9500\u552e\u603b\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1519","title":"\u975e\u9012\u589e\u987a\u5e8f\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1520","title":"\u5c06\u4e8c\u8fdb\u5236\u8868\u793a\u51cf\u5230 1 \u7684\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1522","title":"\u77f3\u5b50\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1523","title":"\u80a1\u7968\u7684\u8d44\u672c\u635f\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"1524","title":"\u6570\u7ec4\u4e2d\u7684\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1525","title":"\u67e5\u8be2\u5e26\u952e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1526","title":"HTML \u5b9e\u4f53\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1527","title":"\u7ed9 N x 3 \u7f51\u683c\u56fe\u6d82\u8272\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1528","title":"\u62e5\u6709\u6700\u591a\u7cd6\u679c\u7684\u5b69\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1529","title":"\u6539\u53d8\u4e00\u4e2a\u6574\u6570\u80fd\u5f97\u5230\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1530","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u6253\u7834\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1531","title":"\u6bcf\u4e2a\u4eba\u6234\u4e0d\u540c\u5e3d\u5b50\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1532","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1533","title":"\u70b9\u83dc\u5c55\u793a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1534","title":"\u6570\u9752\u86d9","__typename":"AppliedTranslationNode"},{"questionId":"1535","title":"\u751f\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1536","title":"\u8d2d\u4e70\u4e86\u4ea7\u54c1 A \u548c\u4ea7\u54c1 B \u5374\u6ca1\u6709\u8d2d\u4e70\u4ea7\u54c1 C \u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1537","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1538","title":"\u53ef\u83b7\u5f97\u7684\u6700\u5927\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1539","title":"\u5bf9\u89d2\u7ebf\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"1541","title":"\u6392\u540d\u9760\u524d\u7684\u65c5\u884c\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1542","title":"\u8fde\u7eed\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1543","title":"\u6700\u7b80\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1544","title":"\u7edf\u8ba1\u4e8c\u53c9\u6811\u4e2d\u597d\u8282\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1545","title":"\u6570\u4f4d\u6210\u672c\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1546","title":"\u67e5\u627e\u6210\u7ee9\u5904\u4e8e\u4e2d\u6e38\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1547","title":"\u65c5\u884c\u7ec8\u70b9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"1548","title":"\u662f\u5426\u6240\u6709 1 \u90fd\u81f3\u5c11\u76f8\u9694 k \u4e2a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1549","title":"\u7edd\u5bf9\u5dee\u4e0d\u8d85\u8fc7\u9650\u5236\u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1550","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u7b2c k \u4e2a\u6700\u5c0f\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1551","title":"\u51c0\u73b0\u503c\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1552","title":"\u7528\u6808\u64cd\u4f5c\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1553","title":"\u5f62\u6210\u4e24\u4e2a\u5f02\u6216\u76f8\u7b49\u6570\u7ec4\u7684\u4e09\u5143\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1554","title":"\u6536\u96c6\u6811\u4e0a\u6240\u6709\u82f9\u679c\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1555","title":"\u5207\u62ab\u8428\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1556","title":"\u901a\u8fc7\u7ffb\u8f6c\u5b50\u6570\u7ec4\u4f7f\u4e24\u4e2a\u6570\u7ec4\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1557","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u5305\u542b\u6240\u6709\u957f\u5ea6\u4e3a K \u7684\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1558","title":"\u8bfe\u7a0b\u8868 IV","__typename":"AppliedTranslationNode"},{"questionId":"1559","title":"\u6458\u6a31\u6843 II","__typename":"AppliedTranslationNode"},{"questionId":"1560","title":"\u5728\u65e2\u5b9a\u65f6\u95f4\u505a\u4f5c\u4e1a\u7684\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1561","title":"\u91cd\u65b0\u6392\u5217\u53e5\u5b50\u4e2d\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1562","title":"\u6536\u85cf\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1563","title":"\u5706\u5f62\u9776\u5185\u7684\u6700\u5927\u98de\u9556\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1564","title":"\u5236\u4f5c\u4f1a\u8bdd\u67f1\u72b6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1565","title":"\u8ba1\u7b97\u5e03\u5c14\u8868\u8fbe\u5f0f\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1566","title":"\u68c0\u67e5\u5355\u8bcd\u662f\u5426\u4e3a\u53e5\u4e2d\u5176\u4ed6\u5355\u8bcd\u7684\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1567","title":"\u5b9a\u957f\u5b50\u4e32\u4e2d\u5143\u97f3\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1568","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u4f2a\u56de\u6587\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1569","title":"\u4e24\u4e2a\u5b50\u5e8f\u5217\u7684\u6700\u5927\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1570","title":"\u5546\u54c1\u6298\u6263\u540e\u7684\u6700\u7ec8\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1571","title":"\u5b89\u6392\u90ae\u7b52","__typename":"AppliedTranslationNode"},{"questionId":"1572","title":"\u5b50\u77e9\u5f62\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1573","title":"\u627e\u4e24\u4e2a\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1574","title":"\u6570\u7ec4\u4e2d\u4e24\u5143\u7d20\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1575","title":"\u5207\u5272\u540e\u9762\u79ef\u6700\u5927\u7684\u86cb\u7cd5","__typename":"AppliedTranslationNode"},{"questionId":"1576","title":"\u91cd\u65b0\u89c4\u5212\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1577","title":"\u4e24\u4e2a\u76d2\u5b50\u4e2d\u7403\u7684\u989c\u8272\u6570\u76f8\u540c\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1578","title":"\u82f9\u679c\u548c\u6854\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1579","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1580","title":"\u91cd\u65b0\u6392\u5217\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1581","title":"\u6570\u7ec4\u4e2d\u7684 k \u4e2a\u6700\u5f3a\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1582","title":"\u8bbe\u8ba1\u6d4f\u89c8\u5668\u5386\u53f2\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1583","title":"\u7c89\u5237\u623f\u5b50 III","__typename":"AppliedTranslationNode"},{"questionId":"1584","title":"\u53bb\u6389\u6700\u4f4e\u5de5\u8d44\u548c\u6700\u9ad8\u5de5\u8d44\u540e\u7684\u5de5\u8d44\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1585","title":"n \u7684\u7b2c k \u4e2a\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1586","title":"\u5220\u6389\u4e00\u4e2a\u5143\u7d20\u4ee5\u540e\u5168\u4e3a 1 \u7684\u6700\u957f\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1587","title":"\u5e76\u884c\u8bfe\u7a0b II","__typename":"AppliedTranslationNode"},{"questionId":"1603","title":"\u4e00\u7ef4\u6570\u7ec4\u7684\u52a8\u6001\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1604","title":"\u4e0d\u540c\u6574\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1605","title":"\u5236\u4f5c m \u675f\u82b1\u6240\u9700\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1607","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1608","title":"\u8ba1\u7b97\u7a0e\u540e\u5de5\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"1609","title":"\u5bfb\u627e\u6240\u6709\u7684\u72ec\u751f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1610","title":"\u6570\u7ec4\u5f02\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1611","title":"\u4fdd\u8bc1\u6587\u4ef6\u540d\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"1612","title":"\u907f\u514d\u6d2a\u6c34\u6cdb\u6ee5","__typename":"AppliedTranslationNode"},{"questionId":"1613","title":"\u627e\u5230\u6700\u5c0f\u751f\u6210\u6811\u91cc\u7684\u5173\u952e\u8fb9\u548c\u4f2a\u5173\u952e\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1615","title":"\u5b50\u6570\u7ec4\u548c\u6392\u5e8f\u540e\u7684\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1616","title":"\u4e09\u6b21\u64cd\u4f5c\u540e\u6700\u5927\u503c\u4e0e\u6700\u5c0f\u503c\u7684\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1617","title":"\u77f3\u5b50\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1618","title":"\u5220\u9664\u94fe\u8868 M \u4e2a\u8282\u70b9\u4e4b\u540e\u7684 N \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1619","title":"\u5224\u65ad\u8def\u5f84\u662f\u5426\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1620","title":"\u68c0\u67e5\u6570\u7ec4\u5bf9\u662f\u5426\u53ef\u4ee5\u88ab k \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1621","title":"\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1622","title":"\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1623","title":"\u5468\u5185\u6bcf\u5929\u7684\u9500\u552e\u60c5\u51b5","__typename":"AppliedTranslationNode"},{"questionId":"1624","title":"\u514b\u9686\u542b\u968f\u673a\u6307\u9488\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1625","title":"\u6309\u65e5\u671f\u5206\u7ec4\u9500\u552e\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1626","title":"\u5224\u65ad\u80fd\u5426\u5f62\u6210\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1627","title":"\u6240\u6709\u8682\u8681\u6389\u4e0b\u6765\u524d\u7684\u6700\u540e\u4e00\u523b","__typename":"AppliedTranslationNode"},{"questionId":"1628","title":"\u7edf\u8ba1\u5168 1 \u5b50\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1629","title":"\u6700\u591a K \u6b21\u4ea4\u6362\u76f8\u90bb\u6570\u4f4d\u540e\u5f97\u5230\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1630","title":"\u5728\u533a\u95f4\u8303\u56f4\u5185\u7edf\u8ba1\u5947\u6570\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1631","title":"\u548c\u4e3a\u5947\u6570\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1632","title":"\u5b57\u7b26\u4e32\u7684\u597d\u5206\u5272\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1633","title":"\u5f62\u6210\u76ee\u6807\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6700\u5c11\u589e\u52a0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1634","title":"\u514b\u9686 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1635","title":"\u597d\u6570\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1636","title":"\u4ec5\u542b 1 \u7684\u5b50\u4e32\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1637","title":"\u538b\u7f29\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"1638","title":"\u670d\u52a1\u4e2d\u5fc3\u7684\u6700\u4f73\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1639","title":"\u4e0a\u6708\u64ad\u653e\u7684\u513f\u7ae5\u9002\u5b9c\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"1640","title":"\u8bbe\u8ba1\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1641","title":"\u53ef\u4ee5\u653e\u5fc3\u6295\u8d44\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1642","title":"\u6362\u9152\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1643","title":"\u5b50\u6811\u4e2d\u6807\u7b7e\u76f8\u540c\u7684\u8282\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1644","title":"\u6700\u591a\u7684\u4e0d\u91cd\u53e0\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1645","title":"\u627e\u5230\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u51fd\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1646","title":"\u7b2c k \u4e2a\u7f3a\u5931\u7684\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1647","title":"K \u6b21\u64cd\u4f5c\u8f6c\u53d8\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1648","title":"\u5e73\u8861\u62ec\u53f7\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1649","title":"\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u975e\u7a7a\u5b50\u6570\u7ec4\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1650","title":"\u627e\u5230 N \u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1651","title":"\u91cd\u65b0\u6392\u5217\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1652","title":"\u706f\u6ce1\u5f00\u5173 IV","__typename":"AppliedTranslationNode"},{"questionId":"1653","title":"\u597d\u53f6\u5b50\u8282\u70b9\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1654","title":"\u6d88\u8d39\u8005\u4e0b\u5355\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1655","title":"\u79fb\u52a8 N \u53c9\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1656","title":"\u7edf\u8ba1\u597d\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1657","title":"\u627e\u51fa\u6570\u7ec4\u6e38\u620f\u7684\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1658","title":"\u6392\u5e03\u4e8c\u8fdb\u5236\u7f51\u683c\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1659","title":"\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1660","title":"\u5343\u4f4d\u5206\u9694\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1661","title":"\u53ef\u4ee5\u5230\u8fbe\u6240\u6709\u70b9\u7684\u6700\u5c11\u70b9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1662","title":"\u5f97\u5230\u76ee\u6807\u6570\u7ec4\u7684\u6700\u5c11\u51fd\u6570\u8c03\u7528\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1663","title":"\u4e8c\u7ef4\u7f51\u683c\u56fe\u4e2d\u63a2\u6d4b\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1664","title":"\u67e5\u627e\u62e5\u6709\u6709\u6548\u90ae\u7bb1\u7684\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1665","title":"N \u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1666","title":"\u6574\u7406\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1667","title":"\u627e\u51fa\u7b2c N \u4e2a\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c K \u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1668","title":"\u627e\u51fa\u6700\u957f\u7684\u8d85\u8d5e\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1669","title":"\u5207\u68cd\u5b50\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1670","title":"\u60a3\u67d0\u79cd\u75be\u75c5\u7684\u60a3\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1671","title":"\u6700\u8fd1\u7684\u4e09\u7b14\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1672","title":"\u627e\u5230\u6700\u5927\u6574\u6570\u7684\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"1674","title":"\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1675","title":"\u4e24\u7403\u4e4b\u95f4\u7684\u78c1\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1676","title":"\u5403\u6389 N \u4e2a\u6a58\u5b50\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1677","title":"\u77e9\u9635\u5bf9\u89d2\u7ebf\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1678","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1679","title":"\u5220\u9664\u6700\u77ed\u7684\u5b50\u6570\u7ec4\u4f7f\u5269\u4f59\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1680","title":"\u7edf\u8ba1\u6240\u6709\u53ef\u884c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1681","title":"\u627e\u51fa\u9690\u85cf\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1682","title":"\u5706\u5f62\u8d5b\u9053\u4e0a\u7ecf\u8fc7\u6b21\u6570\u6700\u591a\u7684\u6247\u533a","__typename":"AppliedTranslationNode"},{"questionId":"1683","title":"\u4f60\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1684","title":"\u67e5\u627e\u5927\u5c0f\u4e3a M \u7684\u6700\u65b0\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1685","title":"\u77f3\u5b50\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1686","title":"\u4ea7\u54c1\u540d\u79f0\u683c\u5f0f\u4fee\u590d","__typename":"AppliedTranslationNode"},{"questionId":"1687","title":"\u56fe\u4e2d\u6700\u76f8\u4f3c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1688","title":"\u6bcf\u4ef6\u5546\u54c1\u7684\u6700\u65b0\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1689","title":"\u91cd\u590d\u81f3\u5c11 K \u6b21\u4e14\u957f\u5ea6\u4e3a M \u7684\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1690","title":"\u4e58\u79ef\u4e3a\u6b63\u6570\u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1691","title":"\u4f7f\u9646\u5730\u5206\u79bb\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1692","title":"\u5c06\u5b50\u6570\u7ec4\u91cd\u65b0\u6392\u5e8f\u5f97\u5230\u540c\u4e00\u4e2a\u4e8c\u53c9\u67e5\u627e\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1693","title":"\u6240\u6709\u5947\u6570\u957f\u5ea6\u5b50\u6570\u7ec4\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1694","title":"\u4f7f\u6570\u7ec4\u548c\u80fd\u88ab P \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1695","title":"\u6240\u6709\u6392\u5217\u4e2d\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1696","title":"\u5947\u602a\u7684\u6253\u5370\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"1697","title":"\u53ea\u6709\u4e00\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1698","title":"\u66ff\u6362\u6240\u6709\u7684\u95ee\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1699","title":"\u6570\u7684\u5e73\u65b9\u7b49\u4e8e\u4e24\u6570\u4e58\u79ef\u7684\u65b9\u6cd5\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1700","title":"\u907f\u514d\u91cd\u590d\u5b57\u6bcd\u7684\u6700\u5c0f\u5220\u9664\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1701","title":"\u4fdd\u8bc1\u56fe\u53ef\u5b8c\u5168\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1702","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981","__typename":"AppliedTranslationNode"},{"questionId":"1703","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc I","__typename":"AppliedTranslationNode"},{"questionId":"1704","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u7279\u6b8a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1705","title":"\u7edf\u8ba1\u4e0d\u5f00\u5fc3\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"1706","title":"\u8fde\u63a5\u6240\u6709\u70b9\u7684\u6700\u5c0f\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1707","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u901a\u8fc7\u6392\u5e8f\u5b50\u5b57\u7b26\u4e32\u5f97\u5230\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1708","title":"\u8bbe\u8ba1\u505c\u8f66\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1709","title":"\u8b66\u544a\u4e00\u5c0f\u65f6\u5185\u4f7f\u7528\u76f8\u540c\u5458\u5de5\u5361\u5927\u4e8e\u7b49\u4e8e\u4e09\u6b21\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1710","title":"\u627e\u5230\u5904\u7406\u6700\u591a\u8bf7\u6c42\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1711","title":"\u7ed9\u5b9a\u884c\u548c\u5217\u7684\u548c\u6c42\u53ef\u884c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1712","title":"\u6309\u6708\u7edf\u8ba1\u8ba2\u5355\u6570\u4e0e\u987e\u5ba2\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1713","title":"\u4e24\u4e2a\u7a00\u758f\u5411\u91cf\u7684\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1714","title":"\u91cd\u65b0\u6392\u5217\u5355\u8bcd\u95f4\u7684\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1715","title":"\u62c6\u5206\u5b57\u7b26\u4e32\u4f7f\u552f\u4e00\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee\u6700\u5927","__typename":"AppliedTranslationNode"},{"questionId":"1716","title":"\u77e9\u9635\u7684\u6700\u5927\u975e\u8d1f\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1717","title":"\u8fde\u901a\u4e24\u7ec4\u70b9\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1718","title":"\u4ed3\u5e93\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1719","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc II","__typename":"AppliedTranslationNode"},{"questionId":"1720","title":"\u6587\u4ef6\u5939\u64cd\u4f5c\u65e5\u5fd7\u641c\u96c6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1721","title":"\u7ecf\u8425\u6469\u5929\u8f6e\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"1722","title":"\u7687\u4f4d\u7ee7\u627f\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1723","title":"\u6700\u591a\u53ef\u8fbe\u6210\u7684\u6362\u697c\u8bf7\u6c42\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1724","title":"\u8fdb\u5e97\u5374\u672a\u8fdb\u884c\u8fc7\u4ea4\u6613\u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1725","title":"\u5927\u5c0f\u4e3a K \u7684\u4e0d\u91cd\u53e0\u7ebf\u6bb5\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1726","title":"\u7f51\u7edc\u4fe1\u53f7\u6700\u597d\u7684\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1727","title":"\u732b\u548c\u8001\u9f20 II","__typename":"AppliedTranslationNode"},{"questionId":"1728","title":"\u5947\u5999\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1729","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"1730","title":"\u7279\u6b8a\u6570\u7ec4\u7684\u7279\u5f81\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1731","title":"\u5947\u5076\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1732","title":"\u4f7f\u6574\u6570\u53d8\u4e3a 0 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1733","title":"\u53ef\u89c1\u70b9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1734","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981 II","__typename":"AppliedTranslationNode"},{"questionId":"1735","title":"\u6bcf\u4f4d\u987e\u5ba2\u6700\u7ecf\u5e38\u8ba2\u8d2d\u7684\u5546\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1736","title":"\u6839\u636e\u4e2d\u7f00\u8868\u8fbe\u5f0f\u6784\u9020\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1737","title":"\u62ec\u53f7\u7684\u6700\u5927\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1738","title":"\u6700\u5927\u7f51\u7edc\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1739","title":"\u5206\u5272\u4e24\u4e2a\u5b57\u7b26\u4e32\u5f97\u5230\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1740","title":"\u7edf\u8ba1\u5b50\u6811\u4e2d\u57ce\u5e02\u4e4b\u95f4\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1741","title":"\u6309\u7167\u9891\u7387\u5c06\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1742","title":"\u4e24\u70b9\u4e4b\u95f4\u4e0d\u5305\u542b\u4efb\u4f55\u70b9\u7684\u6700\u5bbd\u5782\u76f4\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1743","title":"\u7edf\u8ba1\u53ea\u5dee\u4e00\u4e2a\u5b57\u7b26\u7684\u5b50\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1744","title":"\u901a\u8fc7\u7ed9\u5b9a\u8bcd\u5178\u6784\u9020\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1745","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u6700\u8fd1\u7684\u53f3\u4fa7\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1746","title":"\u4e24\u4e2a\u76f8\u540c\u5b57\u7b26\u4e4b\u95f4\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1747","title":"\u6267\u884c\u64cd\u4f5c\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1748","title":"\u65e0\u77db\u76fe\u7684\u6700\u4f73\u7403\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1749","title":"\u6ca1\u6709\u5356\u51fa\u7684\u5356\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1750","title":"\u68c0\u67e5\u4e24\u68f5\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811\u662f\u5426\u7b49\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1751","title":"\u6309\u952e\u6301\u7eed\u65f6\u95f4\u6700\u957f\u7684\u952e","__typename":"AppliedTranslationNode"},{"questionId":"1752","title":"\u7b49\u5dee\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1753","title":"\u6700\u5c0f\u4f53\u529b\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1755","title":"\u62c6\u70b8\u5f39","__typename":"AppliedTranslationNode"},{"questionId":"1756","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1757","title":"\u5230\u5bb6\u7684\u6700\u5c11\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1758","title":"\u5206\u914d\u91cd\u590d\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1759","title":"\u627e\u5230\u9057\u5931\u7684ID","__typename":"AppliedTranslationNode"},{"questionId":"1760","title":"\u80fd\u5426\u8fde\u63a5\u5f62\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1761","title":"\u7edf\u8ba1\u5b57\u5178\u5e8f\u5143\u97f3\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1762","title":"\u53ef\u4ee5\u5230\u8fbe\u7684\u6700\u8fdc\u5efa\u7b51","__typename":"AppliedTranslationNode"},{"questionId":"1763","title":"\u4e09\u4eba\u56fd\u5bb6\u4ee3\u8868\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1764","title":"\u6700\u5927\u91cd\u590d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1765","title":"\u5408\u5e76\u4e24\u4e2a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1766","title":"\u5f97\u5230\u5c71\u5f62\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1767","title":"\u8bbe\u8ba1\u524d\u4e2d\u540e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1768","title":"\u8bbe\u8ba1\u5e26\u89e3\u6790\u51fd\u6570\u7684\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1769","title":"\u83b7\u53d6\u751f\u6210\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1770","title":"\u5b57\u7b26\u9891\u6b21\u552f\u4e00\u7684\u6700\u5c0f\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1771","title":"\u9500\u552e\u4ef7\u503c\u51cf\u5c11\u7684\u989c\u8272\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1772","title":"\u901a\u8fc7\u6307\u4ee4\u521b\u5efa\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1773","title":"\u5404\u8d5b\u4e8b\u7684\u7528\u6237\u6ce8\u518c\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1774","title":"\u6c42\u4e24\u4e2a\u591a\u9879\u5f0f\u94fe\u8868\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1775","title":"\u8bbe\u8ba1\u6709\u5e8f\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1776","title":"\u5c06 x \u51cf\u5230 0 \u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1777","title":"\u786e\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u63a5\u8fd1","__typename":"AppliedTranslationNode"},{"questionId":"1778","title":"\u6700\u5927\u5316\u7f51\u683c\u5e78\u798f\u611f","__typename":"AppliedTranslationNode"},{"questionId":"1779","title":"Hopper \u516c\u53f8\u67e5\u8be2 I","__typename":"AppliedTranslationNode"},{"questionId":"1780","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 II","__typename":"AppliedTranslationNode"},{"questionId":"1781","title":"\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u6570\u7ec4\u662f\u5426\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1782","title":"\u5177\u6709\u7ed9\u5b9a\u6570\u503c\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1783","title":"\u751f\u6210\u5e73\u8861\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1784","title":"\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u521d\u59cb\u80fd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1786","title":"\u7edf\u8ba1\u4e00\u81f4\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1787","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u5dee\u7edd\u5bf9\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1788","title":"\u77f3\u5b50\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1789","title":"\u4ece\u4ed3\u5e93\u5230\u7801\u5934\u8fd0\u8f93\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1790","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 III","__typename":"AppliedTranslationNode"},{"questionId":"1791","title":"\u6700\u5bcc\u6709\u5ba2\u6237\u7684\u8d44\u4ea7\u603b\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1792","title":"\u627e\u51fa\u6700\u5177\u7ade\u4e89\u529b\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1793","title":"\u4f7f\u6570\u7ec4\u4e92\u8865\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1794","title":"\u6570\u7ec4\u7684\u6700\u5c0f\u504f\u79fb\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1796","title":"\u7ea0\u6b63\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1797","title":"\u8bbe\u8ba1 Goal \u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1798","title":"K \u548c\u6570\u5bf9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1799","title":"\u6700\u5c0f\u4e0d\u517c\u5bb9\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1800","title":"\u8fde\u63a5\u8fde\u7eed\u4e8c\u8fdb\u5236\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1801","title":"\u6bcf\u53f0\u673a\u5668\u7684\u8fdb\u7a0b\u5e73\u5747\u8fd0\u884c\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1802","title":"\u65e0\u6cd5\u5403\u5348\u9910\u7684\u5b66\u751f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1803","title":"\u5e73\u5747\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1804","title":"\u4fee\u6539\u540e\u7684\u6700\u5927\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1805","title":"\u5f97\u5230\u8fde\u7eed K \u4e2a 1 \u7684\u6700\u5c11\u76f8\u90bb\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1806","title":"\u6bd4\u8d5b\u4e2d\u7684\u914d\u5bf9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1807","title":"\u5341-\u4e8c\u8fdb\u5236\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1808","title":"\u77f3\u5b50\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"1809","title":"\u6570\u7ec4\u4e2d\u7279\u6b8a\u7b49\u95f4\u8ddd\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1810","title":"\u6539\u53d8\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1811","title":"\u4fee\u590d\u8868\u4e2d\u7684\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1812","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1813","title":"\u5220\u9664\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1814","title":"\u8df3\u8dc3\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1815","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1816","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 IV","__typename":"AppliedTranslationNode"},{"questionId":"1817","title":"\u8ba1\u7b97\u529b\u6263\u94f6\u884c\u7684\u94b1","__typename":"AppliedTranslationNode"},{"questionId":"1818","title":"\u5220\u9664\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1819","title":"\u6784\u5efa\u5b57\u5178\u5e8f\u6700\u5927\u7684\u53ef\u884c\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1820","title":"\u91cd\u6784\u4e00\u68f5\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1821","title":"\u53d1\u7968\u4e2d\u7684\u4ea7\u54c1\u91d1\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1822","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"1823","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u7684\u4e24\u534a\u662f\u5426\u76f8\u4f3c","__typename":"AppliedTranslationNode"},{"questionId":"1824","title":"\u5403\u82f9\u679c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1825","title":"\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1826","title":"\u4e0e\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1827","title":"\u65e0\u6548\u7684\u63a8\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1828","title":"\u8ba1\u7b97\u5206\u914d\u7cd6\u679c\u7684\u4e0d\u540c\u65b9\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1829","title":"\u5361\u8f66\u4e0a\u7684\u6700\u5927\u5355\u5143\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1830","title":"\u5927\u9910\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1831","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e09\u4e2a\u5b50\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1832","title":"\u5f97\u5230\u5b50\u5e8f\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1833","title":"\u627e\u5230\u6700\u9ad8\u6d77\u62d4","__typename":"AppliedTranslationNode"},{"questionId":"1834","title":"\u9700\u8981\u6559\u8bed\u8a00\u7684\u6700\u5c11\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1835","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1836","title":"\u751f\u6210\u4e58\u79ef\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1837","title":"\u6bcf\u5929\u7684\u9886\u5bfc\u548c\u5408\u4f19\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1838","title":"\u5b57\u7b26\u4e32\u7684\u4e0d\u540c\u5b50\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1839","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1840","title":"\u6267\u884c\u4ea4\u6362\u64cd\u4f5c\u540e\u7684\u6700\u5c0f\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1842","title":"\u4e24\u4eba\u4e4b\u95f4\u7684\u901a\u8bdd\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1843","title":"\u53ef\u4ee5\u5f62\u6210\u6700\u5927\u6b63\u65b9\u5f62\u7684\u77e9\u5f62\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1844","title":"\u76d2\u5b50\u4e2d\u5c0f\u7403\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1845","title":"\u91cd\u65b0\u6392\u5217\u540e\u7684\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1847","title":"\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1848","title":"\u552f\u4e00\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1849","title":"\u4efb\u610f\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u503c\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1850","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e24\u7aef\u76f8\u540c\u5b57\u7b26\u540e\u7684\u6700\u77ed\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1851","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee II","__typename":"AppliedTranslationNode"},{"questionId":"1852","title":"\u8bbf\u95ee\u65e5\u671f\u4e4b\u95f4\u6700\u5927\u7684\u7a7a\u6863\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1858","title":"\u66ff\u6362\u9690\u85cf\u6570\u5b57\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1859","title":"\u6ee1\u8db3\u4e09\u6761\u4ef6\u4e4b\u4e00\u9700\u6539\u53d8\u7684\u6700\u5c11\u5b57\u7b26\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1860","title":"\u627e\u51fa\u7b2c K \u5927\u7684\u5f02\u6216\u5750\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1861","title":"\u653e\u7f6e\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1862","title":"\u82f9\u679c\u548c\u6a58\u5b50\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1865","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728 II","__typename":"AppliedTranslationNode"},{"questionId":"1866","title":"\u4ece\u76f8\u90bb\u5143\u7d20\u5bf9\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1871","title":"\u56de\u6587\u4e32\u5206\u5272 IV","__typename":"AppliedTranslationNode"},{"questionId":"1872","title":"\u4f60\u80fd\u5728\u4f60\u6700\u559c\u6b22\u7684\u90a3\u5929\u5403\u5230\u4f60\u6700\u559c\u6b22\u7684\u7cd6\u679c\u5417\uff1f","__typename":"AppliedTranslationNode"},{"questionId":"1873","title":"\u6700\u957f\u7684\u7f8e\u597d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1874","title":"\u901a\u8fc7\u8fde\u63a5\u53e6\u4e00\u4e2a\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u5f97\u5230\u4e00\u4e2a\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1875","title":"\u4e92\u8d28\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1876","title":"\u5730\u56fe\u4e2d\u7684\u6700\u9ad8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1877","title":"\u6c42\u5173\u6ce8\u8005\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1878","title":"\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u7ecf\u6392\u5e8f\u548c\u8f6e\u8f6c\u5f97\u5230","__typename":"AppliedTranslationNode"},{"questionId":"1879","title":"\u79fb\u9664\u77f3\u5b50\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1880","title":"\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5927\u7684\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1881","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1882","title":"\u6bcf\u4f4d\u7ecf\u7406\u7684\u4e0b\u5c5e\u5458\u5de5\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1883","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1884","title":"\u751f\u6210\u4ea4\u66ff\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1885","title":"\u7edf\u8ba1\u540c\u6784\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1886","title":"\u888b\u5b50\u91cc\u6700\u5c11\u6570\u76ee\u7684\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1887","title":"\u4e00\u4e2a\u56fe\u4e2d\u8fde\u901a\u4e09\u5143\u7ec4\u7684\u6700\u5c0f\u5ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1888","title":"\u627e\u5230\u6700\u8fd1\u7684\u6709\u76f8\u540c X \u6216 Y \u5750\u6807\u7684\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1889","title":"\u5224\u65ad\u4e00\u4e2a\u6570\u5b57\u662f\u5426\u53ef\u4ee5\u8868\u793a\u6210\u4e09\u7684\u5e42\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1890","title":"\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u7f8e\u4e3d\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1891","title":"\u7edf\u8ba1\u70b9\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1892","title":"\u67e5\u627e\u6bcf\u4e2a\u5458\u5de5\u82b1\u8d39\u7684\u603b\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1893","title":"\u7ecf\u8fc7\u4e00\u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1894","title":"\u4ea4\u66ff\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1895","title":"\u79fb\u52a8\u6240\u6709\u7403\u5230\u6bcf\u4e2a\u76d2\u5b50\u6240\u9700\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1896","title":"\u6267\u884c\u4e58\u6cd5\u8fd0\u7b97\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1897","title":"\u7531\u5b50\u5e8f\u5217\u6784\u9020\u7684\u6700\u957f\u56de\u6587\u4e32\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1898","title":"\u5e94\u8be5\u88ab\u7981\u6b62\u7684Leetflex\u8d26\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1899","title":"\u7edf\u8ba1\u5339\u914d\u68c0\u7d22\u89c4\u5219\u7684\u7269\u54c1\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1900","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u4ef7\u683c\u7684\u751c\u70b9\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1901","title":"\u901a\u8fc7\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1902","title":"\u8f66\u961f II","__typename":"AppliedTranslationNode"},{"questionId":"1903","title":"\u8bbe\u8ba1\u6700\u8fd1\u4f7f\u7528\uff08MRU\uff09\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1904","title":"\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e8c\u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1905","title":"\u8bbe\u8ba1\u4e00\u4e2a\u9a8c\u8bc1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1906","title":"N \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1907","title":"\u7edf\u8ba1\u5f02\u6216\u503c\u5728\u8303\u56f4\u5185\u7684\u6570\u5bf9\u6709\u591a\u5c11","__typename":"AppliedTranslationNode"},{"questionId":"1908","title":"\u53ef\u56de\u6536\u4e14\u4f4e\u8102\u7684\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1909","title":"\u80fd\u770b\u5230\u6d77\u666f\u7684\u5efa\u7b51\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1910","title":"\u68c0\u67e5\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1911","title":"\u6784\u6210\u7279\u5b9a\u548c\u9700\u8981\u6dfb\u52a0\u7684\u6700\u5c11\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1912","title":"\u4ece\u7b2c\u4e00\u4e2a\u8282\u70b9\u51fa\u53d1\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684\u53d7\u9650\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1913","title":"\u4f7f\u6240\u6709\u533a\u95f4\u7684\u5f02\u6216\u7ed3\u679c\u4e3a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1914","title":"\u5bfb\u627e\u6ca1\u6709\u88ab\u6267\u884c\u7684\u4efb\u52a1\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1915","title":"\u4ec5\u6267\u884c\u4e00\u6b21\u5b57\u7b26\u4e32\u4ea4\u6362\u80fd\u5426\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1916","title":"\u627e\u51fa\u661f\u578b\u56fe\u7684\u4e2d\u5fc3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1917","title":"\u6700\u5927\u5e73\u5747\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1918","title":"\u597d\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1919","title":"\u6309\u53d7\u6b22\u8fce\u7a0b\u5ea6\u6392\u5217\u529f\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"1920","title":"\u5224\u65ad\u56fd\u9645\u8c61\u68cb\u68cb\u76d8\u4e2d\u4e00\u4e2a\u683c\u5b50\u7684\u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1923","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 III","__typename":"AppliedTranslationNode"},{"questionId":"1924","title":"\u5f97\u5230\u65b0\u9c9c\u751c\u751c\u5708\u7684\u6700\u591a\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1925","title":"\u7edf\u8ba1\u4e00\u4e2a\u6570\u7ec4\u4e2d\u597d\u5bf9\u5b50\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1926","title":"\u6bcf\u5bb6\u5546\u5e97\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1927","title":"\u6700\u5927\u5347\u5e8f\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1928","title":"\u79ef\u538b\u8ba2\u5355\u4e2d\u7684\u8ba2\u5355\u603b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1929","title":"\u6709\u754c\u6570\u7ec4\u4e2d\u6307\u5b9a\u4e0b\u6807\u5904\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1930","title":"\u4f60\u80fd\u6784\u9020\u51fa\u8fde\u7eed\u503c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1931","title":"\u672a\u77e5\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1932","title":"\u5927\u6ee1\u8d2f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1933","title":"\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1934","title":"\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u62ec\u53f7\u5185\u5bb9","__typename":"AppliedTranslationNode"},{"questionId":"1935","title":"\u8fd8\u539f\u6392\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b65\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1936","title":"\u597d\u56e0\u5b50\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1937","title":"\u6700\u5927\u5316\u82b1\u56ed\u7684\u7f8e\u89c2\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1938","title":"\u6700\u5c11\u64cd\u4f5c\u4f7f\u6570\u7ec4\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1939","title":"\u7edf\u8ba1\u4e00\u4e2a\u5706\u4e2d\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1940","title":"\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1941","title":"\u4f7f\u5b57\u7b26\u4e32\u6709\u5e8f\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1942","title":"\u5458\u5de5\u7684\u76f4\u5c5e\u90e8\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"1943","title":"\u7edf\u8ba1\u8ddd\u79bb\u6700\u5c0f\u7684\u5b50\u4e32\u5bf9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1944","title":"\u622a\u65ad\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1945","title":"\u67e5\u627e\u7528\u6237\u6d3b\u8dc3\u5206\u949f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1946","title":"\u7edd\u5bf9\u5dee\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1947","title":"\u5e8f\u5217\u4e2d\u4e0d\u540c\u6700\u5927\u516c\u7ea6\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1948","title":"\u6bcf\u4e2a\u4ea7\u54c1\u5728\u4e0d\u540c\u5546\u5e97\u7684\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1949","title":"\u5b9e\u73b0 Trie \uff08\u524d\u7f00\u6811\uff09 II","__typename":"AppliedTranslationNode"},{"questionId":"1950","title":"\u6570\u7ec4\u5143\u7d20\u79ef\u7684\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1951","title":"\u627e\u51fa\u6e38\u620f\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1952","title":"\u6700\u5c11\u4fa7\u8df3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1953","title":"\u6c42\u51fa MK \u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1954","title":"\u5c06\u6240\u6709\u6570\u5b57\u7528\u5b57\u7b26\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1955","title":"\u5ea7\u4f4d\u9884\u7ea6\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1956","title":"\u51cf\u5c0f\u548c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\u540e\u7684\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1957","title":"\u6700\u8fd1\u7684\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1958","title":"\u6ca1\u6709\u5e7f\u544a\u7684\u5267\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1959","title":"\u9690\u85cf\u7f51\u683c\u4e0b\u7684\u6700\u5c0f\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1960","title":"\u5224\u65ad\u53e5\u5b50\u662f\u5426\u4e3a\u5168\u5b57\u6bcd\u53e5","__typename":"AppliedTranslationNode"},{"questionId":"1961","title":"\u96ea\u7cd5\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1962","title":"\u5355\u7ebf\u7a0b CPU","__typename":"AppliedTranslationNode"},{"questionId":"1963","title":"\u6240\u6709\u6570\u5bf9\u6309\u4f4d\u4e0e\u7ed3\u679c\u7684\u5f02\u6216\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1964","title":"\u5bfb\u627e\u9762\u8bd5\u5019\u9009\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1965","title":"K \u8fdb\u5236\u8868\u793a\u4e0b\u7684\u5404\u4f4d\u6570\u5b57\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1966","title":"\u6700\u9ad8\u9891\u5143\u7d20\u7684\u9891\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1967","title":"\u6240\u6709\u5143\u97f3\u6309\u987a\u5e8f\u6392\u5e03\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1968","title":"\u6700\u9ad8\u5efa\u7b51\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1969","title":"\u6700\u591a\u9080\u8bf7\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1970","title":"\u5c06\u53e5\u5b50\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1971","title":"\u589e\u957f\u7684\u5185\u5b58\u6cc4\u9732","__typename":"AppliedTranslationNode"},{"questionId":"1972","title":"\u65cb\u8f6c\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1974","title":"\u5bfb\u627e\u4eca\u5e74\u5177\u6709\u6b63\u6536\u5165\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1975","title":"\u5230\u76ee\u6807\u5143\u7d20\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1976","title":"\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u9012\u51cf\u7684\u8fde\u7eed\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1977","title":"\u5305\u542b\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1978","title":"\u90bb\u4f4d\u4ea4\u6362\u7684\u6700\u5c0f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1980","title":"\u6709\u7f3a\u9677\u7684\u4f20\u611f\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1981","title":"\u6bcf\u5929\u7684\u6700\u5927\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1982","title":"\u4ece\u672a\u6392\u5e8f\u7684\u94fe\u8868\u4e2d\u79fb\u9664\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1983","title":"\u4eba\u53e3\u6700\u591a\u7684\u5e74\u4efd","__typename":"AppliedTranslationNode"},{"questionId":"1984","title":"\u4e0b\u6807\u5bf9\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1985","title":"\u5b50\u6570\u7ec4\u6700\u5c0f\u4e58\u79ef\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1986","title":"\u6709\u5411\u56fe\u4e2d\u6700\u5927\u989c\u8272\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1987","title":"\u957f\u5ea6\u4e3a\u4e09\u4e14\u5404\u5b57\u7b26\u4e0d\u540c\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1988","title":"\u6570\u7ec4\u4e2d\u6700\u5927\u6570\u5bf9\u548c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1989","title":"\u4e24\u4e2a\u6570\u7ec4\u6700\u5c0f\u7684\u5f02\u6216\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1990","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u4e09\u4e2a\u83f1\u5f62\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1991","title":"\u8054\u8d5b\u4fe1\u606f\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1993","title":"\u627e\u51fa\u6240\u6709\u5b50\u96c6\u7684\u5f02\u6216\u603b\u548c\u518d\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1994","title":"\u6784\u6210\u4ea4\u66ff\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1995","title":"\u627e\u51fa\u548c\u4e3a\u6307\u5b9a\u503c\u7684\u4e0b\u6807\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1996","title":"\u6070\u6709 K \u6839\u6728\u68cd\u53ef\u4ee5\u770b\u5230\u7684\u6392\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1997","title":"\u4e0b\u4e2a\u7531\u76f8\u540c\u6570\u5b57\u6784\u6210\u7684\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1999","title":"\u54ea\u79cd\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u66f4\u957f","__typename":"AppliedTranslationNode"},{"questionId":"2000","title":"\u51c6\u65f6\u5230\u8fbe\u7684\u5217\u8f66\u6700\u5c0f\u65f6\u901f","__typename":"AppliedTranslationNode"},{"questionId":"2001","title":"\u8df3\u8dc3\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"2002","title":"\u77f3\u5b50\u6e38\u620f VIII","__typename":"AppliedTranslationNode"},{"questionId":"2003","title":"\u6bcf\u4e2a\u5b50\u6570\u7ec4\u7684\u6570\u5b57\u79cd\u7c7b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2004","title":"\u8f6c\u6362\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"2005","title":"\u68c0\u67e5\u662f\u5426\u533a\u57df\u5185\u6240\u6709\u6574\u6570\u90fd\u88ab\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"2006","title":"\u627e\u5230\u9700\u8981\u8865\u5145\u7c89\u7b14\u7684\u5b66\u751f\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2008","title":"\u53cd\u8f6c\u8868\u8fbe\u5f0f\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2009","title":"\u5305\u542b\u6240\u6709\u524d\u7f00\u7684\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"2010","title":"\u68c0\u67e5\u67d0\u5355\u8bcd\u662f\u5426\u7b49\u4e8e\u4e24\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2011","title":"\u63d2\u5165\u540e\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2012","title":"\u4f7f\u7528\u670d\u52a1\u5668\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"2013","title":"\u51c6\u65f6\u62b5\u8fbe\u4f1a\u8bae\u73b0\u573a\u7684\u6700\u5c0f\u8df3\u8fc7\u4f11\u606f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2015","title":"\u5224\u65ad\u77e9\u9635\u7ecf\u8f6e\u8f6c\u540e\u662f\u5426\u4e00\u81f4","__typename":"AppliedTranslationNode"},{"questionId":"2016","title":"\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49\u7684\u51cf\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2017","title":"\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u7b26\u4ea4\u66ff\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2018","title":"\u88c5\u5305\u88f9\u7684\u6700\u5c0f\u6d6a\u8d39\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2019","title":"\u4e24\u4e2a\u884c\u7a0b\u7f16\u7801\u6570\u7ec4\u7684\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2020","title":"\u5220\u9664\u4e00\u4e2a\u5143\u7d20\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"2021","title":"\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u51fa\u73b0\u7684\u7ed9\u5b9a\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2022","title":"\u6700\u5927\u5b50\u5e8f\u5217\u4ea4\u66ff\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2023","title":"\u8bbe\u8ba1\u7535\u5f71\u79df\u501f\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"2024","title":"\u8ba1\u7b97\u7279\u6b8a\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"2025","title":"\u91cd\u65b0\u5206\u914d\u5b57\u7b26\u4f7f\u6240\u6709\u5b57\u7b26\u4e32\u90fd\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"2026","title":"\u5408\u5e76\u82e5\u5e72\u4e09\u5143\u7ec4\u4ee5\u5f62\u6210\u76ee\u6807\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2027","title":"\u53ef\u79fb\u9664\u5b57\u7b26\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2028","title":"\u6700\u4f73\u8fd0\u52a8\u5458\u7684\u6bd4\u62fc\u56de\u5408","__typename":"AppliedTranslationNode"},{"questionId":"2029","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u6700\u5c0f\u4e58\u79ef\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2031","title":"\u9e21\u86cb\u6389\u843d-\u4e24\u679a\u9e21\u86cb","__typename":"AppliedTranslationNode"},{"questionId":"2032","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6700\u5927\u5947\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2033","title":"\u4f60\u5b8c\u6210\u7684\u5b8c\u6574\u5bf9\u5c40\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2034","title":"\u67e5\u8be2\u5dee\u7edd\u5bf9\u503c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2035","title":"\u7edf\u8ba1\u5b50\u5c9b\u5c7f","__typename":"AppliedTranslationNode"},{"questionId":"2037","title":"\u7edf\u8ba1\u5e73\u65b9\u548c\u4e09\u5143\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2038","title":"\u8ff7\u5bab\u4e2d\u79bb\u5165\u53e3\u6700\u8fd1\u7684\u51fa\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"2039","title":"\u6c42\u548c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2040","title":"\u89c4\u5b9a\u65f6\u95f4\u5185\u5230\u8fbe\u7ec8\u70b9\u7684\u6700\u5c0f\u82b1\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"2041","title":"2020\u5e74\u6700\u540e\u4e00\u6b21\u767b\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"2042","title":"\u4e24\u4e2a\u6570\u5bf9\u4e4b\u95f4\u7684\u6700\u5927\u4e58\u79ef\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2043","title":"\u5faa\u73af\u8f6e\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"2044","title":"\u6700\u7f8e\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2045","title":"\u5272\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"2046","title":"\u9875\u9762\u63a8\u8350\u2161","__typename":"AppliedTranslationNode"},{"questionId":"2047","title":"\u627e\u51fa\u9876\u5cf0\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"2048","title":"\u57fa\u4e8e\u6392\u5217\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2049","title":"\u6d88\u706d\u602a\u7269\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2050","title":"\u7edf\u8ba1\u597d\u6570\u5b57\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2051","title":"\u6700\u957f\u516c\u5171\u5b50\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"2053","title":"\u68c0\u67e5\u662f\u5426\u6240\u6709\u5b57\u7b26\u51fa\u73b0\u6b21\u6570\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"2054","title":"\u6700\u5c0f\u672a\u88ab\u5360\u636e\u6905\u5b50\u7684\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2055","title":"\u63cf\u8ff0\u7ed8\u753b\u7ed3\u679c","__typename":"AppliedTranslationNode"},{"questionId":"2057","title":"\u6309\u5206\u7c7b\u7edf\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"2058","title":"\u6570\u7ec4\u4e32\u8054","__typename":"AppliedTranslationNode"},{"questionId":"2059","title":"\u957f\u5ea6\u4e3a 3 \u7684\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2060","title":"\u5408\u5e76\u591a\u68f5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"2061","title":"\u7528\u4e09\u79cd\u4e0d\u540c\u989c\u8272\u4e3a\u7f51\u683c\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"2062","title":"Nim \u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"2064","title":"\u5174\u8da3\u76f8\u540c\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"2066","title":"\u65b0\u589e\u7684\u6700\u5c11\u53f0\u9636\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2067","title":"\u6263\u5206\u540e\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"2068","title":"\u67e5\u8be2\u6700\u5927\u57fa\u56e0\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2069","title":"\u7b2c K \u5c0f\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2070","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u5206\u89e3\u4e3a\u503c\u5747\u7b49\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2071","title":"\u6392\u5e8f\u6570\u7ec4\u4e4b\u95f4\u7684\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2072","title":"\u6240\u6709\u5b50\u6570\u7ec4\u6700\u5c0f\u503c\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2073","title":"\u611f\u67d3 K \u79cd\u75c5\u6bd2\u6240\u9700\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2076","title":"\u5b57\u7b26\u4e32\u8f6c\u5316\u540e\u7684\u5404\u4f4d\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2077","title":"\u5b50\u5b57\u7b26\u4e32\u7a81\u53d8\u540e\u53ef\u80fd\u5f97\u5230\u7684\u6700\u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2078","title":"\u6700\u5927\u517c\u5bb9\u6027\u8bc4\u5206\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2079","title":"\u5220\u9664\u7cfb\u7edf\u4e2d\u7684\u91cd\u590d\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"2080","title":"\u68c0\u67e5\u64cd\u4f5c\u662f\u5426\u5408\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"2081","title":"K \u6b21\u8c03\u6574\u6570\u7ec4\u5927\u5c0f\u6d6a\u8d39\u7684\u6700\u5c0f\u603b\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2083","title":"\u4e09\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2084","title":"\u4f60\u53ef\u4ee5\u5de5\u4f5c\u7684\u6700\u5927\u5468\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2085","title":"\u6784\u9020\u5143\u7d20\u4e0d\u7b49\u4e8e\u4e24\u76f8\u90bb\u5143\u7d20\u5e73\u5747\u503c\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2086","title":"\u7edf\u8ba1\u7279\u6b8a\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2088","title":"\u4f7f\u7528\u7279\u6b8a\u6253\u5b57\u673a\u952e\u5165\u5355\u8bcd\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2089","title":"\u6700\u5927\u65b9\u9635\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2090","title":"\u5230\u8fbe\u76ee\u7684\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2091","title":"\u5212\u5206\u6570\u5b57\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2093","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u4e3a\u6570\u7ec4\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2094","title":"\u79fb\u9664\u77f3\u5b50\u4f7f\u603b\u6570\u6700\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"2095","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2096","title":"\u627e\u51fa\u5230\u6bcf\u4e2a\u4f4d\u7f6e\u4e3a\u6b62\u6700\u957f\u7684\u6709\u6548\u969c\u788d\u8d5b\u8dd1\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"2098","title":"\u67e5\u8be2\u5177\u6709\u6700\u591a\u5171\u540c\u5173\u6ce8\u8005\u7684\u6240\u6709\u4e24\u4e24\u7ed3\u5bf9\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2099","title":"\u4f5c\u4e3a\u5b50\u5b57\u7b26\u4e32\u51fa\u73b0\u5728\u5355\u8bcd\u4e2d\u7684\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2100","title":"\u6570\u7ec4\u5143\u7d20\u7684\u6700\u5c0f\u975e\u96f6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2101","title":"\u4f60\u80fd\u7a7f\u8fc7\u77e9\u9635\u7684\u6700\u540e\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2102","title":"\u627e\u5230\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"2103","title":"\u627e\u5230\u6240\u6709\u7684\u519c\u573a\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2104","title":"\u6811\u4e0a\u7684\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"2105","title":"\u597d\u5b50\u96c6\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2106","title":"\u627e\u51fa\u6570\u7ec4\u7684\u6700\u5927\u516c\u7ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2107","title":"\u627e\u51fa\u4e0d\u540c\u7684\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2108","title":"\u6700\u5c0f\u5316\u76ee\u6807\u503c\u4e0e\u6240\u9009\u5143\u7d20\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2109","title":"\u4ece\u5b50\u96c6\u7684\u548c\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2112","title":"\u5b66\u751f\u5206\u6570\u7684\u6700\u5c0f\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2113","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u7b2c K \u5927\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2114","title":"\u5b8c\u6210\u4efb\u52a1\u7684\u6700\u5c11\u5de5\u4f5c\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"2115","title":"\u4e0d\u540c\u7684\u597d\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2116","title":"\u5dee\u7684\u7edd\u5bf9\u503c\u4e3a K \u7684\u6570\u5bf9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2117","title":"\u4ece\u53cc\u500d\u6570\u7ec4\u4e2d\u8fd8\u539f\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2118","title":"\u51fa\u79df\u8f66\u7684\u6700\u5927\u76c8\u5229","__typename":"AppliedTranslationNode"},{"questionId":"2119","title":"\u4f7f\u6570\u7ec4\u8fde\u7eed\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2122","title":"\u7edf\u8ba1\u7279\u6b8a\u56db\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2123","title":"\u6e38\u620f\u4e2d\u5f31\u89d2\u8272\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2124","title":"\u8bbf\u95ee\u5b8c\u6240\u6709\u623f\u95f4\u7684\u7b2c\u4e00\u5929","__typename":"AppliedTranslationNode"},{"questionId":"2125","title":"\u6570\u7ec4\u7684\u6700\u5927\u516c\u56e0\u6570\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"2128","title":"\u53cd\u8f6c\u5355\u8bcd\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"2129","title":"\u53ef\u4e92\u6362\u77e9\u5f62\u7684\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2130","title":"\u4e24\u4e2a\u56de\u6587\u5b50\u5e8f\u5217\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"2131","title":"\u6bcf\u68f5\u5b50\u6811\u5185\u7f3a\u5931\u7684\u6700\u5c0f\u57fa\u56e0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2132","title":"\u5c06\u4e00\u7ef4\u6570\u7ec4\u8f6c\u53d8\u6210\u4e8c\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2133","title":"\u8fde\u63a5\u540e\u7b49\u4e8e\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u5b57\u7b26\u4e32\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"2134","title":"\u8003\u8bd5\u7684\u6700\u5927\u56f0\u6270\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"2135","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u591a\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2137","title":"\u6267\u884c\u64cd\u4f5c\u540e\u7684\u53d8\u91cf\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2138","title":"\u6570\u7ec4\u7f8e\u4e3d\u503c\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2139","title":"\u68c0\u6d4b\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"2140","title":"\u91cd\u590d K \u6b21\u7684\u6700\u957f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2144","title":"\u589e\u91cf\u5143\u7d20\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2145","title":"\u7f51\u683c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"2146","title":"\u5224\u65ad\u5355\u8bcd\u662f\u5426\u80fd\u653e\u5165\u586b\u5b57\u6e38\u620f\u5185","__typename":"AppliedTranslationNode"},{"questionId":"2147","title":"\u89e3\u51fa\u6570\u5b66\u8868\u8fbe\u5f0f\u7684\u5b66\u751f\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2154","title":"\u8f6c\u6362\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2155","title":"\u627e\u51fa\u7f3a\u5931\u7684\u89c2\u6d4b\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"2156","title":"\u77f3\u5b50\u6e38\u620f IX","__typename":"AppliedTranslationNode"},{"questionId":"2157","title":"\u542b\u7279\u5b9a\u5b57\u6bcd\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"2159","title":"\u81f3\u5c11\u5728\u4e24\u4e2a\u6570\u7ec4\u4e2d\u51fa\u73b0\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2160","title":"\u83b7\u53d6\u5355\u503c\u7f51\u683c\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2161","title":"\u80a1\u7968\u4ef7\u683c\u6ce2\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"2162","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e24\u4e2a\u6570\u7ec4\u5e76\u6700\u5c0f\u5316\u6570\u7ec4\u548c\u7684\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100002","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100003","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100004","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100005","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100006","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100007","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100008","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100009","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100010","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100011","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100012","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100013","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100014","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100015","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100016","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100017","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100018","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100019","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100020","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100021","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100022","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100023","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100024","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100025","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100026","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100027","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100028","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100029","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100030","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100031","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100032","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100033","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100034","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100035","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100036","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100037","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100038","title":"\u78b0\u649e\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100039","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100040","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100041","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100042","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100043","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100044","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100045","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100046","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100047","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100048","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100049","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100050","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100051","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100052","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100065","title":"\u6700\u5c0f\u4ea4\u6362\u6b21\u6570\u4f7f\u5f97\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100091","title":"\u529b\u6263\u8c61\u68cb\u5b66\u5802","__typename":"AppliedTranslationNode"},{"questionId":"100092","title":"\u5206\u5f0f\u5316\u7b80","__typename":"AppliedTranslationNode"},{"questionId":"100093","title":"\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"100094","title":"\u53d1 LeetCoin","__typename":"AppliedTranslationNode"},{"questionId":"100096","title":"\u673a\u5668\u4eba\u5927\u5192\u9669","__typename":"AppliedTranslationNode"},{"questionId":"100103","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100104","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100105","title":"\u56f4\u6210\u4e00\u5708","__typename":"AppliedTranslationNode"},{"questionId":"100106","title":"\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100107","title":"\u731c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100125","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570 - LC","__typename":"AppliedTranslationNode"},{"questionId":"100129","title":"\u5458\u5de5\u4e92\u8bc4","__typename":"AppliedTranslationNode"},{"questionId":"100130","title":"\u7535\u68af","__typename":"AppliedTranslationNode"},{"questionId":"100136","title":"\u5b57\u7b26\u4e32\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"100139","title":"\u6d4b\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100144","title":"\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100146","title":"\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"100147","title":"\u6d88\u9664\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100148","title":"PK","__typename":"AppliedTranslationNode"},{"questionId":"100149","title":"\u5408\u5e76\u4efb\u52a1\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100151","title":"\u56fd\u5bb6\u7ed3\u76df -- 952 \u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"100152","title":"\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100153","title":"\u5feb\u9012\u5458\u6d3e\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"100154","title":"\u8fde\u8fde\u770b","__typename":"AppliedTranslationNode"},{"questionId":"100157","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"100158","title":"\u5224\u5b9a\u5b57\u7b26\u662f\u5426\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100159","title":"\u5224\u5b9a\u662f\u5426\u4e92\u4e3a\u5b57\u7b26\u91cd\u6392","__typename":"AppliedTranslationNode"},{"questionId":"100160","title":"URL\u5316","__typename":"AppliedTranslationNode"},{"questionId":"100161","title":"\u5b57\u7b26\u4e32\u538b\u7f29","__typename":"AppliedTranslationNode"},{"questionId":"100162","title":"\u5b57\u7b26\u4e32\u8f6e\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"100163","title":"\u79fb\u9664\u91cd\u590d\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100164","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100167","title":"\u94fe\u8868\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"100168","title":"\u73af\u8def\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"100169","title":"\u6808\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100170","title":"\u5316\u6808\u4e3a\u961f","__typename":"AppliedTranslationNode"},{"questionId":"100171","title":"\u8282\u70b9\u95f4\u901a\u8def","__typename":"AppliedTranslationNode"},{"questionId":"100172","title":"\u4e09\u5408\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100173","title":"\u6808\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100174","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100175","title":"\u7279\u5b9a\u6df1\u5ea6\u8282\u70b9\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100176","title":"\u68c0\u67e5\u5e73\u8861\u6027","__typename":"AppliedTranslationNode"},{"questionId":"100177","title":"\u5408\u6cd5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100178","title":"\u540e\u7ee7\u8005","__typename":"AppliedTranslationNode"},{"questionId":"100179","title":"\u9996\u4e2a\u5171\u540c\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100180","title":"\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"100181","title":"\u6574\u6570\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100182","title":"\u914d\u5bf9\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100183","title":"\u4e0b\u4e00\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100184","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100185","title":"\u65cb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100186","title":"\u96f6\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100187","title":"\u5220\u9664\u4e2d\u95f4\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100188","title":"\u94fe\u8868\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100189","title":"\u897f\u6e38\u8bb0","__typename":"AppliedTranslationNode"},{"questionId":"100191","title":"\u4f18\u5316\u53c2\u8d5b\u961f\u4f0d","__typename":"AppliedTranslationNode"},{"questionId":"100193","title":"\u9ed1\u767d\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"100194","title":"2048 \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100195","title":"\u5806\u76d8\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100196","title":"\u7ed8\u5236\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100197","title":"\u4e09\u6b65\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100198","title":"\u5e42\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"100199","title":"\u9012\u5f52\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100200","title":"\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"100201","title":"\u989c\u8272\u586b\u5145","__typename":"AppliedTranslationNode"},{"questionId":"100202","title":"\u5806\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100203","title":"\u4e8c\u8fdb\u5236\u6570\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100206","title":"\u70b9\u4eae\u5723\u8bde\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100207","title":"\u8ff7\u5bab\u91cd\u529b\u7403","__typename":"AppliedTranslationNode"},{"questionId":"100208","title":"\u65e9\u9910\u9ad8\u5cf0","__typename":"AppliedTranslationNode"},{"questionId":"100209","title":"\u6768\u67f3\u7d6e\u6291\u5236\u5242","__typename":"AppliedTranslationNode"},{"questionId":"100210","title":"\u642c\u5bb6\u6253\u5305","__typename":"AppliedTranslationNode"},{"questionId":"100211","title":" \u671f\u4e2d\u8003\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100212","title":"\u5468\u516d\u5bb5\u591c\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100213","title":"\u51fa\u6e38\u603b\u7ed3","__typename":"AppliedTranslationNode"},{"questionId":"100214","title":"\u9910\u5385\u4f18\u60e0\u5238","__typename":"AppliedTranslationNode"},{"questionId":"100215","title":"\u51fa\u5dee\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100216","title":"\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"100217","title":"\u6700\u62e5\u5835\u7684\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"100218","title":"\u5165\u5b66\u8003\u8bd5\u7b97\u6cd5\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100219","title":"\u5783\u573e\u90ae\u4ef6\u8fc7\u6ee4\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"100220","title":"\u672c\u5468\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"100221","title":"\u4e34\u65f6\u70b9\u9910\u5458","__typename":"AppliedTranslationNode"},{"questionId":"100222","title":"\u5c0f\u7ec4\u8ba8\u8bba","__typename":"AppliedTranslationNode"},{"questionId":"100223","title":"\u91c7\u8d2d\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"100226","title":"\u7b97\u6cd5\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"100228","title":"\u52a8\u7269\u6536\u5bb9\u6240","__typename":"AppliedTranslationNode"},{"questionId":"100229","title":"\u68c0\u67e5\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100230","title":"\u7ffb\u8f6c\u6570\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"100231","title":"\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"100232","title":"\u641c\u7d22\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100233","title":"\u516b\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"100234","title":"\u57fa\u7ad9\u5730\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"100235","title":"\u7f16\u7a0b\u8bed\u8a00\u504f\u597d\u8c03\u67e5","__typename":"AppliedTranslationNode"},{"questionId":"100236","title":"\u964d\u566a\u8033\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100237","title":"\u51fa\u5dee\u8def\u7ebf II","__typename":"AppliedTranslationNode"},{"questionId":"100238","title":"\u4e92\u4fe1\u534f\u5546\u673a\u5236 II","__typename":"AppliedTranslationNode"},{"questionId":"100239","title":"TLV \u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"100240","title":"\u9b54\u672f\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"100241","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100242","title":"\u7a00\u758f\u6570\u7ec4\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"100246","title":"\u5458\u5de5\u8fd0\u52a8\u4f1a","__typename":"AppliedTranslationNode"},{"questionId":"100247","title":"\u65f6\u95f4\u7247\u8f6e\u8f6c\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100248","title":"\u6700\u77ed\u5269\u4f59\u65f6\u95f4\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100249","title":"\u6570\u636e\u590d\u539f","__typename":"AppliedTranslationNode"},{"questionId":"100250","title":"\u8eab\u9ad8\u4f18\u52bf","__typename":"AppliedTranslationNode"},{"questionId":"100251","title":"\u5b9a\u4ef7\u7b56\u7565","__typename":"AppliedTranslationNode"},{"questionId":"100252","title":"\u4e1a\u7ee9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"100253","title":"\u8bfb\u4e66\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100254","title":"\u5956\u91d1\u8ba1\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100255","title":"\u529e\u516c\u5ba4\u996e\u6c34\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100256","title":"\u9ad8\u94c1\u9009\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"100257","title":"\u5730\u94c1\u7968","__typename":"AppliedTranslationNode"},{"questionId":"100258","title":"\u4ea4\u6362\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100259","title":"\u5355\u8bcd\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"100260","title":"\u4ea4\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100261","title":"\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100262","title":"\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100263","title":"SyM \u7684 \ud83d\udd11","__typename":"AppliedTranslationNode"},{"questionId":"100264","title":"\u5206\u82f9\u679c","__typename":"AppliedTranslationNode"},{"questionId":"100265","title":"qqqqqqqqqqqqqqqy \u7684\u70ed\u8eab\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100266","title":"\u5c0f\u80d6\u5b50\u7684\u65e5\u5e38","__typename":"AppliedTranslationNode"},{"questionId":"100267","title":"\u7406\u7425\u73c0\u73e0","__typename":"AppliedTranslationNode"},{"questionId":"100269","title":"\u72fc\u4eba\u6740\u6a21\u62df\u5668","__typename":"AppliedTranslationNode"},{"questionId":"100272","title":"\ud83d\udc2d\u5e74\u5feb\u4e50","__typename":"AppliedTranslationNode"},{"questionId":"100273","title":"\u7528\u4e24\u4e2a\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100274","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100275","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100276","title":"\u4e8c\u7ef4\u6570\u7ec4\u4e2d\u7684\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"100277","title":"\u9752\u86d9\u8df3\u53f0\u9636\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100278","title":"\u65cb\u8f6c\u6570\u7ec4\u7684\u6700\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100279","title":"\u77e9\u9635\u4e2d\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100280","title":"\u66ff\u6362\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"100281","title":"\u673a\u5668\u4eba\u7684\u8fd0\u52a8\u8303\u56f4","__typename":"AppliedTranslationNode"},{"questionId":"100282","title":"\u4ece\u5c3e\u5230\u5934\u6253\u5370\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100283","title":"\u91cd\u5efa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100284","title":"\u526a\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100285","title":"\u526a\u7ef3\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"100286","title":"\u5408\u5e76\u4e24\u4e2a\u6392\u5e8f\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100287","title":"\u6811\u7684\u5b50\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"100288","title":"\u4e8c\u53c9\u6811\u7684\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"100289","title":"\u5bf9\u79f0\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100290","title":"\u8868\u793a\u6570\u503c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100291","title":"\u8c03\u6574\u6570\u7ec4\u987a\u5e8f\u4f7f\u5947\u6570\u4f4d\u4e8e\u5076\u6570\u524d\u9762","__typename":"AppliedTranslationNode"},{"questionId":"100292","title":"\u4e8c\u8fdb\u5236\u4e2d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100293","title":"\u987a\u65f6\u9488\u6253\u5370\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100294","title":"\u94fe\u8868\u4e2d\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100295","title":"\u6570\u503c\u7684\u6574\u6570\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"100296","title":"\u6253\u5370\u4ece1\u5230\u6700\u5927\u7684n\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100297","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"100298","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100299","title":"\u5220\u9664\u94fe\u8868\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100300","title":"\u590d\u6742\u94fe\u8868\u7684\u590d\u5236","__typename":"AppliedTranslationNode"},{"questionId":"100301","title":"\u6700\u5c0f\u7684k\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100302","title":"\u5305\u542bmin\u51fd\u6570\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"100303","title":"\u6570\u636e\u6d41\u4e2d\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100304","title":"\u8fde\u7eed\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100305","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e0e\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100306","title":"\u6808\u7684\u538b\u5165\u3001\u5f39\u51fa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100307","title":"\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100308","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100309","title":"1\uff5en \u6574\u6570\u4e2d 1 \u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100310","title":"\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc7\u4e00\u534a\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100311","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100312","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"100313","title":"\u6570\u5b57\u5e8f\u5217\u4e2d\u67d0\u4e00\u4f4d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100314","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 III","__typename":"AppliedTranslationNode"},{"questionId":"100315","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u540e\u5e8f\u904d\u5386\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100316","title":"\u7b2c\u4e00\u4e2a\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"100317","title":"\u4e8c\u53c9\u6811\u4e2d\u548c\u4e3a\u67d0\u4e00\u503c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100318","title":"\u6570\u7ec4\u4e2d\u7684\u9006\u5e8f\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"100319","title":"\u4e8c\u53c9\u6811\u7684\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100320","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100321","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"100322","title":"\u548c\u4e3as\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100323","title":"\u628a\u6570\u7ec4\u6392\u6210\u6700\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100324","title":"\u548c\u4e3as\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100325","title":"\u628a\u6570\u5b57\u7ffb\u8bd1\u6210\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100326","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u516c\u5171\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100327","title":"\u793c\u7269\u7684\u6700\u5927\u4ef7\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100328","title":"\u7ffb\u8f6c\u5355\u8bcd\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100329","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u6570\u5b57 I","__typename":"AppliedTranslationNode"},{"questionId":"100330","title":"\u5de6\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100331","title":"0\uff5en-1\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100332","title":"\u6700\u957f\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100333","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u7b2ck\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100334","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100335","title":"\u4e0d\u7528\u52a0\u51cf\u4e58\u9664\u505a\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100336","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100337","title":"\u961f\u5217\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100338","title":"\u6784\u5efa\u4e58\u79ef\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100339","title":"n\u4e2a\u9ab0\u5b50\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100340","title":"\u628a\u5b57\u7b26\u4e32\u8f6c\u6362\u6210\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100341","title":"\u6251\u514b\u724c\u4e2d\u7684\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100342","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100343","title":"\u5706\u5708\u4e2d\u6700\u540e\u5269\u4e0b\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100344","title":"\u80a1\u7968\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"100345","title":"\u6c421+2+\u2026+n","__typename":"AppliedTranslationNode"},{"questionId":"100346","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100347","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100348","title":"\u6709\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100349","title":"\u6700\u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100350","title":"\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100351","title":"\u751f\u5b58\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100352","title":"\u8df3\u6c34\u677f","__typename":"AppliedTranslationNode"},{"questionId":"100353","title":"\u5e73\u5206\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"100354","title":"\u6700\u4f73\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100355","title":"\u73e0\u7391\u5999\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100356","title":"\u90e8\u5206\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000001","title":"test-1","__typename":"AppliedTranslationNode"},{"questionId":"1000002","title":"\u627e\u51fa\u9690\u85cf\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000003","title":"\u8fde\u7eed\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000004","title":"\u6a21\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000005","title":"\u6c34\u57df\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"1000006","title":"\u4e00\u6b21\u7f16\u8f91","__typename":"AppliedTranslationNode"},{"questionId":"1000007","title":"\u8fd4\u56de\u5012\u6570\u7b2c k \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000008","title":"\u5206\u5272\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000009","title":"\u6c42\u548c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000010","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000011","title":"\u8ff7\u8def\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000012","title":"\u5408\u5e76\u6392\u5e8f\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000013","title":"\u5cf0\u4e0e\u8c37","__typename":"AppliedTranslationNode"},{"questionId":"1000015","title":"\u6c49\u8bfa\u5854\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000016","title":"\u6392\u5e8f\u77e9\u9635\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"1000017","title":"\u9636\u4e58\u5c3e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000018","title":"\u6574\u6570\u7684\u82f1\u8bed\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"1000019","title":"BiNode","__typename":"AppliedTranslationNode"},{"questionId":"1000020","title":"\u6062\u590d\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1000021","title":"\u6700\u5c0fK\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000022","title":"\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000023","title":"\u6309\u6469\u5e08","__typename":"AppliedTranslationNode"},{"questionId":"1000024","title":"\u591a\u6b21\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"1000025","title":"\u4e0d\u7528\u52a0\u53f7\u7684\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000026","title":"LRU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000027","title":"\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000028","title":"\u8fde\u7eed\u4e2d\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000029","title":"\u76f4\u65b9\u56fe\u7684\u6c34\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000030","title":"\u5355\u8bcd\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1000031","title":"\u5e03\u5c14\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"1000032","title":"\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000033","title":" \u5b57\u6bcd\u4e0e\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000034","title":"2\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000035","title":"\u5a74\u513f\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000036","title":"\u9a6c\u620f\u56e2\u4eba\u5854","__typename":"AppliedTranslationNode"},{"questionId":"1000037","title":"\u7b2c k \u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000038","title":"\u4e3b\u8981\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1000039","title":"\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000040","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000041","title":"\u6570\u5b57\u6d41\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1000042","title":"\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000043","title":"\u6700\u77ed\u8d85\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000044","title":"\u6d88\u5931\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000045","title":"\u6700\u5927\u9ed1\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000046","title":"\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000047","title":"T9\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000048","title":"\u4ea4\u6362\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000049","title":"\u5355\u8bcd\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000050","title":"\u5170\u987f\u8682\u8681","__typename":"AppliedTranslationNode"},{"questionId":"1000051","title":"\u7a00\u758f\u76f8\u4f3c\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000055","title":"\u4e24\u6570\u4e4b\u548c II 3","__typename":"AppliedTranslationNode"},{"questionId":"1000056","title":"\u62ff\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1000057","title":"\u5267\u60c5\u89e6\u53d1\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000058","title":"\u9b54\u672f\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000059","title":"\u5207\u5206\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000060","title":"\u5377\u79ef\u795e\u7ecf\u7f51\u7edc","__typename":"AppliedTranslationNode"},{"questionId":"1000061","title":"\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000062","title":"\u4e8c\u53c9\u6811\u4efb\u52a1\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000063","title":"\u4f20\u9012\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000085","title":"\u6e38\u4e50\u56ed\u7684\u6e38\u89c8\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000086","title":"\u671f\u671b\u4e2a\u6570\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1000087","title":"\u5c0f\u5f20\u5237\u9898\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000088","title":"\u6e38\u4e50\u56ed\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000089","title":"\u4e8c\u53c9\u6811\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000090","title":"\u6700\u5c0f\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000091","title":"\u6700\u5c0f\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000092","title":"\u4f1a\u8bae\u9009\u5740","__typename":"AppliedTranslationNode"},{"questionId":"1000093","title":"\u5bfb\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000095","title":"\u6570\u5b66\u5174\u8da3\u601d\u8003\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000096","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000097","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u524d\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000098","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000099","title":"\u3010\u6807\u7a0b\u6709\u95ee\u9898\u3011\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000100","title":"\u6c42\u4e8c\u7ef4\u6570\u7ec4\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000101","title":"\u6dfb\u52a0\u6700\u5c11\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000102","title":"\u524d\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000103","title":"\u5224\u65ad\u4e8c\u53c9\u6811\u662f\u5426\u662f\u4e00\u4e2a\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000104","title":"\u5c06\u5806\u8f6c\u6362\u4e3a\u4e00\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000105","title":"\u67e5\u627e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000106","title":"\u6811\u4e0a\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1000107","title":"\u4e8c\u53c9\u6811\u4e0a\u4e24\u70b9\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000108","title":"\u5224\u65ad\u8fde\u901a\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000109","title":"\u6700\u5c11\u7684\u64cd\u4f5c\u4f7f\u5c0f\u9547\u5b58\u5728\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1000110","title":"\u6709\u5e8f\u6570\u7ec4\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000111","title":"\u4e8c\u53c9\u67e5\u627e\u6811\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"1000112","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u6700\u540e\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000114","title":"\u5b9e\u73b0\u52a8\u6001\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000115","title":"\u4e58\u79ef\u6700\u5927\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000116","title":"\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1000117","title":"\u6811\u4e0a\u6700\u63a5\u8fd1\u7684\u4e24\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000118","title":"\u7ea6\u745f\u592b\u73af\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000119","title":"\u8ba1\u7b97\u8282\u70b9\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000120","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000121","title":"\u6ed1\u52a8\u7a97\u53e3\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000122","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"1000123","title":"\u5408\u5e76 K \u4e2a\u6700\u5c0f\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000124","title":"\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000125","title":"\u7b80\u5355\u8ba1\u7b97\u5668 V","__typename":"AppliedTranslationNode"},{"questionId":"1000126","title":"\u627e\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570II","__typename":"AppliedTranslationNode"},{"questionId":"1000127","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"1000128","title":"hanhan \u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000129","title":"\u5957\u5708\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000130","title":"\u79cb\u53f6\u6536\u85cf\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000131","title":"\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000132","title":"\u5bfc\u822a\u88c5\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000133","title":"\u5feb\u901f\u516c\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1000134","title":"\u8ffd\u9010\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000135","title":"\u79ef\u5206\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000136","title":"\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000137","title":"\u5927\u6570\u6c42\u4f59","__typename":"AppliedTranslationNode"},{"questionId":"1000138","title":"\u53e4\u8463\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000139","title":"\u901f\u7b97\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000140","title":"\u9ed1\u767d\u65b9\u683c\u753b","__typename":"AppliedTranslationNode"},{"questionId":"1000141","title":"\u6392\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000142","title":"\u7334\u5b50\u6253\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000143","title":"\u5bb6\u65cf\u5173\u7cfb","__typename":"AppliedTranslationNode"},{"questionId":"1000144","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000145","title":"OCR\u8bc6\u522b","__typename":"AppliedTranslationNode"},{"questionId":"1000146","title":"\u65e9\u9910\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000147","title":"\u9ed1\u76d2\u5149\u7ebf\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1000148","title":"\u98de\u8239\u68cb\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000149","title":"\u5206\u5272\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1000150","title":"\u53e4\u8001\u7684\u6e38\u620f\u673a","__typename":"AppliedTranslationNode"},{"questionId":"1000151","title":"01 \u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000152","title":"\u6392\u5217\u5c0f\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1000153","title":"\u82f1\u6587\u5355\u8bcd\u62fc\u5199\u7ea0\u9519\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1000154","title":"\u9b54\u6cd5\u6743\u6756\u5f3a\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1000155","title":"\u706b\u8f66\u7f16\u7ec4\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000156","title":"\u6700\u4fbf\u5b9c\u7684\u673a\u7968","__typename":"AppliedTranslationNode"},{"questionId":"1000157","title":"\u5b85\u7537\u7684\u751f\u6d3b","__typename":"AppliedTranslationNode"},{"questionId":"1000158","title":"\u4ea4\u901a\u8f68\u8ff9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000159","title":"\u7834\u8bd1\u5bc6\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000160","title":"DIST","__typename":"AppliedTranslationNode"},{"questionId":"1000161","title":"Hilbert \u66f2\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000162","title":"\u9879\u76ee\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000163","title":"\u7b97\u5f0f\u8f6c\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1000164","title":"\u5730\u7816\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000166","title":"\u7b80\u5355\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000167","title":"\u591a\u6e90 D \u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000168","title":"\u5de5\u4eba\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000169","title":"\u4e00\u5143\u4e00\u6b21\u65b9\u7a0b\u6c42\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000170","title":"\u5783\u573e\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000171","title":"\u91cd\u590d\u5b57\u7b26\u4e32\u91cd\u547d\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000172","title":"\u5192\u6ce1\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000173","title":"\u627e\u51fa\u6700\u957f\u5b57\u7b26\u4e32\u5e76\u8f93\u51fa","__typename":"AppliedTranslationNode"},{"questionId":"1000174","title":"\u8ba1\u7b97\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000175","title":"\u63a5\u9a7e\u6700\u77ed\u8ddd\u79bb\u7b97\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000176","title":"\u51e0\u4f55\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"1000177","title":"\u5207\u5272\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000178","title":"\u5e8f\u5217\u79fb\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1000179","title":"\u8bf7\u5b9e\u73b0\u51fd\u6570 parseQueryString","__typename":"AppliedTranslationNode"},{"questionId":"1000181","title":"\u8bf7\u5b9e\u73b0\u4e0b\u9762\u7684\u94fe\u5f0f\u8c03\u7528\u51fd\u6570\uff0c\u4ee5\u4f7f\u5176\u80fd\u591f\u5b9e\u73b0\u94fe\u5f0f\u8c03\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1000182","title":"7. \u5316\u5b66\u516c\u5f0f\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000183","title":"3. \u53e4\u751f\u7269\u8840\u7f18\u8fdc\u8fd1\u5224\u5b9a","__typename":"AppliedTranslationNode"},{"questionId":"1000184","title":"10. \u6570\u7ec4\u7ec4\u6210\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000185","title":"16. \u6700\u77ed\u79fb\u52a8\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000186","title":"2. \u53d1\u4e0b\u5348\u8336","__typename":"AppliedTranslationNode"},{"questionId":"1000187","title":"4. \u673a\u5668\u4eba\u8df3\u8dc3\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000188","title":"6. \u590f\u5b63\u7279\u60e0","__typename":"AppliedTranslationNode"},{"questionId":"1000189","title":"\u5c0f\u7f8e\u7684\u7528\u6237\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000190","title":"\u5c0f\u7f8e\u7684\u4ed3\u5e93\u6574\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000191","title":"\u5c0f\u7f8e\u7684\u8dd1\u817f\u4ee3\u8d2d","__typename":"AppliedTranslationNode"},{"questionId":"1000192","title":"\u5c0f\u56e2\u7684\u590d\u5236\u7c98\u8d34","__typename":"AppliedTranslationNode"},{"questionId":"1000193","title":"\u5c0f\u7f8e\u7684\u533a\u57df\u4f1a\u8bae","__typename":"AppliedTranslationNode"},{"questionId":"1000194","title":"\u5c0f\u56e2\u7684\u795e\u79d8\u6697\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000195","title":"\u5c0f\u56e2\u7684\u9009\u8c03\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000196","title":"\u5c0f\u56e2\u65e0\u8def\u53ef\u9003","__typename":"AppliedTranslationNode"},{"questionId":"1000197","title":"\u5c0f\u56e2\u7684\u88c5\u9970\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1000198","title":"\u5c0f\u56e2\u7684\u9ed8\u5951\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000199","title":"\u642d\u914d\u51fa\u552e","__typename":"AppliedTranslationNode"},{"questionId":"1000200","title":"\u5c0f\u7f8e\u7684\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1000201","title":"\u504f\u7231\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000202","title":"\u5c0f\u56e2\u7684 AB \u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000203","title":"\u5341\u5b57\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1000204","title":"\u5b8c\u5168\u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000205","title":"\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000206","title":"5-sum","__typename":"AppliedTranslationNode"},{"questionId":"1000207","title":"\u5e8f\u5217\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000208","title":"\u7f16\u8f91\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"1000209","title":"\u6700\u591a\u7684\u786c\u5e01\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000210","title":"\u6700\u5c11\u7684\u786c\u5e01\u79cd\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000211","title":"\u5b50\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000212","title":"\u5b50\u4e32\u5305\u542b\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000213","title":"\u53d6\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000214","title":"\u6811\u7684\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000215","title":"\u91c7\u8d2d\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1000216","title":"\u4e50\u56e2\u7ad9\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1000217","title":"\u7279\u6b8a\u4e8c\u8fdb\u5236\u8868\u793a\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000218","title":"\u53d8\u6362\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000219","title":"\u6279\u91cf\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1000220","title":"\u7535\u52a8\u8f66\u6e38\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1000221","title":"\u84c4\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"1000222","title":"\u6700\u591a\u724c\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000223","title":"\u5b88\u536b\u57ce\u5821","__typename":"AppliedTranslationNode"},{"questionId":"1000224","title":"\u9b54\u5854\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000225","title":"\u4e0b\u8f7d\u63d2\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"1000226","title":"\u5b8c\u6210\u4e00\u534a\u9898\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000227","title":"\u4e3b\u9898\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000228","title":"\u6574\u6570\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000229","title":"\u5141\u8bb8\u91cd\u590d\u9009\u62e9\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000230","title":"\u524d n \u4e2a\u6570\u5b57\u4e8c\u8fdb\u5236\u4e2d 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000231","title":"\u4e8c\u8fdb\u5236\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000232","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000233","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 ","__typename":"AppliedTranslationNode"},{"questionId":"1000234","title":"\u6ca1\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000235","title":"\u542b\u6709\u91cd\u590d\u5143\u7d20\u96c6\u5408\u7684\u5168\u6392\u5217 ","__typename":"AppliedTranslationNode"},{"questionId":"1000236","title":"\u5355\u8bcd\u957f\u5ea6\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000237","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000238","title":"\u751f\u6210\u5339\u914d\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000239","title":"\u6570\u7ec4\u4e2d\u548c\u4e3a 0 \u7684\u4e09\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000240","title":"\u5206\u5272\u56de\u6587\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000241","title":"\u590d\u539f IP ","__typename":"AppliedTranslationNode"},{"questionId":"1000242","title":"\u548c\u5927\u4e8e\u7b49\u4e8e target \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000243","title":"\u722c\u697c\u68af\u7684\u6700\u5c11\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1000244","title":"\u4e58\u79ef\u5c0f\u4e8e K \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000245","title":"\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000246","title":"\u548c\u4e3a k \u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000247","title":"0 \u548c 1 \u4e2a\u6570\u76f8\u540c\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000248","title":"\u5de6\u53f3\u4e24\u8fb9\u5b50\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1000249","title":"\u4e8c\u7ef4\u5b50\u77e9\u9635\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000250","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000251","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000252","title":"\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000253","title":"\u542b\u6709\u6240\u6709\u5b57\u7b26\u7684\u6700\u77ed\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000254","title":"\u6709\u6548\u7684\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000255","title":"\u6700\u591a\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u5f97\u5230\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1000256","title":"\u56de\u6587\u5b50\u5b57\u7b26\u4e32\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000257","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c n \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000258","title":"\u94fe\u8868\u4e2d\u73af\u7684\u5165\u53e3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000259","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u91cd\u5408\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000260","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000261","title":"\u94fe\u8868\u4e2d\u7684\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1000262","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000263","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000264","title":"\u5c55\u5e73\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000265","title":"\u6392\u5e8f\u7684\u5faa\u73af\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000266","title":"\u73af\u5f62\u623f\u5c4b\u5077\u76d7","__typename":"AppliedTranslationNode"},{"questionId":"1000267","title":"\u63d2\u5165\u3001\u5220\u9664\u548c\u968f\u673a\u8bbf\u95ee\u90fd\u662f O(1) \u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000268","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1000269","title":"\u7ffb\u8f6c\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1000270","title":"\u6700\u8fd1\u6700\u5c11\u4f7f\u7528\u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000271","title":"\u6700\u957f\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000272","title":"\u6700\u5c11\u56de\u6587\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"1000273","title":"\u6709\u6548\u7684\u53d8\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000274","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000275","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000276","title":"\u5916\u661f\u8bed\u8a00\u662f\u5426\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000277","title":"\u5b57\u7b26\u4e32\u4ea4\u7ec7","__typename":"AppliedTranslationNode"},{"questionId":"1000278","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000279","title":"\u540e\u7f00\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1000280","title":"\u5b50\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000281","title":"\u5c0f\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"1000282","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000283","title":"\u76f4\u65b9\u56fe\u6700\u5927\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000284","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1000285","title":"\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000286","title":"\u4e09\u89d2\u5f62\u4e2d\u6700\u5c0f\u8def\u5f84\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000287","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000288","title":"\u52a0\u51cf\u7684\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000289","title":"\u6700\u5c11\u7684\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000290","title":"\u6392\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000291","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000292","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000293","title":"\u6700\u8fd1\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000294","title":"\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000295","title":"\u5f80\u5b8c\u5168\u4e8c\u53c9\u6811\u6dfb\u52a0\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000296","title":"\u77e9\u9635\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000297","title":"\u4e8c\u53c9\u6811\u6bcf\u5c42\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000298","title":"\u4e8c\u53c9\u6811\u6700\u5e95\u5c42\u6700\u5de6\u8fb9\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000299","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u4fa7\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000300","title":"\u5355\u8bcd\u6f14\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"1000301","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"1000302","title":"\u5f00\u5bc6\u7801\u9501","__typename":"AppliedTranslationNode"},{"questionId":"1000303","title":"\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000304","title":"\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000305","title":"\u8ba1\u7b97\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000306","title":"\u4ece\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u7684\u8def\u5f84\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000307","title":"\u5411\u4e0b\u7684\u8def\u5f84\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000308","title":"\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000309","title":"\u8282\u70b9\u4e4b\u548c\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000310","title":"\u8bfe\u7a0b\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000311","title":"\u5c55\u5e73\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000312","title":"\u5916\u661f\u6587\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000313","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"1000314","title":"\u91cd\u5efa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000315","title":"\u6240\u6709\u5927\u4e8e\u7b49\u4e8e\u8282\u70b9\u7684\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000316","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000317","title":"\u76f8\u4f3c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000318","title":"\u591a\u4f59\u7684\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1000319","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u4e24\u4e2a\u8282\u70b9\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000320","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000321","title":"\u503c\u548c\u4e0b\u6807\u4e4b\u5dee\u90fd\u5728\u7ed9\u5b9a\u7684\u8303\u56f4\u5185","__typename":"AppliedTranslationNode"},{"questionId":"1000322","title":"\u65e5\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000323","title":"\u6570\u636e\u6d41\u7684\u7b2c K \u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000324","title":"\u51fa\u73b0\u9891\u7387\u6700\u9ad8\u7684 k \u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000325","title":"\u5b9e\u73b0\u524d\u7f00\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1000326","title":"\u548c\u6700\u5c0f\u7684 k \u4e2a\u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1000327","title":"\u66ff\u6362\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000328","title":"\u795e\u5947\u7684\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"1000329","title":"\u6700\u77ed\u7684\u5355\u8bcd\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000330","title":"\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000331","title":"\u6700\u5927\u7684\u5f02\u6216","__typename":"AppliedTranslationNode"},{"questionId":"1000332","title":"\u67e5\u627e\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000333","title":"\u5c71\u5cf0\u6570\u7ec4\u7684\u9876\u90e8","__typename":"AppliedTranslationNode"},{"questionId":"1000334","title":"\u6392\u5e8f\u6570\u7ec4\u4e2d\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000335","title":"\u6309\u6743\u91cd\u751f\u6210\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000336","title":"\u6c42\u5e73\u65b9\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000337","title":"\u72d2\u72d2\u5403\u9999\u8549","__typename":"AppliedTranslationNode"},{"questionId":"1000338","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000339","title":"\u6570\u7ec4\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000340","title":"\u6570\u7ec4\u4e2d\u7684\u7b2c k \u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000341","title":"\u94fe\u8868\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000342","title":"\u5408\u5e76\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000343","title":"\u6240\u6709\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000344","title":"\u542b\u6709 k \u4e2a\u5143\u7d20\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000345","title":"\u8def\u5f84\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000346","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000347","title":"\u8f66\u961f\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000348","title":"\u8f66\u8f86\u5b89\u6392","__typename":"AppliedTranslationNode"},{"questionId":"1000349","title":"\u8def\u5f84\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000350","title":"\u8c01\u6321\u4f4f\u4e86\u6211\u7684\u7ea2\u7eff\u706f","__typename":"AppliedTranslationNode"},{"questionId":"1000351","title":"\u65b0\u589e\u7684\u4e13\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000352","title":"\u6700\u5927\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000353","title":"\u5f55\u53d6\u5206\u6570\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000354","title":"\u8c03\u6574\u7535\u5e73","__typename":"AppliedTranslationNode"},{"questionId":"1000355","title":"\u7b7e\u5230\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000356","title":"\u81ea\u884c\u8f66\u62c9\u529b\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"1000358","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000359","title":"\u73af\u5f62\u95ef\u5173\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000360","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000361","title":"\u5165\u573a\u5b89\u68c0","__typename":"AppliedTranslationNode"},{"questionId":"1000362","title":"\u5f00\u5e55\u5f0f\u7130\u706b","__typename":"AppliedTranslationNode"},{"questionId":"1000363","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000364","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000367","title":"\u5341\u5b57\u8def\u53e3\u7684\u4ea4\u901a","__typename":"AppliedTranslationNode"},{"questionId":"1000368","title":"\u5fc3\u7b97\u6311\u6218","__typename":"AppliedTranslationNode"},{"questionId":"1000369","title":"\u65e0\u4eba\u673a\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000370","title":"\u9ed1\u767d\u7ffb\u8f6c\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"1000371","title":"\u73a9\u5177\u5957\u5708","__typename":"AppliedTranslationNode"},{"questionId":"1000373","title":"\u5fd7\u613f\u8005\u8c03\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000374","title":"\u65e0\u9650\u68cb\u5c40","__typename":"AppliedTranslationNode"},{"questionId":"1000375","title":"\u81ea\u884c\u8f66\u70ab\u6280\u8d5b\u573a","__typename":"AppliedTranslationNode"},{"questionId":"1000378","title":"\u95f4\u9694\u5220\u9664\u94fe\u8868\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000379","title":"\u5730\u94c1\u8def\u7ebf\u89c4\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000382","title":"\u67f1\u72b6\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000383","title":"\u7535\u5b66\u5b9e\u9a8c\u8bfe","__typename":"AppliedTranslationNode"}]}} \ No newline at end of file From 78a264eeb3b1191f3e592e23c9436358dc49fdd8 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Tue, 12 Oct 2021 16:23:24 +0800 Subject: [PATCH 5/8] =?UTF-8?q?479:=E6=9C=80=E5=A4=A7=E5=9B=9E=E6=96=87?= =?UTF-8?q?=E6=95=B0=E4=B9=98=E7=A7=AF?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../editor/cn/LargestPalindromeProduct.java | 48 +++++++++++++++++++ .../doc/content/LargestPalindromeProduct.md | 16 +++++++ 2 files changed, 64 insertions(+) create mode 100644 src/main/java/leetcode/editor/cn/LargestPalindromeProduct.java create mode 100644 src/main/java/leetcode/editor/cn/doc/content/LargestPalindromeProduct.md diff --git a/src/main/java/leetcode/editor/cn/LargestPalindromeProduct.java b/src/main/java/leetcode/editor/cn/LargestPalindromeProduct.java new file mode 100644 index 0000000..6f721ca --- /dev/null +++ b/src/main/java/leetcode/editor/cn/LargestPalindromeProduct.java @@ -0,0 +1,48 @@ +//你需要找到由两个 n 位数的乘积组成的最大回文数。 +// +// 由于结果会很大，你只需返回最大回文数 mod 1337得到的结果。 +// +// 示例: +// +// 输入: 2 +// +// 输出: 987 +// +// 解释: 99 x 91 = 9009, 9009 % 1337 = 987 +// +// 说明: +// +// n 的取值范围为 [1,8]。 +// Related Topics 数学 👍 41 👎 0 + +package leetcode.editor.cn; + +//479:最大回文数乘积 +class LargestPalindromeProduct { + public static void main(String[] args) { + //测试代码 + Solution solution = new LargestPalindromeProduct().new Solution(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int largestPalindrome(int n) { + if (n == 1) { + return 9; + } + long max = (long) Math.pow(10, n) - 1; + for (long i = max; i > max / 10; i--) { + long mul = Long.parseLong(i + new StringBuilder("" + i).reverse().toString()); + for (long j = max; j * j >= mul; j--) { + if (mul % j == 0) { + return (int) (mul % 1337); + } + } + } + return 0; + } + } +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/LargestPalindromeProduct.md b/src/main/java/leetcode/editor/cn/doc/content/LargestPalindromeProduct.md new file mode 100644 index 0000000..4bef774 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/LargestPalindromeProduct.md @@ -0,0 +1,16 @@ +

    你需要找到由两个 n 位数的乘积组成的最大回文数。

    + +

    由于结果会很大，你只需返回最大回文数 mod 1337得到的结果。

    + +

    示例:

    + +

    输入: 2

    + +

    输出: 987

    + +

    解释: 99 x 91 = 9009, 9009 % 1337 = 987

    + +

    说明:

    + +

    n 的取值范围为 [1,8]。

    +
    Related Topics
  • 数学

  • 👍 41
  • 👎 0
    • \ No newline at end of file From 9f1ecd643547a4e6f47769d6fd820a2f8304e91f Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Wed, 13 Oct 2021 12:09:28 +0800 Subject: [PATCH 6/8] =?UTF-8?q?1:=E4=B8=A4=E6=95=B0=E4=B9=8B=E5=92=8C(?= =?UTF-8?q?=E6=96=B0=E5=A2=9E)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/main/java/leetcode/editor/cn/TwoSum.java | 87 ++++++++++++------- src/main/java/leetcode/editor/cn/doc/all.json | 2 +- 2 files changed, 57 insertions(+), 32 deletions(-) diff --git a/src/main/java/leetcode/editor/cn/TwoSum.java b/src/main/java/leetcode/editor/cn/TwoSum.java index d80b9b0..8911277 100644 --- a/src/main/java/leetcode/editor/cn/TwoSum.java +++ b/src/main/java/leetcode/editor/cn/TwoSum.java @@ -45,54 +45,79 @@ package leetcode.editor.cn; -import java.util.ArrayList; -import java.util.Arrays; -import java.util.List; +import java.util.*; //1:两数之和 -public class TwoSum{ +public class TwoSum { public static void main(String[] args) { //测试代码 Solution solution = new TwoSum().new Solution(); } + //力扣代码 //leetcode submit region begin(Prohibit modification and deletion) -class Solution { - public int[] twoSum(int[] nums, int target) { - int start = 0; - int end = nums.length - 1; - int[] result = new int[2]; - if (nums.length == 2) { - result[0] = start; - result[1] = end; - } else { - List list = new ArrayList(); - for (int i = 0; i < nums.length; i++) { - list.add(nums[i]); + class Solution { + // public int[] twoSum(int[] nums, int target) { +// int start = 0; +// int end = nums.length - 1; +// int[] result = new int[2]; +// if (nums.length == 2) { +// result[0] = start; +// result[1] = end; +// } else { +// List list = new ArrayList(); +// for (int i = 0; i < nums.length; i++) { +// list.add(nums[i]); +// } +// Arrays.sort(nums); +// while (nums[start] + nums[end] != target) { +// if (nums[start] + nums[end] > target) { +// end--; +// } else { +// start++; +// } +// } +// result[0] = list.indexOf(nums[start]); +// list.remove(result[0]); +// result[1] = list.indexOf(nums[end]); +// if (result[1] >= result[0]) { +// result[1]++; +// } +// if (result[0] > result[1]) { +// int temp = result[0]; +// result[0] = result[1]; +// result[1] = temp; +// } +// } +// return result; +// } + public int[] twoSum(int[] nums, int target) { + int[] arrs = new int[2]; + int start = 0; + int end = nums.length - 1; + List list = new ArrayList<>(); + for (int num : nums) { + list.add(num); } Arrays.sort(nums); - while (nums[start] + nums[end] != target) { - if (nums[start] + nums[end] > target) { + while (start < end) { + if (nums[start] + nums[end] < target) { + start++; + } else if (nums[start] + nums[end] > target) { end--; } else { - start++; + break; } } - result[0] = list.indexOf(nums[start]); - list.remove(result[0]); - result[1] = list.indexOf(nums[end]); - if (result[1] >= result[0]) { - result[1]++; - } - if (result[0] > result[1]) { - int temp = result[0]; - result[0] = result[1]; - result[1] = temp; + arrs[0] = list.indexOf(nums[start]); + list.remove(arrs[0]); + arrs[1] = list.indexOf(nums[end]); + if (arrs[1] >= arrs[0]) { + arrs[1]++; } + return arrs; } - 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 0dc26df..2582c3c 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.21318096385887889,"acs":118868,"articleLive":2,"columnArticles":961,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":557592,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.5208388358256746,"acs":2563575,"articleLive":2,"columnArticles":14399,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4922012,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4092251336598347,"acs":1021074,"articleLive":2,"columnArticles":7254,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2495140,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38103160096924754,"acs":1267265,"articleLive":2,"columnArticles":7565,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3325879,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.408848037284457,"acs":524070,"articleLive":2,"columnArticles":3892,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1281821,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35538862037522617,"acs":752212,"articleLive":2,"columnArticles":4067,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2116590,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5072840149444351,"acs":308625,"articleLive":2,"columnArticles":2504,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":608387,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35246209056775984,"acs":849557,"articleLive":2,"columnArticles":5347,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2410350,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21719673866836137,"acs":353047,"articleLive":2,"columnArticles":2715,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1625471,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5837205141204187,"acs":782956,"articleLive":2,"columnArticles":4983,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1341320,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3160573956132484,"acs":207931,"articleLive":2,"columnArticles":1252,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":657890,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.627287329025607,"acs":545198,"articleLive":2,"columnArticles":3094,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":869136,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.664815659291499,"acs":230344,"articleLive":2,"columnArticles":1799,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":346478,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6319294035005562,"acs":474991,"articleLive":2,"columnArticles":3935,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":751652,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4100755286423077,"acs":634263,"articleLive":2,"columnArticles":3955,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1546698,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3366705306665877,"acs":670611,"articleLive":2,"columnArticles":3164,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1991891,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4590473711608537,"acs":264549,"articleLive":2,"columnArticles":1453,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":576300,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5731372926088514,"acs":345721,"articleLive":2,"columnArticles":3115,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":603208,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3985967694546021,"acs":225200,"articleLive":2,"columnArticles":1546,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":564982,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4297038550429128,"acs":528959,"articleLive":2,"columnArticles":3952,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1230985,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44505630193975465,"acs":796568,"articleLive":2,"columnArticles":5646,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1789814,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6674919654822818,"acs":728179,"articleLive":2,"columnArticles":3528,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1090918,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.772772870157779,"acs":357443,"articleLive":2,"columnArticles":2683,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":462546,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5599397325802158,"acs":331500,"articleLive":2,"columnArticles":2136,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":592028,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7031892048942356,"acs":321894,"articleLive":2,"columnArticles":2552,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":457763,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6577211697008446,"acs":234546,"articleLive":2,"columnArticles":2229,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":356604,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5389559442026803,"acs":827057,"articleLive":2,"columnArticles":4602,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1534554,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5970949426876893,"acs":490492,"articleLive":2,"columnArticles":4149,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":821464,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4056846819951332,"acs":476972,"articleLive":2,"columnArticles":3273,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1175721,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.35893215985662763,"acs":80913,"articleLive":2,"columnArticles":602,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":225427,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37313987397758047,"acs":218929,"articleLive":2,"columnArticles":1766,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":586721,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3567568261937925,"acs":194405,"articleLive":2,"columnArticles":1311,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":544923,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4277994696079871,"acs":372959,"articleLive":2,"columnArticles":2459,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":871808,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42350372820677185,"acs":350155,"articleLive":2,"columnArticles":3355,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":826805,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46302275911575835,"acs":521816,"articleLive":2,"columnArticles":4009,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1126977,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6402173374919551,"acs":206908,"articleLive":2,"columnArticles":1465,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":323184,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707056447659941,"acs":102624,"articleLive":2,"columnArticles":868,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":153009,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5804230044599614,"acs":218116,"articleLive":2,"columnArticles":2291,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":375788,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277578404703218,"acs":341905,"articleLive":2,"columnArticles":1993,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":469806,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.622328204095457,"acs":203955,"articleLive":2,"columnArticles":1418,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":327729,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4197507689920385,"acs":167711,"articleLive":2,"columnArticles":1433,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":399549,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5819914413797703,"acs":331571,"articleLive":2,"columnArticles":2473,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":569718,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44900910273081923,"acs":172644,"articleLive":2,"columnArticles":1165,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":384500,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3283809231005726,"acs":85448,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":260210,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.43026782042281314,"acs":207149,"articleLive":2,"columnArticles":1657,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":481442,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7831395359435068,"acs":429628,"articleLive":2,"columnArticles":2747,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":548597,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6380782390544104,"acs":219497,"articleLive":2,"columnArticles":1511,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":343997,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352877159128195,"acs":226337,"articleLive":2,"columnArticles":1905,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":307821,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6653080446495148,"acs":237338,"articleLive":2,"columnArticles":1344,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":356734,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3763049329502735,"acs":219919,"articleLive":2,"columnArticles":1303,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":584417,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7388243659634984,"acs":155855,"articleLive":2,"columnArticles":1559,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":210950,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.822684813343749,"acs":74773,"articleLive":2,"columnArticles":616,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90889,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5527487232273645,"acs":698094,"articleLive":2,"columnArticles":3849,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1262950,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48149001786237705,"acs":192193,"articleLive":2,"columnArticles":2028,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":399163,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43274485735060714,"acs":332091,"articleLive":2,"columnArticles":2545,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":767406,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4697537346399414,"acs":307319,"articleLive":2,"columnArticles":2357,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":654213,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4113969014203784,"acs":87442,"articleLive":2,"columnArticles":937,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":212549,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37668432733230106,"acs":251540,"articleLive":2,"columnArticles":2703,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":667774,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7898142439429363,"acs":129385,"articleLive":2,"columnArticles":1598,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":163817,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5243961519828362,"acs":90924,"articleLive":2,"columnArticles":965,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173388,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41762172253290025,"acs":199543,"articleLive":2,"columnArticles":2030,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":477808,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6623431326981176,"acs":319207,"articleLive":2,"columnArticles":2462,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":481936,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3920361883473691,"acs":184858,"articleLive":2,"columnArticles":1743,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":471533,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6882842498304496,"acs":272999,"articleLive":2,"columnArticles":2110,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":396637,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26958735091696573,"acs":46496,"articleLive":2,"columnArticles":644,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":172471,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45731636680044585,"acs":355290,"articleLive":2,"columnArticles":3211,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":776902,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5428585602742859,"acs":196967,"articleLive":2,"columnArticles":1800,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":362833,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5242959690778576,"acs":37980,"articleLive":2,"columnArticles":576,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72440,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.391981971556719,"acs":392929,"articleLive":2,"columnArticles":1975,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1002416,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5302548608176656,"acs":584764,"articleLive":2,"columnArticles":3644,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1102798,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42157271477358405,"acs":95052,"articleLive":2,"columnArticles":836,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":225470,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142790563787645,"acs":179254,"articleLive":2,"columnArticles":1252,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":291812,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6045861197267691,"acs":134888,"articleLive":2,"columnArticles":992,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":223108,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4613325393568254,"acs":171988,"articleLive":2,"columnArticles":1725,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":372807,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5964194050207637,"acs":273741,"articleLive":2,"columnArticles":1892,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":458974,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42716847972567434,"acs":188603,"articleLive":2,"columnArticles":1286,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":441519,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7699927361438518,"acs":224727,"articleLive":2,"columnArticles":1323,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":291856,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015950381081778,"acs":317414,"articleLive":2,"columnArticles":2076,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":395978,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45865168494107184,"acs":227932,"articleLive":2,"columnArticles":1437,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":496961,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6167971536117879,"acs":149606,"articleLive":2,"columnArticles":1338,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":242553,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4148180689144911,"acs":125587,"articleLive":2,"columnArticles":1002,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":302752,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5308257097088691,"acs":184575,"articleLive":2,"columnArticles":1707,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":347713,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.538555544023062,"acs":321704,"articleLive":2,"columnArticles":1970,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":597346,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43353542813870216,"acs":185489,"articleLive":2,"columnArticles":1172,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":427852,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5159853317823554,"acs":98918,"articleLive":2,"columnArticles":698,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":191707,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6326085706369163,"acs":121006,"articleLive":2,"columnArticles":1115,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":191281,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4870663632563972,"acs":41952,"articleLive":2,"columnArticles":313,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86132,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5173994896587011,"acs":473256,"articleLive":2,"columnArticles":3308,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":914682,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7100733583825372,"acs":59529,"articleLive":2,"columnArticles":484,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":83835,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6336834113627736,"acs":140224,"articleLive":2,"columnArticles":1234,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":221284,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3095164266981478,"acs":165699,"articleLive":2,"columnArticles":1536,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":535348,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5489055599188095,"acs":215261,"articleLive":2,"columnArticles":2053,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":392164,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5408925606082142,"acs":156021,"articleLive":2,"columnArticles":1350,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":288451,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7557454517645755,"acs":573177,"articleLive":2,"columnArticles":2348,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":758426,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.702441385987966,"acs":101566,"articleLive":2,"columnArticles":635,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":144590,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.699626503071632,"acs":165589,"articleLive":2,"columnArticles":1309,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":236682,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4558929941892336,"acs":62373,"articleLive":2,"columnArticles":550,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":136815,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35031092069962355,"acs":353724,"articleLive":2,"columnArticles":1962,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1009743,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6115213057141892,"acs":72387,"articleLive":2,"columnArticles":595,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":118372,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6020445513490902,"acs":253297,"articleLive":2,"columnArticles":1904,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":420728,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5639435715018272,"acs":417907,"articleLive":2,"columnArticles":2292,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":741044,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420849359483772,"acs":403987,"articleLive":2,"columnArticles":2540,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":629180,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718605864754749,"acs":176431,"articleLive":2,"columnArticles":1605,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":308521,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661914287055069,"acs":522469,"articleLive":2,"columnArticles":2587,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":681904,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7047355236804079,"acs":252635,"articleLive":2,"columnArticles":1451,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":358482,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7217279388204131,"acs":135145,"articleLive":2,"columnArticles":897,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":187252,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6974867780833509,"acs":164851,"articleLive":2,"columnArticles":1321,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":236350,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7603493682179795,"acs":194305,"articleLive":2,"columnArticles":1203,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":255547,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7630374379647624,"acs":95018,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124526,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5636201318751801,"acs":260109,"articleLive":2,"columnArticles":1486,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":461497,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48653591629808823,"acs":275337,"articleLive":2,"columnArticles":1813,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":565913,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5263323933258184,"acs":273616,"articleLive":2,"columnArticles":1715,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":519854,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6276840596488327,"acs":182174,"articleLive":2,"columnArticles":1282,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":290232,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.726093624832439,"acs":180374,"articleLive":2,"columnArticles":1355,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":248417,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.522111019138636,"acs":62445,"articleLive":2,"columnArticles":686,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":119601,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7046082044795324,"acs":161542,"articleLive":2,"columnArticles":1235,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":229265,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6147086902152721,"acs":91433,"articleLive":2,"columnArticles":778,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":148742,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7310700610197056,"acs":219370,"articleLive":2,"columnArticles":1769,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":300067,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6676759582198829,"acs":146639,"articleLive":2,"columnArticles":1222,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":219626,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6815867987494028,"acs":181161,"articleLive":2,"columnArticles":1597,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":265793,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5734746505336994,"acs":571971,"articleLive":2,"columnArticles":3435,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":997378,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6896413844808197,"acs":469132,"articleLive":2,"columnArticles":2678,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":680255,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5368804852865255,"acs":133112,"articleLive":2,"columnArticles":827,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":247936,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4449437894159583,"acs":162271,"articleLive":2,"columnArticles":1105,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":364700,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47292957718032697,"acs":280993,"articleLive":2,"columnArticles":1854,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":594154,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39605874894336435,"acs":37483,"articleLive":2,"columnArticles":330,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94640,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46856540878136876,"acs":124540,"articleLive":2,"columnArticles":659,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":265790,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5432404308574964,"acs":173844,"articleLive":2,"columnArticles":1133,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":320013,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6826108786610878,"acs":122358,"articleLive":2,"columnArticles":1129,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":179250,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.445310531298313,"acs":130769,"articleLive":2,"columnArticles":1188,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":293658,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7229338920074418,"acs":135613,"articleLive":2,"columnArticles":883,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":187587,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49232317650773605,"acs":49894,"articleLive":2,"columnArticles":442,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101344,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6760743417846075,"acs":73517,"articleLive":2,"columnArticles":529,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":108741,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5762139351239745,"acs":127258,"articleLive":2,"columnArticles":983,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":220852,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48603489347748513,"acs":100791,"articleLive":2,"columnArticles":807,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":207374,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192382743356566,"acs":507916,"articleLive":2,"columnArticles":2301,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":706186,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197507504516937,"acs":101184,"articleLive":2,"columnArticles":760,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":140582,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6615018225436421,"acs":113605,"articleLive":2,"columnArticles":860,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":171738,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5158303964527363,"acs":197301,"articleLive":2,"columnArticles":1224,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":382492,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4904606072760089,"acs":53805,"articleLive":2,"columnArticles":547,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109703,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5124914909720999,"acs":538298,"articleLive":2,"columnArticles":2773,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1050355,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5529149205337903,"acs":302006,"articleLive":2,"columnArticles":1763,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":546207,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.621267840575321,"acs":129238,"articleLive":2,"columnArticles":1092,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":208023,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7038631858843004,"acs":420093,"articleLive":2,"columnArticles":1868,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":596839,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.750637830199788,"acs":305984,"articleLive":2,"columnArticles":1573,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":407632,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5260454911397556,"acs":237842,"articleLive":2,"columnArticles":1400,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":452132,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6818252492817306,"acs":100859,"articleLive":2,"columnArticles":790,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":147925,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671540965986139,"acs":213520,"articleLive":2,"columnArticles":1260,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":320046,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3417442465595004,"acs":47281,"articleLive":2,"columnArticles":517,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138352,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5354563335642674,"acs":134482,"articleLive":2,"columnArticles":1060,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":251154,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48409647370050374,"acs":172014,"articleLive":2,"columnArticles":1438,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":355330,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42143572485474035,"acs":186841,"articleLive":2,"columnArticles":1254,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":443344,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5669202114844418,"acs":214132,"articleLive":2,"columnArticles":1518,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":377711,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5316413867570197,"acs":114229,"articleLive":2,"columnArticles":900,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":214861,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5734799311689259,"acs":290943,"articleLive":2,"columnArticles":1615,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":507329,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7244775139511982,"acs":6621,"articleLive":2,"columnArticles":115,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9139,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5333333333333333,"acs":5560,"articleLive":2,"columnArticles":82,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10425,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5919048612559983,"acs":2837,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4793,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5470744862429167,"acs":16026,"articleLive":2,"columnArticles":193,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29294,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6145727319316024,"acs":340579,"articleLive":2,"columnArticles":1993,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":554172,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3363464829523016,"acs":7665,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22789,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49722855414250183,"acs":162726,"articleLive":2,"columnArticles":1103,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":327266,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3263489838822705,"acs":9314,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28540,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6099156940370454,"acs":59468,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97502,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192276576236449,"acs":86643,"articleLive":2,"columnArticles":926,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":166869,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3310107307428608,"acs":41520,"articleLive":2,"columnArticles":377,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":125434,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5867750028082526,"acs":297749,"articleLive":2,"columnArticles":1955,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":507433,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325334011960809,"acs":84982,"articleLive":2,"columnArticles":759,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":196475,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6647563206736173,"acs":392054,"articleLive":2,"columnArticles":2214,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":589771,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41868295733320504,"acs":8704,"articleLive":2,"columnArticles":88,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20789,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7181573799289355,"acs":107929,"articleLive":2,"columnArticles":920,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":150286,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.44013886957480786,"acs":91787,"articleLive":2,"columnArticles":597,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":208541,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8046317218845146,"acs":75847,"articleLive":2,"columnArticles":634,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94263,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4806113395233751,"acs":38459,"articleLive":2,"columnArticles":409,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":80021,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7395100818133079,"acs":307597,"articleLive":2,"columnArticles":1475,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":415947,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35586956916581325,"acs":254714,"articleLive":2,"columnArticles":1023,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":715751,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46296243414195354,"acs":129698,"articleLive":2,"columnArticles":501,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":280148,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6034958739684921,"acs":120669,"articleLive":2,"columnArticles":675,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":199950,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096241577941487,"acs":122383,"articleLive":2,"columnArticles":971,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":298769,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.486859381033817,"acs":88253,"articleLive":2,"columnArticles":515,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":181270,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7017473141092008,"acs":165385,"articleLive":2,"columnArticles":680,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":235676,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7966728683656707,"acs":182842,"articleLive":2,"columnArticles":592,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":229507,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6768268767938959,"acs":151861,"articleLive":2,"columnArticles":546,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":224372,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47701167960561175,"acs":103533,"articleLive":2,"columnArticles":678,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":217045,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4966336853345167,"acs":71626,"articleLive":2,"columnArticles":633,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":144223,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7567114093959731,"acs":7667,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10132,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5212064290153099,"acs":73807,"articleLive":2,"columnArticles":543,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":141608,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3926733469012094,"acs":90876,"articleLive":2,"columnArticles":702,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":231429,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45023112321756537,"acs":349084,"articleLive":2,"columnArticles":1737,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":775344,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6986254709713933,"acs":133318,"articleLive":2,"columnArticles":837,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":190829,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7492915972535771,"acs":192505,"articleLive":2,"columnArticles":1214,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":256916,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3562300319488818,"acs":21854,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61348,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32510385020770044,"acs":26218,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80645,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3450058362514591,"acs":10345,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29985,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4363833705289089,"acs":35783,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":81999,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.665288988507832,"acs":102698,"articleLive":2,"columnArticles":394,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":154366,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5337748863897435,"acs":95258,"articleLive":2,"columnArticles":508,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":178461,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5158842415147221,"acs":394637,"articleLive":2,"columnArticles":2717,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":764972,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6525231598220816,"acs":143621,"articleLive":2,"columnArticles":1604,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":220101,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.557533802055165,"acs":335036,"articleLive":2,"columnArticles":2142,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":600925,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5244712041884817,"acs":50087,"articleLive":2,"columnArticles":327,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95500,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6193951395139514,"acs":172037,"articleLive":2,"columnArticles":1400,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":277750,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5165255031538385,"acs":236985,"articleLive":2,"columnArticles":1682,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":458806,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37786732658311084,"acs":170100,"articleLive":2,"columnArticles":737,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":450158,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5007237025669643,"acs":114854,"articleLive":2,"columnArticles":884,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":229376,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7233606885668742,"acs":722429,"articleLive":2,"columnArticles":7408,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":998712,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5432104348743692,"acs":144136,"articleLive":2,"columnArticles":948,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":265341,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167121863676259,"acs":146167,"articleLive":2,"columnArticles":989,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":203941,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47310571184589034,"acs":198342,"articleLive":2,"columnArticles":1407,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":419234,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.542586071870535,"acs":90760,"articleLive":2,"columnArticles":680,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":167273,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4827298869354944,"acs":29545,"articleLive":2,"columnArticles":328,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61204,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4628048237146167,"acs":62325,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":134668,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4332454894561712,"acs":169003,"articleLive":2,"columnArticles":1552,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":390086,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37159962937445057,"acs":31282,"articleLive":2,"columnArticles":307,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84182,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.646274659362757,"acs":447372,"articleLive":2,"columnArticles":2328,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":692232,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7368233462808594,"acs":101297,"articleLive":2,"columnArticles":1045,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":137478,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5578641034476072,"acs":373996,"articleLive":2,"columnArticles":1745,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":670407,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5421862154014798,"acs":31655,"articleLive":2,"columnArticles":281,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58384,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4248855234055791,"acs":111996,"articleLive":2,"columnArticles":900,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":263591,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28654475151290437,"acs":64917,"articleLive":2,"columnArticles":424,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":226551,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47696996493264976,"acs":141320,"articleLive":2,"columnArticles":1006,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":296287,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7819256040695209,"acs":118052,"articleLive":2,"columnArticles":887,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":150976,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5232128392061564,"acs":41338,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":79008,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4178934327542183,"acs":71848,"articleLive":2,"columnArticles":660,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":171929,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6752804230719991,"acs":137140,"articleLive":2,"columnArticles":4761,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":203086,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7879761953163116,"acs":310097,"articleLive":2,"columnArticles":1880,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":393536,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43754297731801456,"acs":87173,"articleLive":2,"columnArticles":704,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":199233,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5798904026946861,"acs":57673,"articleLive":2,"columnArticles":650,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99455,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4644393193293025,"acs":37255,"articleLive":2,"columnArticles":319,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80215,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7419610134381474,"acs":139689,"articleLive":2,"columnArticles":882,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":188270,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5045027111342197,"acs":169803,"articleLive":2,"columnArticles":1226,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":336575,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6909483328570271,"acs":161988,"articleLive":2,"columnArticles":1283,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":234443,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4771152707188408,"acs":34640,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72603,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49709311956784114,"acs":315078,"articleLive":2,"columnArticles":2017,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":633841,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.666025841469111,"acs":172528,"articleLive":2,"columnArticles":988,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":259041,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6809015914257875,"acs":262062,"articleLive":2,"columnArticles":1410,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":384875,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481662768548212,"acs":211056,"articleLive":2,"columnArticles":1018,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":248838,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7233999804231687,"acs":140417,"articleLive":2,"columnArticles":883,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":194107,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4969244299360555,"acs":196067,"articleLive":2,"columnArticles":1340,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":394561,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.478523201091027,"acs":171229,"articleLive":2,"columnArticles":774,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":357828,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7381616240753969,"acs":32034,"articleLive":2,"columnArticles":288,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43397,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.645755264973839,"acs":295712,"articleLive":2,"columnArticles":1713,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":457932,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6565233370084528,"acs":8932,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13605,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5514729861941515,"acs":5073,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9199,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.601019143368682,"acs":4364,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7261,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4756853785900783,"acs":5830,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12256,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5243926922304758,"acs":5224,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9962,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46416083916083917,"acs":2655,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5720,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6376637554585153,"acs":5841,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9160,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6349295774647887,"acs":4508,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7100,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.54386225322844,"acs":3664,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6737,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5644592839918382,"acs":12172,"articleLive":2,"columnArticles":158,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21564,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5011042300505012,"acs":32447,"articleLive":2,"columnArticles":349,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":64751,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5701129262142309,"acs":5200,"articleLive":2,"columnArticles":77,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9121,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47508606631636163,"acs":5244,"articleLive":2,"columnArticles":61,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11038,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.640968565068679,"acs":11806,"articleLive":2,"columnArticles":187,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18419,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6828636507853825,"acs":144201,"articleLive":2,"columnArticles":1071,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":211171,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.692184449444498,"acs":79062,"articleLive":2,"columnArticles":656,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114221,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5656997939451577,"acs":7138,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12618,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7231867708562624,"acs":52567,"articleLive":2,"columnArticles":449,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72688,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49407091871977893,"acs":8583,"articleLive":2,"columnArticles":118,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17372,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43444493149453195,"acs":38653,"articleLive":2,"columnArticles":376,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":88971,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152411927764673,"acs":107249,"articleLive":2,"columnArticles":838,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":208153,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.580042511633251,"acs":100968,"articleLive":2,"columnArticles":615,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":174070,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5895133008296981,"acs":6892,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11691,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6742492267784097,"acs":6758,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10023,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44742990654205606,"acs":3447,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7704,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6257598582550511,"acs":153278,"articleLive":2,"columnArticles":1109,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":244947,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3385495982775823,"acs":6447,"articleLive":2,"columnArticles":108,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19043,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5538280197575214,"acs":9867,"articleLive":2,"columnArticles":139,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17816,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5536382536382536,"acs":2663,"articleLive":2,"columnArticles":46,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4810,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6477060798209623,"acs":3473,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5362,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3672648596989567,"acs":27669,"articleLive":2,"columnArticles":340,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":75338,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44000326290888325,"acs":53940,"articleLive":2,"columnArticles":564,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122590,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46211298207495927,"acs":51045,"articleLive":2,"columnArticles":418,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110460,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4920821519950211,"acs":7116,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14461,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5700806574341805,"acs":7492,"articleLive":2,"columnArticles":85,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13142,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45330910440531075,"acs":188092,"articleLive":2,"columnArticles":1068,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":414931,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6322779761043057,"acs":205276,"articleLive":2,"columnArticles":1207,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":324661,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6850460494425594,"acs":5653,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8252,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7586713697824808,"acs":2581,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3402,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.391773079338497,"acs":7486,"articleLive":2,"columnArticles":81,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":19108,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6390294157169641,"acs":499328,"articleLive":2,"columnArticles":3411,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":781385,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7711943647924199,"acs":24743,"articleLive":2,"columnArticles":207,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32084,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6348469347603684,"acs":8067,"articleLive":2,"columnArticles":103,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12707,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5096212986556542,"acs":11600,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22762,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6594846783437863,"acs":180650,"articleLive":2,"columnArticles":1232,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":273926,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4320972495088409,"acs":3519,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8144,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533332390741867,"acs":53281,"articleLive":2,"columnArticles":831,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70727,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4565660439379828,"acs":83337,"articleLive":2,"columnArticles":1109,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":182530,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5315635451505016,"acs":2543,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4784,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7083123084686104,"acs":115105,"articleLive":2,"columnArticles":767,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162506,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7117259174311926,"acs":4965,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6976,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5811284666879184,"acs":3646,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6274,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5232698590270516,"acs":64549,"articleLive":2,"columnArticles":505,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123357,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6203542030431529,"acs":2487,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4009,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5604982393994982,"acs":106331,"articleLive":2,"columnArticles":762,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":189708,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5773448436770882,"acs":4949,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8572,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5045627376425855,"acs":30521,"articleLive":2,"columnArticles":362,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60490,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5167496841012681,"acs":366421,"articleLive":2,"columnArticles":2031,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":709088,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5237782057907017,"acs":33449,"articleLive":2,"columnArticles":235,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":63861,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6556527372853903,"acs":2024,"articleLive":2,"columnArticles":39,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3087,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7264936241104223,"acs":129953,"articleLive":2,"columnArticles":797,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":178877,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5470849323065564,"acs":63725,"articleLive":2,"columnArticles":568,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116481,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3836077181802089,"acs":4334,"articleLive":2,"columnArticles":65,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11298,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33741234430560796,"acs":16985,"articleLive":2,"columnArticles":252,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50339,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5398436274839259,"acs":24097,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44637,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6104525862068966,"acs":2266,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3712,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6086568724946433,"acs":118738,"articleLive":2,"columnArticles":945,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":195082,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3794065956786933,"acs":22020,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":58038,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7611146564560731,"acs":3578,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4701,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6831192925812591,"acs":56703,"articleLive":2,"columnArticles":383,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":83006,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6292611018979178,"acs":40980,"articleLive":2,"columnArticles":355,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65124,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5463281528057895,"acs":4605,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8429,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.418167580266249,"acs":50730,"articleLive":2,"columnArticles":481,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121315,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4763502862067274,"acs":67989,"articleLive":2,"columnArticles":538,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":142729,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48338572070049396,"acs":4306,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8908,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6852894568259214,"acs":20325,"articleLive":2,"columnArticles":180,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29659,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.51848198874717,"acs":23130,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44611,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6771402550091075,"acs":2974,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4392,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42436654600876356,"acs":26730,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62988,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4449372692133279,"acs":309069,"articleLive":2,"columnArticles":1832,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":694635,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6320711152158854,"acs":10950,"articleLive":2,"columnArticles":150,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17324,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784261583943666,"acs":25473,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67313,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.537479241825574,"acs":9386,"articleLive":2,"columnArticles":104,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17463,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044711264425675,"acs":136297,"articleLive":2,"columnArticles":581,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":270178,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4210293492131008,"acs":24746,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58775,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6559193572836137,"acs":129813,"articleLive":2,"columnArticles":1072,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":197910,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4860505442433815,"acs":56621,"articleLive":2,"columnArticles":493,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":116492,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5339092751013057,"acs":18973,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35536,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47994295262726566,"acs":45094,"articleLive":2,"columnArticles":506,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93957,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4496962879640045,"acs":39978,"articleLive":2,"columnArticles":330,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":88900,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4694138473642801,"acs":4773,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10168,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.412091062245861,"acs":46720,"articleLive":2,"columnArticles":309,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":113373,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3700595889578013,"acs":3043,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8223,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40137651968134114,"acs":22219,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55357,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6079193478401359,"acs":131696,"articleLive":2,"columnArticles":929,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":216634,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869789501992519,"acs":160949,"articleLive":2,"columnArticles":1384,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":204515,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8092048401037165,"acs":3745,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4628,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4947407652807686,"acs":11947,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24148,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7273696025916085,"acs":51193,"articleLive":2,"columnArticles":489,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70381,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5162168853676653,"acs":87570,"articleLive":2,"columnArticles":772,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":169638,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6061407087106687,"acs":111442,"articleLive":2,"columnArticles":1057,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":183855,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7691634628679209,"acs":372722,"articleLive":2,"columnArticles":1962,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":484581,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5393107135431621,"acs":108944,"articleLive":2,"columnArticles":1034,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":202006,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7060502283105022,"acs":12370,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17520,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223933054393306,"acs":204534,"articleLive":2,"columnArticles":1508,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":328625,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5997807017543859,"acs":4923,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8208,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7389192865418331,"acs":216210,"articleLive":2,"columnArticles":1527,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":292603,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5503954723430974,"acs":252462,"articleLive":2,"columnArticles":1413,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":458692,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5900505161432023,"acs":5373,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9106,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6800198150594452,"acs":20591,"articleLive":2,"columnArticles":341,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":30280,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4267564966313763,"acs":2217,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5195,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45394520706781155,"acs":70470,"articleLive":2,"columnArticles":545,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155239,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4074356821131384,"acs":26685,"articleLive":2,"columnArticles":439,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65495,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3529929577464789,"acs":1604,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4544,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.520653177734867,"acs":24806,"articleLive":2,"columnArticles":388,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47644,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35161366685078516,"acs":4456,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12673,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.72702743216909,"acs":4850,"articleLive":2,"columnArticles":57,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6671,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6019681742043551,"acs":2875,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4776,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5661928412399383,"acs":3306,"articleLive":2,"columnArticles":65,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5839,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6915557404326124,"acs":3325,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4808,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4895785429245353,"acs":33002,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67409,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7212406753042796,"acs":1837,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2547,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36574622525685485,"acs":33961,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92854,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7644959857270295,"acs":4285,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5605,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4388989154452072,"acs":78063,"articleLive":2,"columnArticles":621,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":177861,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4590334637685925,"acs":41879,"articleLive":2,"columnArticles":454,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91233,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6176712328767123,"acs":4509,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7300,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7222963951935915,"acs":3246,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4494,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127677637463427,"acs":80840,"articleLive":2,"columnArticles":507,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131926,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5109481216457961,"acs":14281,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27950,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.417938698253755,"acs":20535,"articleLive":2,"columnArticles":208,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49134,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5154196984564873,"acs":83515,"articleLive":2,"columnArticles":568,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":162033,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4695710541456242,"acs":14691,"articleLive":2,"columnArticles":124,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31286,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4645485844982177,"acs":76369,"articleLive":2,"columnArticles":818,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":164394,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5091792867229985,"acs":65261,"articleLive":2,"columnArticles":554,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":128169,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6391087213198455,"acs":80111,"articleLive":2,"columnArticles":565,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125348,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.638716148445336,"acs":3184,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4985,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5033026047500072,"acs":35051,"articleLive":2,"columnArticles":220,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":69642,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44132621124233196,"acs":21151,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47926,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.63201424614167,"acs":15971,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25270,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.602176191409412,"acs":70672,"articleLive":2,"columnArticles":775,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":117361,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.579443278471225,"acs":52457,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":90530,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4176893061132161,"acs":7386,"articleLive":2,"columnArticles":85,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17683,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7496250374962504,"acs":22491,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30003,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5341569455634109,"acs":224097,"articleLive":2,"columnArticles":1214,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":419534,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.527628615970899,"acs":6092,"articleLive":2,"columnArticles":110,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11546,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6916267337494104,"acs":101176,"articleLive":2,"columnArticles":993,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":146287,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46710656548993734,"acs":7079,"articleLive":2,"columnArticles":96,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15155,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3576810702752576,"acs":4652,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13006,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152330061238566,"acs":147910,"articleLive":2,"columnArticles":1585,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":287074,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39104551218824857,"acs":11101,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28388,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5529449890626266,"acs":122850,"articleLive":2,"columnArticles":1310,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":222174,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5204966831093724,"acs":52020,"articleLive":2,"columnArticles":429,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":99943,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4288785046728972,"acs":9178,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21400,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37710494571773223,"acs":15631,"articleLive":2,"columnArticles":193,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41450,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6578899746652189,"acs":14542,"articleLive":2,"columnArticles":123,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22104,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5919154646091915,"acs":42348,"articleLive":2,"columnArticles":531,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71544,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41671318761540777,"acs":19408,"articleLive":2,"columnArticles":198,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46574,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6139365054087564,"acs":53973,"articleLive":2,"columnArticles":658,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87913,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32715007754180425,"acs":81427,"articleLive":2,"columnArticles":589,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":248898,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45561298243529574,"acs":46016,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":100998,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5841585869584003,"acs":101400,"articleLive":2,"columnArticles":1130,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":173583,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.561912957954266,"acs":45706,"articleLive":2,"columnArticles":463,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81340,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7376272762874486,"acs":120546,"articleLive":2,"columnArticles":799,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":163424,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4833962088398305,"acs":10379,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21471,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.323957856161246,"acs":3536,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10915,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5560843838435812,"acs":95106,"articleLive":2,"columnArticles":1330,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":171028,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5648839642790591,"acs":39408,"articleLive":2,"columnArticles":319,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69763,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5022321428571429,"acs":900,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1792,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6738450411355212,"acs":74534,"articleLive":2,"columnArticles":379,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":110610,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6882777560575575,"acs":72179,"articleLive":2,"columnArticles":935,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":104869,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3934913109316412,"acs":87311,"articleLive":2,"columnArticles":1135,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":221888,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5384232377035968,"acs":150310,"articleLive":2,"columnArticles":1088,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":279167,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.507706915011818,"acs":175924,"articleLive":2,"columnArticles":994,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":346507,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48105430867276255,"acs":27778,"articleLive":2,"columnArticles":328,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":57744,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36128604574080214,"acs":2180,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6034,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7560945655511206,"acs":12313,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16285,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20833333333333334,"acs":2760,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13248,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223718668163113,"acs":33272,"articleLive":2,"columnArticles":306,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53460,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4273850085178876,"acs":2007,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4696,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5699033037872683,"acs":8487,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14892,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5314164332112182,"acs":51786,"articleLive":2,"columnArticles":450,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97449,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.616218386190285,"acs":1535,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2491,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6685511690302798,"acs":6977,"articleLive":2,"columnArticles":115,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10436,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6134441311767325,"acs":4134,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6739,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6511341222879684,"acs":2641,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4056,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6999526795220632,"acs":59167,"articleLive":2,"columnArticles":476,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":84530,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5877038460511917,"acs":44039,"articleLive":2,"columnArticles":673,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74934,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7327150084317032,"acs":869,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1186,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37908645631620913,"acs":6656,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17558,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5323326408899015,"acs":15888,"articleLive":2,"columnArticles":215,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29846,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3991636160260321,"acs":62806,"articleLive":2,"columnArticles":872,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":157344,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5077133899466395,"acs":97812,"articleLive":2,"columnArticles":860,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":192652,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4882773802971932,"acs":8872,"articleLive":2,"columnArticles":146,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18170,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743757983440392,"acs":125006,"articleLive":2,"columnArticles":1027,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":217638,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5187975199253172,"acs":96142,"articleLive":2,"columnArticles":844,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":185317,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5905110975361434,"acs":2900,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4911,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38019257221458047,"acs":16584,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43620,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4585647953735587,"acs":76440,"articleLive":2,"columnArticles":745,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":166694,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6972773419473927,"acs":43819,"articleLive":2,"columnArticles":444,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62843,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4772002807159949,"acs":56438,"articleLive":2,"columnArticles":693,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118269,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2516313512720874,"acs":3432,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13639,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885898007889128,"acs":83113,"articleLive":2,"columnArticles":940,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141207,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515063168124392,"acs":19295,"articleLive":2,"columnArticles":172,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34986,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.662904582327247,"acs":48868,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73718,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6489095626563194,"acs":138805,"articleLive":2,"columnArticles":1097,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":213905,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5577567265785398,"acs":15485,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27763,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48677801800945614,"acs":61464,"articleLive":2,"columnArticles":622,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":126267,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7116151047590932,"acs":81956,"articleLive":2,"columnArticles":954,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115169,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5089482550642652,"acs":97885,"articleLive":2,"columnArticles":853,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":192328,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5563930990003225,"acs":27606,"articleLive":2,"columnArticles":313,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49616,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6033193258188327,"acs":79538,"articleLive":2,"columnArticles":498,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":131834,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5770245288123366,"acs":153567,"articleLive":2,"columnArticles":1257,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":266136,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3624875501957078,"acs":57140,"articleLive":2,"columnArticles":462,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157633,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43613386945611754,"acs":28852,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66154,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6119376070687945,"acs":6787,"articleLive":2,"columnArticles":65,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11091,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5114038336291775,"acs":80093,"articleLive":2,"columnArticles":644,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":156614,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43784220446997574,"acs":34146,"articleLive":2,"columnArticles":404,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":77987,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8122755204115658,"acs":170521,"articleLive":2,"columnArticles":1360,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":209930,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6050108653969065,"acs":14199,"articleLive":2,"columnArticles":132,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23469,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7086441262409031,"acs":78094,"articleLive":2,"columnArticles":940,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110202,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3560257589696412,"acs":11223,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31523,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5293148880105402,"acs":1607,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3036,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37387170344672516,"acs":11639,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31131,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44070006519231736,"acs":8788,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19941,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25143051158889146,"acs":25178,"articleLive":2,"columnArticles":298,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100139,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43469446857804805,"acs":1501,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3453,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470270362706705,"acs":63977,"articleLive":2,"columnArticles":336,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":116954,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.619161105815062,"acs":1299,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2098,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3995774222758829,"acs":6619,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16565,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4200645058533089,"acs":21099,"articleLive":2,"columnArticles":180,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50228,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6121648452759528,"acs":75846,"articleLive":2,"columnArticles":602,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":123898,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33464967759849445,"acs":21694,"articleLive":2,"columnArticles":240,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64826,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7012503227234168,"acs":38026,"articleLive":2,"columnArticles":486,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54226,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038806062672412,"acs":38966,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64526,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43811588490342923,"acs":6669,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15222,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4192056583242655,"acs":3082,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7352,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4482445383113049,"acs":29607,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66051,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5412124689233123,"acs":5660,"articleLive":2,"columnArticles":97,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10458,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.47222805176635185,"acs":40503,"articleLive":2,"columnArticles":430,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":85770,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5906810580723624,"acs":15542,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26312,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6357730619315721,"acs":1468,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2309,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6072685565766999,"acs":123366,"articleLive":2,"columnArticles":993,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":203149,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5865275429609629,"acs":46487,"articleLive":2,"columnArticles":402,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79258,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5774386067899423,"acs":5902,"articleLive":2,"columnArticles":115,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10221,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.38775734889353736,"acs":3522,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9083,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7201773835920178,"acs":1624,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2255,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4835266491140682,"acs":6795,"articleLive":2,"columnArticles":81,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14053,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5463182897862233,"acs":47840,"articleLive":2,"columnArticles":405,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":87568,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5525114155251142,"acs":19602,"articleLive":2,"columnArticles":180,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35478,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3459261861088345,"acs":26591,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76869,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4932905351294689,"acs":151528,"articleLive":2,"columnArticles":1045,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":307178,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5428263296312413,"acs":28690,"articleLive":2,"columnArticles":437,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52853,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6873808970485707,"acs":103523,"articleLive":2,"columnArticles":1067,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":150605,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4048428785199293,"acs":2976,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7351,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4689345794392523,"acs":43904,"articleLive":2,"columnArticles":455,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":93625,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3722175260636799,"acs":2642,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7098,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7092038656235619,"acs":30822,"articleLive":2,"columnArticles":480,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43460,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5130232991322975,"acs":66101,"articleLive":2,"columnArticles":544,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":128846,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4411631829407867,"acs":29295,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66404,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6358608002452859,"acs":103693,"articleLive":2,"columnArticles":986,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":163075,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5040927471954083,"acs":30915,"articleLive":2,"columnArticles":324,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61328,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48357289527720737,"acs":5652,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11688,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5638756229235881,"acs":21725,"articleLive":2,"columnArticles":291,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38528,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4128214061737858,"acs":29622,"articleLive":2,"columnArticles":232,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":71755,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6773052902277737,"acs":14749,"articleLive":2,"columnArticles":211,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21776,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6746579747507505,"acs":246518,"articleLive":2,"columnArticles":1493,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":365397,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6076324564653576,"acs":3280,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5398,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7325765575501584,"acs":19425,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26516,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5378816878183799,"acs":18267,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":33961,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7311850873080147,"acs":51463,"articleLive":2,"columnArticles":574,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":70383,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5008650519031141,"acs":19686,"articleLive":2,"columnArticles":242,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39304,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.644426430202164,"acs":38953,"articleLive":2,"columnArticles":426,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60446,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6540750829614803,"acs":86922,"articleLive":2,"columnArticles":622,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":132893,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5102105850173938,"acs":19213,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37657,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6573692436741517,"acs":108932,"articleLive":2,"columnArticles":688,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":165709,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3976659372720642,"acs":2726,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6855,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5638890443934389,"acs":40291,"articleLive":2,"columnArticles":646,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71452,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.713283390171633,"acs":25517,"articleLive":2,"columnArticles":253,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35774,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3617482295740408,"acs":6845,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18922,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2747104938517251,"acs":69032,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":251290,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49542441765315587,"acs":72653,"articleLive":2,"columnArticles":758,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":146648,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5360038769769037,"acs":45347,"articleLive":2,"columnArticles":517,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84602,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7352297592997812,"acs":33264,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45243,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5789626195305708,"acs":1998,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3451,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47691959912591364,"acs":31646,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66355,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6451006145514099,"acs":39784,"articleLive":2,"columnArticles":463,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61671,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6209243182995557,"acs":79107,"articleLive":2,"columnArticles":638,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":127402,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6588946459412781,"acs":3815,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5790,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37494675929325716,"acs":25529,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68087,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5253042921204356,"acs":1640,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3122,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6752252462536763,"acs":14464,"articleLive":2,"columnArticles":139,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21421,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.84225921395522,"acs":15837,"articleLive":2,"columnArticles":102,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18803,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5380453752181501,"acs":3083,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5730,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7125857567846519,"acs":11737,"articleLive":2,"columnArticles":173,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16471,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7010920496490524,"acs":109974,"articleLive":2,"columnArticles":841,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":156861,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5983769390084112,"acs":14157,"articleLive":2,"columnArticles":190,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23659,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5823255256335327,"acs":38858,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66729,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6073839977438246,"acs":73225,"articleLive":2,"columnArticles":803,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":120558,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45797959036728175,"acs":69966,"articleLive":2,"columnArticles":649,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":152771,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.552617229100411,"acs":151001,"articleLive":2,"columnArticles":1243,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":273247,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7108359133126935,"acs":2296,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3230,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4186300704396405,"acs":3447,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8234,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6283119480086652,"acs":15082,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24004,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6187926053212984,"acs":163847,"articleLive":2,"columnArticles":1146,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":264785,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35498025449758663,"acs":1618,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4558,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48124306326304106,"acs":2168,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4505,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4386730835338604,"acs":12761,"articleLive":2,"columnArticles":179,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29090,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5677733604150823,"acs":58982,"articleLive":2,"columnArticles":758,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103883,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5777078176443728,"acs":24039,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41611,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6053327905556687,"acs":5948,"articleLive":2,"columnArticles":86,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9826,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5030676859477017,"acs":45999,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91437,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3429368029739777,"acs":1107,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3228,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3259702816589044,"acs":14698,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45090,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7456573756118945,"acs":163293,"articleLive":2,"columnArticles":1338,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":218992,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5043207742827515,"acs":2918,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5786,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7283541064404531,"acs":61476,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84404,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465379456883168,"acs":152152,"articleLive":2,"columnArticles":934,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":340737,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7749298746751074,"acs":90339,"articleLive":2,"columnArticles":752,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116577,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4661726033946928,"acs":3900,"articleLive":2,"columnArticles":63,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8366,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6062088147996042,"acs":32474,"articleLive":2,"columnArticles":325,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53569,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17945832998473038,"acs":4466,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24886,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6109432838361061,"acs":14359,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23503,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6892075829009923,"acs":69876,"articleLive":2,"columnArticles":651,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":101386,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43192483190538444,"acs":119933,"articleLive":2,"columnArticles":1095,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":277671,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5078689919183327,"acs":1194,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2351,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5650911161731207,"acs":9923,"articleLive":2,"columnArticles":157,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17560,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6611684199775304,"acs":12947,"articleLive":2,"columnArticles":113,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19582,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4876486082437531,"acs":6850,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14047,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4731586702685807,"acs":84773,"articleLive":2,"columnArticles":742,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":179164,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6640776699029126,"acs":1026,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1545,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6474933768086407,"acs":12709,"articleLive":2,"columnArticles":113,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19628,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6833154170744621,"acs":42589,"articleLive":2,"columnArticles":439,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62327,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46867131600398515,"acs":25873,"articleLive":2,"columnArticles":281,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55205,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7025237323454503,"acs":15171,"articleLive":2,"columnArticles":85,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21595,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.496265684126668,"acs":9967,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20084,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4106502005488706,"acs":7781,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18948,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5231973459126017,"acs":10093,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19291,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40508359352419876,"acs":99510,"articleLive":2,"columnArticles":862,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":245653,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40805833411236797,"acs":8730,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21394,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6191359078822181,"acs":50758,"articleLive":2,"columnArticles":492,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":81982,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744752308984048,"acs":13836,"articleLive":2,"columnArticles":61,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17865,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5954834156669019,"acs":8438,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14170,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7462169460437152,"acs":14646,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19627,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3849447021048876,"acs":2158,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5606,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4260694803330462,"acs":1484,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3483,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7452228231249738,"acs":88879,"articleLive":2,"columnArticles":567,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119265,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7611927670067204,"acs":62975,"articleLive":2,"columnArticles":464,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82732,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3410690507894236,"acs":1793,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5257,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5232057694544608,"acs":4498,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8597,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44288798778240035,"acs":8410,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18989,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5183495128525872,"acs":29421,"articleLive":2,"columnArticles":270,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56759,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7967905807849858,"acs":103676,"articleLive":2,"columnArticles":238,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":130117,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42115773599666484,"acs":81828,"articleLive":2,"columnArticles":286,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":194293,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4418416801292407,"acs":10393,"articleLive":2,"columnArticles":82,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23522,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5180135699041187,"acs":16262,"articleLive":2,"columnArticles":210,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31393,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5222968845448992,"acs":29070,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55658,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.481471314850398,"acs":19294,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40073,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5005444646098004,"acs":31717,"articleLive":2,"columnArticles":375,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63365,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6291406069029418,"acs":8148,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12951,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6712242322254943,"acs":12764,"articleLive":2,"columnArticles":112,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":19016,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3741216009776963,"acs":2449,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6546,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33373469065080696,"acs":109760,"articleLive":2,"columnArticles":1262,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":328884,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5690206913001133,"acs":28628,"articleLive":2,"columnArticles":314,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50311,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6601583685866146,"acs":12172,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18438,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6560619088564058,"acs":7630,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11630,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.486044776119403,"acs":6513,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13400,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6653215636822194,"acs":10552,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15860,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.531896551724138,"acs":50594,"articleLive":2,"columnArticles":394,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95120,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6679945676776822,"acs":7378,"articleLive":2,"columnArticles":64,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11045,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8174764068507515,"acs":11694,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14305,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34532557448073736,"acs":8130,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23543,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42482461734693877,"acs":5329,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12544,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46050608136446247,"acs":3294,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7153,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7877820569689784,"acs":190028,"articleLive":2,"columnArticles":1255,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":241219,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6194914125948608,"acs":4653,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7511,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4659090909090909,"acs":11398,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24464,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735652518972901,"acs":93572,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":120962,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5711646856108175,"acs":78229,"articleLive":2,"columnArticles":499,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":136964,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43712411153635866,"acs":65559,"articleLive":2,"columnArticles":424,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":149978,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5460386497306381,"acs":11048,"articleLive":2,"columnArticles":190,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20233,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.42006509668772735,"acs":2194,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5223,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3428649237472767,"acs":2518,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7344,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6842057761732852,"acs":45486,"articleLive":2,"columnArticles":355,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66480,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8081266450937291,"acs":85659,"articleLive":2,"columnArticles":341,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":105997,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.524893174957858,"acs":80337,"articleLive":2,"columnArticles":761,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":153054,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40678630969893104,"acs":4148,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10197,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3687975998153704,"acs":6392,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17332,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28855853464295195,"acs":1087,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3767,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5979485880714195,"acs":18888,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31588,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39784465298406696,"acs":94286,"articleLive":2,"columnArticles":769,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":236992,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.440530058177117,"acs":1363,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3094,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5538419544151767,"acs":4058,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7327,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5520587905306855,"acs":9841,"articleLive":2,"columnArticles":113,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17826,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900445219626383,"acs":75170,"articleLive":2,"columnArticles":652,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":108935,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5923192071439632,"acs":11475,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19373,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37689213209841893,"acs":20143,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53445,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4249032711924024,"acs":10872,"articleLive":2,"columnArticles":212,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25587,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5329056547692765,"acs":21515,"articleLive":2,"columnArticles":242,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40373,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.48934899462472625,"acs":2458,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5023,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4505156529958663,"acs":63866,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":141762,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4011220196353436,"acs":1144,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2852,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4338502643468836,"acs":68849,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":158693,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5776049204052098,"acs":22351,"articleLive":2,"columnArticles":200,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38696,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6567176727761896,"acs":124976,"articleLive":2,"columnArticles":921,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":190304,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5848144811204848,"acs":21420,"articleLive":2,"columnArticles":280,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36627,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4818886702927902,"acs":29148,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60487,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5670846142332446,"acs":49253,"articleLive":2,"columnArticles":654,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86853,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5834491276825691,"acs":3779,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6477,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5716480446927374,"acs":32744,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57280,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5980997624703088,"acs":41547,"articleLive":2,"columnArticles":395,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69465,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8106974868969224,"acs":60324,"articleLive":2,"columnArticles":611,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":74410,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.597979797979798,"acs":9472,"articleLive":2,"columnArticles":138,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15840,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.308336366945759,"acs":847,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2747,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.783388381766436,"acs":82302,"articleLive":2,"columnArticles":628,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105059,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4546760401527698,"acs":26905,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59174,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419614423828684,"acs":28421,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52441,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6556914393226717,"acs":697,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1063,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5606684672518568,"acs":16607,"articleLive":2,"columnArticles":214,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29620,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4090844811494188,"acs":28928,"articleLive":2,"columnArticles":274,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":70714,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4644155844155844,"acs":1788,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3850,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6538769221652692,"acs":22069,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33751,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2707788624864311,"acs":75084,"articleLive":2,"columnArticles":941,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":277289,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6181182639091174,"acs":2122,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3433,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6242315773091588,"acs":8022,"articleLive":2,"columnArticles":121,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12851,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5079447579447579,"acs":6841,"articleLive":2,"columnArticles":67,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13468,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6657423791889377,"acs":36494,"articleLive":2,"columnArticles":308,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54817,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4517114046300241,"acs":19083,"articleLive":2,"columnArticles":286,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42246,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48608613517882765,"acs":53521,"articleLive":2,"columnArticles":670,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110106,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5482717520858165,"acs":3680,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6712,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43525239044188896,"acs":47614,"articleLive":2,"columnArticles":418,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":109394,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4967466786230898,"acs":93064,"articleLive":2,"columnArticles":768,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":187347,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40115718418514945,"acs":2912,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7259,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5877293577981652,"acs":7175,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12208,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6174906197171484,"acs":14976,"articleLive":2,"columnArticles":252,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24253,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38561322840215756,"acs":43609,"articleLive":2,"columnArticles":479,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113090,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5414617884823736,"acs":25988,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47996,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015610287465613,"acs":86999,"articleLive":2,"columnArticles":824,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":216652,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5034883720930232,"acs":2598,"articleLive":2,"columnArticles":63,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5160,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6949781330116122,"acs":46084,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66310,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4344854520601445,"acs":2225,"articleLive":2,"columnArticles":51,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5121,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658805292587057,"acs":60139,"articleLive":2,"columnArticles":608,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90315,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43114595639566106,"acs":20072,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46555,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3561500185055722,"acs":17321,"articleLive":2,"columnArticles":196,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48634,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4413776426696145,"acs":38331,"articleLive":2,"columnArticles":273,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86844,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108543861876349,"acs":8048,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15754,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.486986098787341,"acs":3293,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6762,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6477774438871039,"acs":56047,"articleLive":2,"columnArticles":567,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86522,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4917898193760263,"acs":3594,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7308,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5778056256456283,"acs":68240,"articleLive":2,"columnArticles":738,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":118102,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6098568860458058,"acs":26122,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42833,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5350151097096308,"acs":4072,"articleLive":2,"columnArticles":78,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7611,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6648570891216941,"acs":130798,"articleLive":2,"columnArticles":1297,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":196731,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6318816762530813,"acs":52292,"articleLive":2,"columnArticles":475,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82756,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6049794637918997,"acs":66725,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110293,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44676160400405174,"acs":29992,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67132,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47795384085428866,"acs":2775,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5806,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7604884647593105,"acs":82640,"articleLive":2,"columnArticles":520,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":108667,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7232437128745597,"acs":76585,"articleLive":2,"columnArticles":566,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":105891,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7404240766073872,"acs":4330,"articleLive":2,"columnArticles":77,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5848,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5129138763696857,"acs":60431,"articleLive":2,"columnArticles":552,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117819,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.555837361538345,"acs":293451,"articleLive":2,"columnArticles":1454,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":527944,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6450457696579723,"acs":67366,"articleLive":2,"columnArticles":434,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":104436,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6441267387944358,"acs":58345,"articleLive":2,"columnArticles":391,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":90580,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3217744876194472,"acs":64417,"articleLive":2,"columnArticles":443,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":200193,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33958302084895753,"acs":2264,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6667,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7587759160848133,"acs":70963,"articleLive":2,"columnArticles":510,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93523,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3524584650568373,"acs":5240,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14867,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5600624024960998,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1282,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6720434859466148,"acs":15207,"articleLive":2,"columnArticles":170,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22628,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4141408871963413,"acs":23816,"articleLive":2,"columnArticles":220,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":57507,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7219105959314837,"acs":100643,"articleLive":2,"columnArticles":672,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":139412,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4096162736939436,"acs":2658,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6489,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46087753465459963,"acs":4023,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8729,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115929860819582,"acs":31685,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61934,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5645351039859624,"acs":84936,"articleLive":2,"columnArticles":589,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":150453,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36985049833887046,"acs":8906,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24080,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.484675361165094,"acs":20700,"articleLive":2,"columnArticles":274,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42709,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46925844298956376,"acs":28957,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61708,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.321967758444217,"acs":5033,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15632,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7207009857612268,"acs":1316,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1826,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4627488900116101,"acs":138305,"articleLive":2,"columnArticles":864,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":298877,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6084747029370002,"acs":48852,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80286,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524696827767792,"acs":21822,"articleLive":2,"columnArticles":398,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39499,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40930754135127556,"acs":2920,"articleLive":2,"columnArticles":49,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7134,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7601584176138906,"acs":33973,"articleLive":2,"columnArticles":310,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44692,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5136007949323066,"acs":8270,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16102,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4901667911376649,"acs":3938,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8034,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5056433408577878,"acs":4032,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7974,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6102453877843453,"acs":3407,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5583,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804204340358006,"acs":66569,"articleLive":2,"columnArticles":571,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":114691,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4805529522024367,"acs":2051,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4268,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4066657655396142,"acs":21060,"articleLive":2,"columnArticles":264,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51787,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4632768361581921,"acs":1558,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3363,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46104283498389215,"acs":3864,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8381,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017768559958278,"acs":41371,"articleLive":2,"columnArticles":590,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82449,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6800846242568295,"acs":213450,"articleLive":2,"columnArticles":1524,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":313858,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6295779816513761,"acs":51468,"articleLive":2,"columnArticles":596,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":81750,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3670746296125886,"acs":3989,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10867,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4951550387596899,"acs":1533,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3096,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.520472612436023,"acs":57354,"articleLive":2,"columnArticles":525,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":110196,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45892745744586044,"acs":41197,"articleLive":2,"columnArticles":365,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89768,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39274017467248906,"acs":2878,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7328,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5881996292895872,"acs":135820,"articleLive":2,"columnArticles":1302,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":230908,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41670406565124607,"acs":45497,"articleLive":2,"columnArticles":405,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109183,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6020658179197694,"acs":12532,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20815,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5053723601333827,"acs":1364,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2699,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7218614718614719,"acs":2001,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2772,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5025234318673396,"acs":1394,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2774,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5303285657890742,"acs":69857,"articleLive":2,"columnArticles":592,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":131724,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5918666422421689,"acs":3231,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5459,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43097155126140635,"acs":8029,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18630,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49884881043745205,"acs":1300,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2606,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5652868198010073,"acs":4602,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8141,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.42010309278350516,"acs":2445,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5820,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4619844511793385,"acs":3506,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7589,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6605633802816901,"acs":1876,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2840,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.839608593916188,"acs":3947,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4701,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5906021384355655,"acs":2099,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3554,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7001255197301326,"acs":17849,"articleLive":2,"columnArticles":143,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25494,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631038170068344,"acs":82068,"articleLive":2,"columnArticles":988,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":107545,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49374557469907954,"acs":4184,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8474,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6652377151978109,"acs":29174,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43855,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080400005148071,"acs":55014,"articleLive":2,"columnArticles":635,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77699,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47789785061666545,"acs":40066,"articleLive":2,"columnArticles":497,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83838,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5057787040545662,"acs":5339,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10556,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5876617288580537,"acs":12536,"articleLive":2,"columnArticles":150,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21332,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5548837209302325,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2150,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513192780794735,"acs":153160,"articleLive":2,"columnArticles":1115,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":179909,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4932249322493225,"acs":6188,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12546,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7132036284780551,"acs":23351,"articleLive":2,"columnArticles":333,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32741,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5898520084566596,"acs":1116,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1892,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4601288215549306,"acs":5072,"articleLive":2,"columnArticles":80,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11023,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5692405871091257,"acs":1784,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3134,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3234153400868307,"acs":5587,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17275,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5942855700547717,"acs":23545,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39619,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4364511153571675,"acs":18959,"articleLive":2,"columnArticles":235,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43439,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2872573987880917,"acs":3271,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11387,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6171769168247088,"acs":43282,"articleLive":2,"columnArticles":661,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70129,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42783945345858243,"acs":1503,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3513,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5959501025290499,"acs":69750,"articleLive":2,"columnArticles":670,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117040,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6869849168092054,"acs":44180,"articleLive":2,"columnArticles":486,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64310,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5122534445020812,"acs":40488,"articleLive":2,"columnArticles":405,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":79039,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4725030552160871,"acs":4253,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9001,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39102149444618994,"acs":42314,"articleLive":2,"columnArticles":399,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108214,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6081076634529959,"acs":18481,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30391,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6921957190591194,"acs":20923,"articleLive":2,"columnArticles":295,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30227,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44985574148874785,"acs":3898,"articleLive":2,"columnArticles":67,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8665,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948233861144946,"acs":11409,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16420,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46421633779777116,"acs":9081,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19562,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.393141075604053,"acs":5044,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12830,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3409533524993045,"acs":7353,"articleLive":2,"columnArticles":104,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21566,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5331608966706459,"acs":8039,"articleLive":2,"columnArticles":88,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15078,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5303495750835258,"acs":23652,"articleLive":2,"columnArticles":281,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44597,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7929914810558383,"acs":43471,"articleLive":2,"columnArticles":539,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":54819,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46408286000668225,"acs":1389,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2993,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40878664307147805,"acs":5313,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12997,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7060843964671246,"acs":1439,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2038,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4197423901114769,"acs":7267,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17313,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5766771391609684,"acs":31204,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54110,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48200958441354386,"acs":12271,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25458,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7713870311136959,"acs":39792,"articleLive":2,"columnArticles":400,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51585,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2908811924594476,"acs":2654,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9124,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6568670469504169,"acs":13473,"articleLive":2,"columnArticles":151,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20511,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8453539935776543,"acs":16585,"articleLive":2,"columnArticles":218,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19619,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4811011579637317,"acs":4404,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9154,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4190874914559125,"acs":4905,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11704,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7336277323912563,"acs":16613,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22645,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.705045685736148,"acs":15664,"articleLive":2,"columnArticles":199,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22217,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6305181226765799,"acs":10855,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17216,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5500551789374113,"acs":6978,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12686,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6996584949384071,"acs":22946,"articleLive":2,"columnArticles":355,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32796,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4336346375423963,"acs":26721,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61621,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51058352402746,"acs":3570,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6992,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.591488989863684,"acs":13538,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22888,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4330055680606563,"acs":3655,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8441,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42145586512797867,"acs":21949,"articleLive":2,"columnArticles":249,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52079,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5075818330982734,"acs":55064,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108483,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6926371045724548,"acs":25070,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36195,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5021864614308204,"acs":2871,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5717,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4285088999124599,"acs":2937,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6854,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6153424457276515,"acs":16837,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27362,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39127096621781243,"acs":6625,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16932,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37418134187163443,"acs":7713,"articleLive":2,"columnArticles":113,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20613,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3898929336188437,"acs":9104,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23350,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4919761577258138,"acs":3219,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6543,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3660103278895,"acs":8718,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23819,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5433048641528764,"acs":51972,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95659,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.405485825578879,"acs":7495,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18484,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7957621693833437,"acs":85776,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107791,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.43007430909242716,"acs":5151,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11977,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5284402223185778,"acs":13406,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25369,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5741901079856019,"acs":4307,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7501,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4793809197328661,"acs":37757,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78762,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39589969778649026,"acs":19388,"articleLive":2,"columnArticles":244,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48972,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5000349235174967,"acs":7159,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14317,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5746519443110898,"acs":19152,"articleLive":2,"columnArticles":269,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33328,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3597526924611089,"acs":9019,"articleLive":2,"columnArticles":113,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25070,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6577599564718546,"acs":55609,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84543,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4881097718245439,"acs":28387,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58157,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.37955410549211527,"acs":2792,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7356,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5126078131485134,"acs":90159,"articleLive":2,"columnArticles":988,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":175883,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42121899188008893,"acs":37713,"articleLive":2,"columnArticles":556,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89533,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5117290846022694,"acs":8704,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17009,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6810492232691818,"acs":18720,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27487,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4493931136982908,"acs":9071,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20185,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4267573696145125,"acs":15997,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37485,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4491603616903488,"acs":2434,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5419,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4815434370469499,"acs":4318,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8967,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7144693446088795,"acs":84486,"articleLive":2,"columnArticles":730,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":118250,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38407564444110914,"acs":10236,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26651,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35979228486646886,"acs":4365,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12132,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4091257342300162,"acs":4806,"articleLive":2,"columnArticles":57,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11747,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6268903047516696,"acs":16333,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26054,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46652267818574517,"acs":3024,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6482,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5550220856539274,"acs":2890,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5207,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3021202559004063,"acs":27957,"articleLive":2,"columnArticles":364,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92536,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5870704148258201,"acs":90093,"articleLive":2,"columnArticles":775,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":153462,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085122778177335,"acs":31477,"articleLive":2,"columnArticles":440,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38932,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1924127250588138,"acs":16276,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84589,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.604608168715122,"acs":35320,"articleLive":2,"columnArticles":563,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58418,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45599279062781617,"acs":3036,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6658,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.658038246200829,"acs":9050,"articleLive":2,"columnArticles":131,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13753,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2247500449021134,"acs":7508,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33406,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702453374689231,"acs":83843,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125093,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6242897998093422,"acs":16372,"articleLive":2,"columnArticles":237,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26225,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.551025641025641,"acs":6447,"articleLive":2,"columnArticles":96,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11700,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42953521086326185,"acs":14962,"articleLive":2,"columnArticles":192,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34833,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3422151807575976,"acs":9504,"articleLive":2,"columnArticles":126,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27772,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6522230838826418,"acs":60555,"articleLive":2,"columnArticles":723,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92844,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5114078647161455,"acs":15242,"articleLive":2,"columnArticles":113,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29804,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4150836976008702,"acs":20606,"articleLive":2,"columnArticles":229,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49643,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4796527807509526,"acs":44813,"articleLive":2,"columnArticles":354,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":93428,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7061081395671092,"acs":152871,"articleLive":2,"columnArticles":1650,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":216498,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7572462159882818,"acs":68240,"articleLive":2,"columnArticles":484,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90116,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28112834258727426,"acs":4405,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15669,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5543324138286627,"acs":21502,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38789,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528823007728367,"acs":5988,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23679,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5377431817662255,"acs":47045,"articleLive":2,"columnArticles":573,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87486,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4850217864923747,"acs":1781,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3672,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6891729418464848,"acs":10891,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15803,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6620897748847301,"acs":19529,"articleLive":2,"columnArticles":253,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29496,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6919875130072841,"acs":4655,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6727,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42665223168151173,"acs":8670,"articleLive":2,"columnArticles":115,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20321,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2913635409992232,"acs":51384,"articleLive":2,"columnArticles":337,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":176357,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6405315536547251,"acs":54515,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85109,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6758596613719672,"acs":15488,"articleLive":2,"columnArticles":148,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22916,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7265547877591313,"acs":8832,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12156,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3303995367689635,"acs":2853,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8635,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385886231217418,"acs":33319,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52176,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7249461206896551,"acs":10764,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14848,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7745426739603553,"acs":13168,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17001,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.545565655794057,"acs":7142,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13091,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867259597410519,"acs":59636,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101642,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7441226412838112,"acs":62228,"articleLive":2,"columnArticles":710,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83626,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3382601615832655,"acs":5401,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15967,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5369634849455477,"acs":4191,"articleLive":2,"columnArticles":46,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7805,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49321663019693657,"acs":3381,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6855,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5458254323967132,"acs":18998,"articleLive":2,"columnArticles":233,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34806,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32941873087930523,"acs":3338,"articleLive":2,"columnArticles":78,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10133,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5308151093439364,"acs":2937,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5533,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45366616726888165,"acs":20591,"articleLive":2,"columnArticles":285,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":45388,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7006251279765848,"acs":58168,"articleLive":2,"columnArticles":605,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":83023,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27763755678950025,"acs":2200,"articleLive":2,"columnArticles":39,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7924,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3175014633330546,"acs":11391,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35877,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.698744769874477,"acs":20875,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29875,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4595206429157588,"acs":16239,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35339,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3189539347408829,"acs":6647,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20840,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4264012077750519,"acs":4519,"articleLive":2,"columnArticles":69,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10598,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5603228804900483,"acs":230876,"articleLive":2,"columnArticles":1061,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":412041,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.3989941324392288,"acs":1904,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4772,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38873746097649875,"acs":49061,"articleLive":2,"columnArticles":619,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126206,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46958819423671355,"acs":9419,"articleLive":2,"columnArticles":115,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20058,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4419794042435552,"acs":6395,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14469,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5703114414571356,"acs":29464,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51663,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3575923999249544,"acs":20966,"articleLive":2,"columnArticles":224,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":58631,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6327178642831942,"acs":5380,"articleLive":2,"columnArticles":101,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8503,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4840466926070039,"acs":1866,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3855,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.737705492656595,"acs":21046,"articleLive":2,"columnArticles":312,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28529,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7138947719106203,"acs":90000,"articleLive":2,"columnArticles":827,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126069,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3388840830449827,"acs":6268,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18496,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3590594427598833,"acs":6276,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17479,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38738884149200276,"acs":50402,"articleLive":2,"columnArticles":677,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130107,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5234543217471547,"acs":6807,"articleLive":2,"columnArticles":124,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13004,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33714229905264187,"acs":3452,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10239,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4196360879454132,"acs":2214,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5276,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6442052565707134,"acs":25736,"articleLive":2,"columnArticles":232,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39950,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5448447124842778,"acs":33788,"articleLive":2,"columnArticles":342,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62014,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6650723765480979,"acs":20997,"articleLive":2,"columnArticles":271,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31571,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6325025807403037,"acs":8578,"articleLive":2,"columnArticles":82,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13562,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7250870801137046,"acs":36221,"articleLive":2,"columnArticles":310,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49954,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47415924578366536,"acs":23588,"articleLive":2,"columnArticles":265,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49747,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4752037252619325,"acs":6123,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12885,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37863372093023256,"acs":1563,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4128,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5875532071040658,"acs":12009,"articleLive":2,"columnArticles":127,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20439,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8187501579785487,"acs":97175,"articleLive":2,"columnArticles":803,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118687,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4538326799566269,"acs":5441,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11989,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4212253829321663,"acs":5005,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11882,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39253434391283754,"acs":62148,"articleLive":2,"columnArticles":615,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158325,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7303660699887115,"acs":22645,"articleLive":2,"columnArticles":214,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31005,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4706030784759021,"acs":1865,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3963,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6895813742339246,"acs":21266,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30839,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48614461133647624,"acs":35473,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72968,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6245334432460901,"acs":27274,"articleLive":2,"columnArticles":301,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43671,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6127764705882353,"acs":26043,"articleLive":2,"columnArticles":337,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42500,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39191290824261277,"acs":6804,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17361,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37054379997349474,"acs":8388,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22637,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7745979186376537,"acs":9825,"articleLive":2,"columnArticles":146,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12684,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6637848795611734,"acs":11133,"articleLive":2,"columnArticles":168,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16772,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3521933340968961,"acs":3075,"articleLive":2,"columnArticles":59,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8731,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5529950280167312,"acs":14014,"articleLive":2,"columnArticles":170,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25342,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3005790190735695,"acs":7060,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23488,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3300653594771242,"acs":3232,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9792,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4378319783197832,"acs":4039,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9225,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36077943193943396,"acs":14201,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39362,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5364135702746365,"acs":24903,"articleLive":2,"columnArticles":231,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46425,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7434033692977475,"acs":19637,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26415,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5564853556485355,"acs":1995,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3585,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768352215160726,"acs":36742,"articleLive":2,"columnArticles":303,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54285,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4429647167143468,"acs":13471,"articleLive":2,"columnArticles":132,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30411,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5034784337109919,"acs":2533,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5031,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43203309692671393,"acs":1462,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3384,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6836288659793814,"acs":33156,"articleLive":2,"columnArticles":393,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48500,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40372263730502034,"acs":3080,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7629,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.463743676222597,"acs":7700,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16604,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4991044776119403,"acs":25080,"articleLive":2,"columnArticles":328,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50250,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6512524901453821,"acs":15365,"articleLive":2,"columnArticles":196,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23593,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41400127488844723,"acs":11041,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26669,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44039415212210986,"acs":6838,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15527,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41090213579853363,"acs":1289,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3137,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6411829300617213,"acs":67732,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105636,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4662818614950178,"acs":37483,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80387,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4476477337923121,"acs":3121,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6972,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972942302129458,"acs":53686,"articleLive":2,"columnArticles":501,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89882,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7102758984811464,"acs":173541,"articleLive":2,"columnArticles":1356,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":244329,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47351196339834944,"acs":43261,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91362,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7124326145552561,"acs":8458,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11872,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7346426007588965,"acs":14327,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19502,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5323534549447259,"acs":21333,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40073,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5450267379679145,"acs":2548,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4675,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6341310930936798,"acs":32458,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51185,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41726950191217804,"acs":9056,"articleLive":2,"columnArticles":145,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21703,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6005016784093843,"acs":16279,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27109,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6784080752852111,"acs":25808,"articleLive":2,"columnArticles":250,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":38042,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5328586195015504,"acs":23198,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43535,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4981914893617021,"acs":9366,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18800,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4711882605583393,"acs":52660,"articleLive":2,"columnArticles":596,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111760,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5028200153408835,"acs":33432,"articleLive":2,"columnArticles":503,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66489,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5200332403395264,"acs":8761,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16847,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45292226432426225,"acs":23667,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52254,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5571117981885918,"acs":50993,"articleLive":2,"columnArticles":805,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91531,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5093420882748954,"acs":55230,"articleLive":2,"columnArticles":1409,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":108434,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5398617221873035,"acs":21473,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39775,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49546862452678675,"acs":4319,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8717,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5103437721726791,"acs":36683,"articleLive":2,"columnArticles":397,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":71879,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6148475120385233,"acs":7661,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12460,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906789256759817,"acs":30499,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44158,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4094996541388056,"acs":3552,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8674,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2920353982300885,"acs":2112,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7232,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7354993177663929,"acs":57138,"articleLive":2,"columnArticles":600,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77686,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5768885104772716,"acs":12196,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21141,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5969972830881056,"acs":67678,"articleLive":2,"columnArticles":715,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113364,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5313421828908554,"acs":25938,"articleLive":2,"columnArticles":420,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":48816,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6273909716908952,"acs":44280,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70578,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46522922952387963,"acs":6322,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13589,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7224978114969361,"acs":17332,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23989,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928714859437751,"acs":15353,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25896,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45239377325239866,"acs":18483,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40856,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6267060469454376,"acs":60474,"articleLive":2,"columnArticles":580,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96495,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3344198174706649,"acs":3078,"articleLive":2,"columnArticles":65,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9204,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3969990965203367,"acs":47017,"articleLive":2,"columnArticles":920,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118431,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5507863461069775,"acs":38419,"articleLive":2,"columnArticles":453,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":69753,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35519883254286755,"acs":4868,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13705,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5840926988412645,"acs":5192,"articleLive":2,"columnArticles":80,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8889,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5612422753921724,"acs":3542,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6311,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5162100028150511,"acs":44010,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85256,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5982807515065579,"acs":20253,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33852,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5369645324735145,"acs":9326,"articleLive":2,"columnArticles":138,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17368,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830660575580528,"acs":57766,"articleLive":2,"columnArticles":655,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73769,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7049664047779871,"acs":19830,"articleLive":2,"columnArticles":266,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28129,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5646712775260354,"acs":7103,"articleLive":2,"columnArticles":156,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12579,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5572190730243415,"acs":33422,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59980,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095578899850467,"acs":75448,"articleLive":2,"columnArticles":649,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106331,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6711341594827587,"acs":9965,"articleLive":2,"columnArticles":169,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14848,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4345382051114452,"acs":13296,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30598,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319595057102712,"acs":20317,"articleLive":2,"columnArticles":424,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27757,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6557351509250243,"acs":16836,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25675,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105078563411896,"acs":40516,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57024,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5673684210526316,"acs":4851,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8550,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39761680777673253,"acs":2536,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6378,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39060665362035224,"acs":10978,"articleLive":2,"columnArticles":167,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28105,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4323515210043457,"acs":4477,"articleLive":2,"columnArticles":98,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10355,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6332420026331709,"acs":35592,"articleLive":2,"columnArticles":387,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56206,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.29993547792423264,"acs":3254,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10849,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43822525597269624,"acs":9630,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21975,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7934347227437727,"acs":25355,"articleLive":2,"columnArticles":318,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31956,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5547248437308494,"acs":4526,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8159,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5211739216072484,"acs":2646,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5077,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4828841442072104,"acs":6898,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14285,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5299658324868409,"acs":11478,"articleLive":2,"columnArticles":152,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21658,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.691513246519982,"acs":7700,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11135,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20885498412234915,"acs":5722,"articleLive":2,"columnArticles":72,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27397,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6398760018146076,"acs":8463,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13226,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599933835249772,"acs":65835,"articleLive":2,"columnArticles":914,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99751,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7248814939278445,"acs":106127,"articleLive":2,"columnArticles":983,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":146406,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45531974308852274,"acs":9783,"articleLive":2,"columnArticles":134,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21486,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6450757007944836,"acs":43033,"articleLive":2,"columnArticles":404,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":66710,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7576100712715647,"acs":11374,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15013,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7536039086687306,"acs":31157,"articleLive":2,"columnArticles":371,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41344,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5812775117302762,"acs":48067,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82692,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4592466810744057,"acs":5950,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12956,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37635122321259246,"acs":7938,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21092,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5877689694224235,"acs":4671,"articleLive":2,"columnArticles":86,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7947,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4097566880522939,"acs":3385,"articleLive":2,"columnArticles":65,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8261,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46543567831527544,"acs":3050,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6553,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34169439467622215,"acs":1335,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3907,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36308478365000796,"acs":2274,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6263,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5313498893533317,"acs":4322,"articleLive":2,"columnArticles":64,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8134,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6057441253263708,"acs":2784,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4596,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5430670626856339,"acs":3474,"articleLive":2,"columnArticles":48,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6397,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7057699656094765,"acs":1847,"articleLive":2,"columnArticles":39,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2617,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6506532389765922,"acs":4781,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7348,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5422409959982214,"acs":2439,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4498,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4740004622140051,"acs":2051,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4327,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4225855901890649,"acs":827,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1957,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.864478003939593,"acs":13166,"articleLive":2,"columnArticles":63,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15230,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8191254416961131,"acs":11127,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13584,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4808541973490427,"acs":7836,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16296,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866499636031217,"acs":34654,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59071,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5803462143731422,"acs":3319,"articleLive":2,"columnArticles":54,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5719,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33485983902303634,"acs":2413,"articleLive":2,"columnArticles":53,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7206,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6692616866422856,"acs":18483,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27617,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6936353043984853,"acs":9525,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13732,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4962460644223783,"acs":10245,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20645,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7210838759096132,"acs":7531,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10444,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6222327891372114,"acs":11777,"articleLive":2,"columnArticles":182,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18927,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7345879299156391,"acs":11320,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15410,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4907676228080362,"acs":4226,"articleLive":2,"columnArticles":91,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8611,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.570837362212338,"acs":14759,"articleLive":2,"columnArticles":146,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25855,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7603217871152184,"acs":11436,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15041,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.527844671884407,"acs":10521,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19932,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5368112605305845,"acs":10259,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19111,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7729117709891049,"acs":3618,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4681,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6910931174089069,"acs":5121,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7410,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.533801580333626,"acs":1824,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3417,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45083726921425504,"acs":1050,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2329,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854557539502704,"acs":19378,"articleLive":2,"columnArticles":289,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33099,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5449750138811771,"acs":3926,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7204,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37872941176470587,"acs":28168,"articleLive":2,"columnArticles":287,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":74375,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48995161890584293,"acs":2633,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5374,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.379345813618597,"acs":3688,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9722,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6087911093003779,"acs":26897,"articleLive":2,"columnArticles":378,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44181,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37280851224961187,"acs":19691,"articleLive":2,"columnArticles":386,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52818,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5480078380143697,"acs":1678,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3062,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5193791946308725,"acs":6191,"articleLive":2,"columnArticles":110,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11920,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47192971122165517,"acs":7305,"articleLive":2,"columnArticles":102,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15479,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5807416267942583,"acs":4855,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8360,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.699699289229087,"acs":5119,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7316,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6670369341849486,"acs":2402,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3601,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3705235125096363,"acs":5287,"articleLive":2,"columnArticles":66,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14269,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6367770000537047,"acs":35571,"articleLive":2,"columnArticles":1103,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55861,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7611543674098482,"acs":28643,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37631,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.55920839191089,"acs":5171,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9247,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5771117166212534,"acs":4236,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7340,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41025164249411183,"acs":6619,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16134,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8396395268790288,"acs":67083,"articleLive":2,"columnArticles":682,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79895,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.57703489804567,"acs":58550,"articleLive":2,"columnArticles":584,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101467,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6299658205860929,"acs":11243,"articleLive":2,"columnArticles":202,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17847,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.771249760521106,"acs":24154,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31318,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6453093133922502,"acs":7594,"articleLive":2,"columnArticles":86,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11768,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5407506281407035,"acs":6887,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12736,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653591686402751,"acs":77548,"articleLive":2,"columnArticles":580,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118649,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619192629030999,"acs":43179,"articleLive":2,"columnArticles":479,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76842,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5197976746315115,"acs":22711,"articleLive":2,"columnArticles":369,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43692,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5213544478435607,"acs":17383,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33342,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6428767499313752,"acs":2342,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3643,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8666736053288926,"acs":8327,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9608,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6096997690531177,"acs":2640,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4330,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5756940806705081,"acs":1099,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1909,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7071213749823567,"acs":65128,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92103,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7025338424158278,"acs":8096,"articleLive":2,"columnArticles":104,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11524,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3181806872185315,"acs":12788,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40191,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4909443725743855,"acs":3036,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6184,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6932892787968554,"acs":6085,"articleLive":2,"columnArticles":92,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8777,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41360487087969766,"acs":3940,"articleLive":2,"columnArticles":73,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9526,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448676565526146,"acs":37136,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68156,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38,"acs":6213,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16350,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.629045996592845,"acs":5908,"articleLive":2,"columnArticles":103,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9392,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4551244075829384,"acs":3073,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6752,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3900380605659441,"acs":4714,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12086,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6469026548672566,"acs":2924,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4520,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7763061074319353,"acs":3165,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4077,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.535732516590097,"acs":6297,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11754,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5704629250307252,"acs":2785,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4882,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6082145203044704,"acs":78706,"articleLive":2,"columnArticles":871,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":129405,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4329599098146974,"acs":6145,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14193,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47819021987508253,"acs":9417,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19693,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6520859427690529,"acs":6768,"articleLive":2,"columnArticles":95,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10379,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5100571778639984,"acs":9991,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19588,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37045174427951344,"acs":6913,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18661,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6369120981117147,"acs":167434,"articleLive":2,"columnArticles":1134,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":262884,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44194114875572876,"acs":10318,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23347,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4690158820192853,"acs":6615,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14104,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2872174326250764,"acs":4231,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14731,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5612034620140129,"acs":4085,"articleLive":2,"columnArticles":82,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7279,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7150478292862399,"acs":7774,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10872,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44243585471509494,"acs":5311,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12004,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6048616498577709,"acs":4678,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7734,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48593912741580836,"acs":4199,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8641,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38591549295774646,"acs":1370,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3550,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.371111594518164,"acs":1706,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4597,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5696583396017261,"acs":14389,"articleLive":2,"columnArticles":223,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25259,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4783399714805527,"acs":9728,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20337,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4317215036027433,"acs":4973,"articleLive":2,"columnArticles":83,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11519,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32021298809772397,"acs":3067,"articleLive":2,"columnArticles":46,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9578,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5504430124848974,"acs":5467,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9932,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48761709226228667,"acs":3800,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7793,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6869824330411282,"acs":59481,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86583,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6335097426028385,"acs":10534,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16628,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46941147681389944,"acs":38365,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81730,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26726943942133813,"acs":5912,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22120,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6078913601368692,"acs":5685,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9352,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8370656370656371,"acs":7588,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9065,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48377263761879147,"acs":2698,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5577,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43435285341290564,"acs":2329,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5362,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.570404872805446,"acs":1592,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2791,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32246480896294166,"acs":6735,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20886,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166764215929044,"acs":13697,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22211,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47457999341166135,"acs":12966,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27321,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2678050362044742,"acs":2478,"articleLive":2,"columnArticles":54,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9253,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7579659742456998,"acs":8064,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10639,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6185934121836449,"acs":4864,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7863,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4911961141469338,"acs":7281,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14823,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45027105921601335,"acs":4319,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9592,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26544434857635896,"acs":6153,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23180,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46190381459193314,"acs":18575,"articleLive":2,"columnArticles":183,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40214,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6366416342493395,"acs":30604,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48071,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7761527020327219,"acs":3131,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4034,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37253924744580114,"acs":1495,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4013,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3987441130298273,"acs":2032,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5096,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5990740740740741,"acs":647,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1080,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5854277957789649,"acs":13370,"articleLive":2,"columnArticles":260,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22838,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6081643687483104,"acs":11248,"articleLive":2,"columnArticles":204,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18495,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39413406350376495,"acs":7485,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18991,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44151838671411625,"acs":1861,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4215,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6939728353140917,"acs":3270,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4712,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6455117915792074,"acs":20912,"articleLive":2,"columnArticles":326,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32396,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6509801657187401,"acs":45096,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69274,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26726405421069055,"acs":5995,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22431,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4977216964598668,"acs":4260,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8559,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6037530002181977,"acs":5534,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9166,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.507355062013268,"acs":3518,"articleLive":2,"columnArticles":63,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6934,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6366136499060365,"acs":13889,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21817,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6932958651144119,"acs":3454,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4982,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.37009317244539486,"acs":4846,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13094,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7464924082260235,"acs":3884,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5203,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43857566765578637,"acs":739,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1685,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6860509749731306,"acs":17873,"articleLive":2,"columnArticles":251,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26052,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24696522309711286,"acs":6022,"articleLive":2,"columnArticles":86,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24384,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5034654578150757,"acs":26877,"articleLive":2,"columnArticles":295,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53384,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6216936641377896,"acs":12128,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19508,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7265786749482401,"acs":5615,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7728,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46786118117769854,"acs":5379,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11497,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6129264560266451,"acs":6809,"articleLive":2,"columnArticles":88,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11109,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304573665150647,"acs":59907,"articleLive":2,"columnArticles":830,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82013,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4968951917428883,"acs":47372,"articleLive":2,"columnArticles":613,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95336,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5287196025451059,"acs":12132,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22946,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44900371496116176,"acs":2659,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5922,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6551908669282911,"acs":7346,"articleLive":2,"columnArticles":62,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11212,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5106578276389597,"acs":5007,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9805,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7745573770491804,"acs":5906,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7625,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6348758465011287,"acs":3375,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5316,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41202438511667017,"acs":1960,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4757,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5402340892465253,"acs":1477,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2734,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6941363419672653,"acs":21841,"articleLive":2,"columnArticles":355,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31465,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42253950510644783,"acs":8316,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19681,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6305210399916467,"acs":12077,"articleLive":2,"columnArticles":172,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19154,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5265079794427915,"acs":3893,"articleLive":2,"columnArticles":73,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7394,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.843934014070529,"acs":76533,"articleLive":2,"columnArticles":1109,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90686,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6722737155280925,"acs":5875,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8739,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4751016972927479,"acs":3387,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7129,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32715535193669304,"acs":4713,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14406,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5390448531784446,"acs":3341,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6198,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.597399324630815,"acs":11853,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19841,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6625321633568648,"acs":10042,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15157,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5397796817625459,"acs":3087,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5719,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4176713744402342,"acs":2425,"articleLive":2,"columnArticles":44,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5806,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49370918936136327,"acs":3100,"articleLive":2,"columnArticles":62,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6279,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5632226781051847,"acs":3020,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5362,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4696155608313549,"acs":33825,"articleLive":2,"columnArticles":421,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72027,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48206642956175777,"acs":7997,"articleLive":2,"columnArticles":115,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16589,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3436279937066605,"acs":5897,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17161,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4632957439068752,"acs":6368,"articleLive":2,"columnArticles":110,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13745,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5627376425855514,"acs":1184,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2104,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7107362821948489,"acs":10155,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14288,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.659772055719713,"acs":3126,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4738,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49114331723027377,"acs":34770,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70794,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4938727873954484,"acs":2539,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5141,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5954055321143928,"acs":6350,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10665,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47105864432597105,"acs":1237,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2626,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5409972877112456,"acs":2593,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4793,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6205413609916519,"acs":2453,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3953,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5110214666474572,"acs":3547,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6941,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4813603662524526,"acs":2944,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6116,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6172146864569278,"acs":8691,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14081,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5597245576106974,"acs":34952,"articleLive":2,"columnArticles":479,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62445,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5750378979282466,"acs":22760,"articleLive":2,"columnArticles":320,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39580,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5623578076525336,"acs":2719,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4835,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7722190090611143,"acs":8011,"articleLive":2,"columnArticles":96,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10374,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.748591082380242,"acs":18065,"articleLive":2,"columnArticles":315,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24132,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3933328316652871,"acs":5227,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13289,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5989908106334099,"acs":14601,"articleLive":2,"columnArticles":228,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24376,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6816214985196993,"acs":2993,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4391,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6672458731537794,"acs":1536,"articleLive":2,"columnArticles":37,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2302,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5633281972265023,"acs":1828,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3245,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5565099457504521,"acs":1231,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2212,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.48023284016492845,"acs":1980,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4123,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6043273662251977,"acs":12457,"articleLive":2,"columnArticles":253,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20613,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7288640595903165,"acs":7828,"articleLive":2,"columnArticles":100,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10740,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5256430868167202,"acs":13078,"articleLive":2,"columnArticles":200,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24880,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4194680707438909,"acs":3107,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7407,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5679475164011246,"acs":4848,"articleLive":2,"columnArticles":85,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8536,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9219380888290714,"acs":2740,"articleLive":2,"columnArticles":67,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2972,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8240916728645016,"acs":29917,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36303,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071220459695694,"acs":9377,"articleLive":2,"columnArticles":146,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15445,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5851001608422284,"acs":8003,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13678,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49144631996617555,"acs":30221,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61494,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8031506664871415,"acs":5965,"articleLive":2,"columnArticles":84,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7427,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5072403806371535,"acs":2452,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4834,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5193673337637186,"acs":1609,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3098,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5441941074523396,"acs":1570,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2885,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6009852216748769,"acs":976,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1624,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5416086466414693,"acs":8168,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15081,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5016114180478821,"acs":6537,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13032,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7248248437795872,"acs":19139,"articleLive":2,"columnArticles":235,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26405,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.597691673536686,"acs":3625,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6065,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6202185792349727,"acs":1589,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2562,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5065551537070524,"acs":6723,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13272,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318598679383712,"acs":45353,"articleLive":2,"columnArticles":616,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54520,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8104558163729761,"acs":12464,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15379,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41792565947242205,"acs":6971,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16680,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6602090237063472,"acs":2590,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3923,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8113695090439277,"acs":4396,"articleLive":2,"columnArticles":60,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5418,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6460140997830802,"acs":4765,"articleLive":2,"columnArticles":93,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7376,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6035811599844297,"acs":15506,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25690,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5629531970995386,"acs":13664,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24272,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.626252983293556,"acs":6560,"articleLive":2,"columnArticles":98,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10475,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8093403948001926,"acs":53792,"articleLive":2,"columnArticles":699,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66464,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5199051078656683,"acs":7013,"articleLive":2,"columnArticles":156,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13489,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46984003121342177,"acs":6021,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12815,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3597269808724742,"acs":13334,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37067,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6562764059712703,"acs":6990,"articleLive":2,"columnArticles":73,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10651,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8084098013512151,"acs":48102,"articleLive":2,"columnArticles":637,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59502,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4544545721846516,"acs":7728,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17005,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45821529745042494,"acs":6470,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14120,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5976223136716964,"acs":2614,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4374,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7866205007622542,"acs":30443,"articleLive":2,"columnArticles":433,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38701,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4668381656060811,"acs":24136,"articleLive":2,"columnArticles":363,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51701,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36109552138287127,"acs":3217,"articleLive":2,"columnArticles":75,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8909,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8187727724412057,"acs":19775,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24152,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8220055710306406,"acs":8853,"articleLive":2,"columnArticles":83,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10770,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7240346997788739,"acs":21283,"articleLive":2,"columnArticles":383,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29395,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7470737660008966,"acs":14999,"articleLive":2,"columnArticles":226,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20077,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.575432241067018,"acs":17473,"articleLive":2,"columnArticles":272,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30365,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33093525179856115,"acs":1840,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5560,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7513437057991513,"acs":5312,"articleLive":2,"columnArticles":60,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7070,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7557151297550334,"acs":16628,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22003,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.712894908992958,"acs":37052,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51974,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.378174143917217,"acs":5555,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14689,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6666457562260837,"acs":10627,"articleLive":2,"columnArticles":151,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15941,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8318884640049403,"acs":35025,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42103,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7401019701642852,"acs":11758,"articleLive":2,"columnArticles":193,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15887,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.810013890642758,"acs":12829,"articleLive":2,"columnArticles":263,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15838,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4406833280607403,"acs":2786,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6322,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6145281656234954,"acs":10211,"articleLive":2,"columnArticles":193,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16616,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6550327204736678,"acs":6306,"articleLive":2,"columnArticles":113,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9627,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6169397489372742,"acs":30913,"articleLive":2,"columnArticles":513,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50107,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.589396100808369,"acs":2479,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4206,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6141600335148723,"acs":4398,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7161,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5939841216593984,"acs":5312,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8943,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7550900427006622,"acs":24403,"articleLive":2,"columnArticles":478,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32318,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5890438247011952,"acs":5914,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10040,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7273762094479226,"acs":10224,"articleLive":2,"columnArticles":182,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14056,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4725030826140567,"acs":5748,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12165,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6892960220855816,"acs":5493,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7969,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46257868967125204,"acs":5952,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12867,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7717943058927389,"acs":6994,"articleLive":2,"columnArticles":157,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9062,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3788517677586766,"acs":1168,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3083,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5354362780593772,"acs":11831,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22096,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.686887032328369,"acs":9455,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13765,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5437324828452692,"acs":5626,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10347,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49019267488283286,"acs":5648,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11522,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5852272727272727,"acs":3502,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5984,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42142520056630484,"acs":1786,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4238,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.705948453981948,"acs":38950,"articleLive":2,"columnArticles":623,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55174,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6398700197795988,"acs":9058,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14156,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3986499425507468,"acs":8327,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20888,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5740133735413662,"acs":4378,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7627,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.47999434469107877,"acs":3395,"articleLive":2,"columnArticles":47,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7073,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8203178450651915,"acs":41965,"articleLive":2,"columnArticles":638,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51157,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.544601739723691,"acs":12772,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23452,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5922970843183609,"acs":6013,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10152,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.366550962448722,"acs":5808,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15845,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43489929172200087,"acs":15719,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36144,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7400681044267877,"acs":7824,"articleLive":2,"columnArticles":116,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10572,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3053830227743271,"acs":3245,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10626,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5062822164948454,"acs":3143,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6208,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8480565371024735,"acs":8400,"articleLive":2,"columnArticles":84,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9905,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7545848869949014,"acs":29748,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39423,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44492743930983747,"acs":6653,"articleLive":2,"columnArticles":72,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14953,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28403603962367463,"acs":11412,"articleLive":2,"columnArticles":154,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40178,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2816600252697055,"acs":2898,"articleLive":2,"columnArticles":71,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10289,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6612875536480687,"acs":3852,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5825,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315741583257507,"acs":45828,"articleLive":2,"columnArticles":507,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62643,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5300668151447662,"acs":4046,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7633,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4951302974466965,"acs":5643,"articleLive":2,"columnArticles":112,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11397,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5511319281811085,"acs":2824,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5124,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5054296506137866,"acs":8564,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16944,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4023805676738299,"acs":7471,"articleLive":2,"columnArticles":202,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18567,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5254739336492891,"acs":5322,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10128,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3653560830860534,"acs":4925,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13480,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6738868832731648,"acs":3360,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4986,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250552518320344,"acs":85116,"articleLive":2,"columnArticles":1089,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103164,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5384265575261482,"acs":7104,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13194,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41825628057830794,"acs":15217,"articleLive":2,"columnArticles":222,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36382,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5251714577557274,"acs":3599,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6853,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6062430323299889,"acs":2719,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4485,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900660510663469,"acs":48085,"articleLive":2,"columnArticles":577,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60862,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799503125938464,"acs":21243,"articleLive":2,"columnArticles":265,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36629,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5129878278328523,"acs":8176,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15938,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40394492405201615,"acs":7393,"articleLive":2,"columnArticles":168,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18302,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7395496989266079,"acs":16949,"articleLive":2,"columnArticles":226,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22918,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5745640209535177,"acs":8665,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15081,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5030096308186196,"acs":7521,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14952,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32428449546265414,"acs":4181,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12893,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8612405880243815,"acs":7206,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8367,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8373931279238587,"acs":10382,"articleLive":2,"columnArticles":161,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12398,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7277726856095326,"acs":16674,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22911,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7318246284762903,"acs":11868,"articleLive":2,"columnArticles":155,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16217,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6922457075559413,"acs":11168,"articleLive":2,"columnArticles":174,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16133,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3228246271294267,"acs":4567,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14147,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5442119944211995,"acs":1951,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3585,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7009143034247637,"acs":13569,"articleLive":2,"columnArticles":203,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19359,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31194800039694354,"acs":6287,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20154,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6952299950386278,"acs":9809,"articleLive":2,"columnArticles":170,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14109,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5412677878395861,"acs":4184,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7730,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8311979689437327,"acs":28156,"articleLive":2,"columnArticles":480,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33874,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3538435791587638,"acs":6343,"articleLive":2,"columnArticles":115,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17926,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39965252815720104,"acs":6671,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16692,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4038421920065925,"acs":7841,"articleLive":2,"columnArticles":143,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19416,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8560924369747899,"acs":4075,"articleLive":2,"columnArticles":60,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4760,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6650994715573516,"acs":17117,"articleLive":2,"columnArticles":275,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25736,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7482139104853961,"acs":14243,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19036,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4131357629154986,"acs":10316,"articleLive":2,"columnArticles":144,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":24970,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3738590726542534,"acs":1024,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2739,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7621706508462747,"acs":4368,"articleLive":2,"columnArticles":66,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5731,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6711136477134908,"acs":9407,"articleLive":2,"columnArticles":152,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14017,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6049185563717662,"acs":5682,"articleLive":2,"columnArticles":97,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9393,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41686157771635124,"acs":3921,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9406,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7531492058524372,"acs":9626,"articleLive":2,"columnArticles":175,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12781,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6910789924661299,"acs":21373,"articleLive":2,"columnArticles":362,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30927,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4929192036669631,"acs":7205,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14617,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5077593248026137,"acs":5595,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11019,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5682829702506442,"acs":4852,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8538,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6665907278733341,"acs":5852,"articleLive":2,"columnArticles":66,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8779,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6151584749655489,"acs":13392,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21770,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.806792152176078,"acs":8101,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10041,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4752475247524752,"acs":7440,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15655,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.550609583215197,"acs":7768,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14108,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5560564484515876,"acs":2837,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5102,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6933002796847191,"acs":10907,"articleLive":2,"columnArticles":222,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15732,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6034412460246269,"acs":7400,"articleLive":2,"columnArticles":148,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12263,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6849158528984002,"acs":6593,"articleLive":2,"columnArticles":178,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9626,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40860215053763443,"acs":2812,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6882,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.519121727590783,"acs":12909,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24867,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7326564665290308,"acs":25906,"articleLive":2,"columnArticles":415,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35359,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4185615095139662,"acs":7897,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18867,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5970957420625154,"acs":2426,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4063,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.748780487804878,"acs":2763,"articleLive":2,"columnArticles":34,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3690,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5405516251409823,"acs":10544,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19506,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541555724610118,"acs":34965,"articleLive":2,"columnArticles":510,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63096,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3976110224114482,"acs":6724,"articleLive":2,"columnArticles":144,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16911,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43923825181531717,"acs":3206,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7299,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7088546679499519,"acs":1473,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2078,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6549707602339181,"acs":1120,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1710,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5930232558139535,"acs":867,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1462,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5051369863013698,"acs":1180,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2336,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.585,"acs":702,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1200,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462607608847899,"acs":78544,"articleLive":2,"columnArticles":1031,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92813,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39376252286784563,"acs":4520,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11479,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6407230196703881,"acs":6026,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9405,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4657184536834427,"acs":2554,"articleLive":2,"columnArticles":45,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5484,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6200722238940716,"acs":4121,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6646,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8219399801965115,"acs":43165,"articleLive":2,"columnArticles":639,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":52516,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5867458405691558,"acs":10474,"articleLive":2,"columnArticles":175,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17851,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4827727645611157,"acs":32956,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68264,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5619335347432024,"acs":3720,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6620,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6984792868379653,"acs":2664,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3814,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6476781078742428,"acs":17964,"articleLive":2,"columnArticles":378,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27736,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916067310546384,"acs":34670,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43797,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4110169491525424,"acs":5626,"articleLive":2,"columnArticles":140,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13688,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5267267267267267,"acs":2631,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4995,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8568969227458575,"acs":3982,"articleLive":2,"columnArticles":52,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4647,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729105588381219,"acs":12702,"articleLive":2,"columnArticles":215,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22171,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6171768885173963,"acs":5907,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9571,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7114035087719298,"acs":9732,"articleLive":2,"columnArticles":155,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13680,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6278343050950802,"acs":16475,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26241,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.802704773325339,"acs":24098,"articleLive":2,"columnArticles":342,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30021,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.522915689034882,"acs":10029,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19179,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49895213345628303,"acs":5952,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11929,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36473214285714284,"acs":1634,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4480,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3963202779532533,"acs":5019,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12664,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6328199177128389,"acs":11997,"articleLive":2,"columnArticles":205,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18958,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.522949732870569,"acs":13410,"articleLive":2,"columnArticles":209,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25643,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.632228771706229,"acs":7937,"articleLive":2,"columnArticles":138,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12554,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44234255537164024,"acs":5612,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12687,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5966057441253264,"acs":2285,"articleLive":2,"columnArticles":47,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3830,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7454050374404356,"acs":15330,"articleLive":2,"columnArticles":311,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20566,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5009360108917631,"acs":5887,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11752,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42765096990883544,"acs":6239,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14589,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5913292253521126,"acs":2687,"articleLive":2,"columnArticles":64,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4544,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7684454085321765,"acs":26569,"articleLive":2,"columnArticles":370,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34575,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3095538925065604,"acs":6370,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20578,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48447015834348356,"acs":6364,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13136,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.617196261682243,"acs":1651,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2675,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7072415435921867,"acs":2969,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4198,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7950377562028047,"acs":2211,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2781,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8429048203771922,"acs":53543,"articleLive":2,"columnArticles":724,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63522,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5439799454397994,"acs":7378,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13563,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6165890170320019,"acs":8073,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13093,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.674473169671953,"acs":15523,"articleLive":2,"columnArticles":165,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23015,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7181208053691275,"acs":1926,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2682,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7216450216450216,"acs":15003,"articleLive":2,"columnArticles":232,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20790,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8650424308787298,"acs":12640,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14612,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2906261095987691,"acs":4911,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16898,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5803007191109174,"acs":2663,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4589,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5648766328011611,"acs":1946,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3445,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692519315132384,"acs":128598,"articleLive":2,"columnArticles":1288,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147941,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5140712945590994,"acs":10138,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19721,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5865893385052818,"acs":31152,"articleLive":2,"columnArticles":404,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53107,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30026833631484795,"acs":3357,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11180,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8079673135852911,"acs":791,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":979,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6599197347757808,"acs":3782,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5731,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585335768100519,"acs":70993,"articleLive":2,"columnArticles":681,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82691,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31049786169611876,"acs":7696,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24786,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2372462259239979,"acs":7292,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30736,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6909961112772959,"acs":11550,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16715,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8562185478073329,"acs":1191,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1391,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6716775085105666,"acs":19928,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29669,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6621528120984481,"acs":6699,"articleLive":2,"columnArticles":79,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10117,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5679319947237286,"acs":7750,"articleLive":2,"columnArticles":147,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13646,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3697976640894884,"acs":2248,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6079,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5426887762094011,"acs":3960,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7297,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5372204786190663,"acs":10955,"articleLive":2,"columnArticles":166,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20392,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39055834231869113,"acs":8331,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21331,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3346353332906448,"acs":5226,"articleLive":2,"columnArticles":66,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15617,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3752603082049146,"acs":2703,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7203,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.302099533437014,"acs":777,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2572,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.590145094095676,"acs":4108,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6961,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7167625169147497,"acs":25425,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35472,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5130560057626509,"acs":8547,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16659,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5947503201024328,"acs":7432,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12496,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36315615714757343,"acs":3300,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9087,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8408104196816208,"acs":581,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":691,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5898449376710246,"acs":9700,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16445,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.552686607873443,"acs":6079,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10999,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5471737982039091,"acs":5179,"articleLive":2,"columnArticles":77,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9465,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5766307430516165,"acs":5083,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8815,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6783103168155971,"acs":4175,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6155,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488414114109774,"acs":58722,"articleLive":2,"columnArticles":745,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69179,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37993200782940145,"acs":11064,"articleLive":2,"columnArticles":149,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29121,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3233061107235195,"acs":7878,"articleLive":2,"columnArticles":137,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24367,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34284780477176163,"acs":3147,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9179,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7327494125186926,"acs":3430,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4681,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6744664716715415,"acs":24904,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36924,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29773095623987034,"acs":5511,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18510,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33280360217189775,"acs":2513,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7551,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3968158606188045,"acs":2642,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6658,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.708253358925144,"acs":738,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1042,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5774256967734475,"acs":9986,"articleLive":2,"columnArticles":171,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17294,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42781115879828324,"acs":4984,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11650,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6620875751257206,"acs":5398,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8153,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6160140268848626,"acs":3162,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5133,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5033632286995515,"acs":3592,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7136,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851168156907989,"acs":29942,"articleLive":2,"columnArticles":359,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38137,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6908921500116468,"acs":8898,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12879,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5674476277491353,"acs":8695,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15323,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32838224767358626,"acs":1835,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5588,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6151736745886655,"acs":2692,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4376,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6189473684210526,"acs":294,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":475,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7892679786647048,"acs":17165,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21748,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4532250882060768,"acs":13231,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29193,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4402961055680721,"acs":4104,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9321,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36639526276831974,"acs":4455,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12159,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5990566037735849,"acs":127,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":212,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5391424075531078,"acs":16446,"articleLive":2,"columnArticles":247,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30504,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31761705466910806,"acs":4857,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15292,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4611455108359133,"acs":5958,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12920,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38487549953888717,"acs":2504,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6506,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5516594787174198,"acs":2942,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5333,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5462454086000718,"acs":19779,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36209,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5539541759053954,"acs":7495,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13530,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41410009624639077,"acs":5163,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12468,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5370174510840825,"acs":4062,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7564,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7119675456389453,"acs":351,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":493,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6690217391304348,"acs":2462,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3680,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6592868217054264,"acs":21262,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32250,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8169209431345353,"acs":11191,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13699,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5110687664630388,"acs":9119,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17843,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29575257101349545,"acs":7736,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26157,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7103174603174603,"acs":537,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":756,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4382412496384148,"acs":3030,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6914,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5788688096380404,"acs":10859,"articleLive":2,"columnArticles":165,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18759,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7682926829268293,"acs":7875,"articleLive":2,"columnArticles":107,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10250,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6226677805625174,"acs":4472,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7182,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3663335086796423,"acs":3482,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9505,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5750133120340788,"acs":8639,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15024,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.779985233908316,"acs":11621,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14899,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3095307490527543,"acs":4248,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13724,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3784814956123617,"acs":3968,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10484,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5412844036697247,"acs":649,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1199,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7248217468805704,"acs":3253,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4488,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44579739556908504,"acs":7908,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17739,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39892217069808245,"acs":12732,"articleLive":2,"columnArticles":203,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":31916,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.456093666844066,"acs":2571,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5637,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47370848708487084,"acs":2054,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4336,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8982035928143712,"acs":1650,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1837,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7586206896551724,"acs":3410,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4495,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048677605770448,"acs":19081,"articleLive":2,"columnArticles":322,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23707,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2951156471601829,"acs":4453,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15089,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3265753424657534,"acs":4768,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14600,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5956632653061225,"acs":4203,"articleLive":2,"columnArticles":67,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7056,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4762801304659118,"acs":17961,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37711,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32511125238397964,"acs":5114,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15730,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5825933454584359,"acs":10891,"articleLive":2,"columnArticles":203,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18694,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6190329771696518,"acs":16106,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26018,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.632420091324201,"acs":277,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":438,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8075497915701714,"acs":3487,"articleLive":2,"columnArticles":46,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4318,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6709681968831536,"acs":9515,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14181,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6852946576096934,"acs":18664,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27235,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6643030225736514,"acs":26044,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39205,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299638989169675,"acs":2382,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5540,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6260162601626016,"acs":385,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":615,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8254233245886,"acs":3461,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4193,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8391621755914842,"acs":43910,"articleLive":2,"columnArticles":698,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52326,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2937853107344633,"acs":3848,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13098,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2685123661867848,"acs":3637,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13545,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5786458333333333,"acs":1111,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1920,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44508470669586264,"acs":7724,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17354,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5310706510983574,"acs":5367,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10106,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3135771017533343,"acs":4185,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13346,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46505905511811024,"acs":1890,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4064,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7491535857186826,"acs":2434,"articleLive":2,"columnArticles":41,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3249,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628959276018099,"acs":293,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":442,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6724222086638194,"acs":11021,"articleLive":2,"columnArticles":149,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16390,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41927789222595685,"acs":3867,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9223,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6788083463997105,"acs":16884,"articleLive":2,"columnArticles":206,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24873,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48988309352517984,"acs":2179,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4448,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7835400225479143,"acs":695,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":887,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443822802421443,"acs":57049,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67563,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.415257048092869,"acs":3756,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9045,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7360275150472915,"acs":3424,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4652,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34145828955662955,"acs":1625,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4759,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5456794822992006,"acs":2867,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5254,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6395045632333768,"acs":9810,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15340,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.511922556765606,"acs":7192,"articleLive":2,"columnArticles":125,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14049,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27025787965616044,"acs":2358,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8725,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6101892285298399,"acs":2096,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3435,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7355371900826446,"acs":445,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":605,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7227508650519031,"acs":1671,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2312,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8212464176422014,"acs":16907,"articleLive":2,"columnArticles":286,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20587,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49687529148400333,"acs":5327,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10721,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2755001099142669,"acs":5013,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18196,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6214689265536724,"acs":1760,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2832,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5910780669144982,"acs":318,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":538,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6737958139109771,"acs":7372,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10941,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3713985594237695,"acs":2475,"articleLive":2,"columnArticles":43,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6664,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4409507303788066,"acs":1781,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4039,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14971546192032933,"acs":2473,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16518,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.783493369913123,"acs":3427,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4374,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6257306746790494,"acs":11454,"articleLive":2,"columnArticles":197,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18305,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5431368926658046,"acs":2940,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5413,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38650668764752166,"acs":3930,"articleLive":2,"columnArticles":85,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10168,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3810487007935273,"acs":2449,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6427,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8417721518987342,"acs":399,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":474,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5242669680416903,"acs":8350,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15927,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7681489141675284,"acs":7428,"articleLive":2,"columnArticles":115,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9670,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4933724066994003,"acs":25422,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51527,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3188028627195836,"acs":1470,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4611,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6566046848587298,"acs":2719,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4141,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5253012048192771,"acs":436,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":830,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5485687470671047,"acs":1169,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2131,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7069865254303295,"acs":9077,"articleLive":2,"columnArticles":177,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12839,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8065973791233619,"acs":5355,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6639,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7116843702579666,"acs":2814,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3954,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4010088272383354,"acs":1272,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3172,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6594861147158059,"acs":12705,"articleLive":2,"columnArticles":217,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19265,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7708877700592697,"acs":12096,"articleLive":2,"columnArticles":278,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15691,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4509612705488994,"acs":6474,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14356,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4518,"acs":2259,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5000,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.546692607003891,"acs":1124,"articleLive":2,"columnArticles":23,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2056,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.40971867007672635,"acs":801,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1955,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5366924588553181,"acs":34958,"articleLive":2,"columnArticles":356,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65136,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5148521837296267,"acs":7297,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14173,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2779642058165548,"acs":3479,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12516,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.474036850921273,"acs":2547,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5373,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7946484131922837,"acs":1277,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1607,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6832129963898917,"acs":757,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1108,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6564497931553216,"acs":6982,"articleLive":2,"columnArticles":177,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10636,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5060307017543859,"acs":3692,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7296,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27387929668937117,"acs":3458,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12626,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38290598290598293,"acs":2016,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5265,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.781327759530208,"acs":7850,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10047,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4647338080705324,"acs":5482,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11796,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29971734302442965,"acs":8907,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29718,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4125230202578269,"acs":1344,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3258,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7381818181818182,"acs":406,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":550,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.725147845677274,"acs":2575,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3551,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8121226378107113,"acs":20714,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25506,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725601554326708,"acs":7662,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13382,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.544858209708346,"acs":5399,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9909,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.663594470046083,"acs":5184,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7812,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6031439602868174,"acs":2187,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3626,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4439119170984456,"acs":6854,"articleLive":2,"columnArticles":129,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15440,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.758336279014964,"acs":12872,"articleLive":2,"columnArticles":236,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16974,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5266068575642129,"acs":4285,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8137,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46757990867579907,"acs":2048,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4380,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.850952748100011,"acs":38629,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45395,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35428089413749475,"acs":7560,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21339,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3642950297058397,"acs":2514,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6901,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4351297405189621,"acs":2616,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6012,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7634508348794063,"acs":823,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1078,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.38971583220568334,"acs":2016,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5173,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8300370828182941,"acs":17459,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21034,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.497134670487106,"acs":6940,"articleLive":2,"columnArticles":112,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13960,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4643992098256463,"acs":5407,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11643,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38450339695891295,"acs":2377,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6182,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5213946117274167,"acs":329,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":631,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8959835221421215,"acs":3480,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3884,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8281822176651531,"acs":16962,"articleLive":2,"columnArticles":356,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20481,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5998055735580039,"acs":3702,"articleLive":2,"columnArticles":86,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6172,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47094474153297683,"acs":2642,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5610,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4020964360587002,"acs":959,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2385,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8052929292929293,"acs":19931,"articleLive":2,"columnArticles":267,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24750,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8669309508313118,"acs":14652,"articleLive":2,"columnArticles":192,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16901,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5174750356633381,"acs":4353,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8412,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4888977795559112,"acs":2444,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4999,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6523297491039427,"acs":182,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":279,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.7999295526593871,"acs":2271,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2839,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6354260456740607,"acs":7763,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12217,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4619146413752223,"acs":6234,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13496,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3980650499649927,"acs":6254,"articleLive":2,"columnArticles":112,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15711,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.525985013294658,"acs":2176,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4137,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5251959686450168,"acs":469,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":893,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7982102908277405,"acs":1784,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2235,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7091736569694806,"acs":7947,"articleLive":2,"columnArticles":181,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11206,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.610318331503842,"acs":3892,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6377,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47792333818534694,"acs":2955,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6183,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3835534213685474,"acs":1278,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3332,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7817001028806584,"acs":12157,"articleLive":2,"columnArticles":185,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15552,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3469783214242461,"acs":5730,"articleLive":2,"columnArticles":120,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16514,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5852665852665853,"acs":4314,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7371,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5031589408674665,"acs":14176,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28174,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6994780014914244,"acs":938,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1341,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7027818448023426,"acs":1440,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2049,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6945260507224654,"acs":11584,"articleLive":2,"columnArticles":184,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16679,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3591224156237697,"acs":30102,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83821,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26243139863628806,"acs":6312,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24052,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49610093197235783,"acs":15650,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31546,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.638961038961039,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":385,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7289002557544757,"acs":1710,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2346,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6748476229175132,"acs":8304,"articleLive":2,"columnArticles":194,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12305,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43314240568832707,"acs":2193,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5063,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4908909408535064,"acs":1967,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4007,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3700234192037471,"acs":632,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1708,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8692156679442834,"acs":46490,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53485,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6457835642618251,"acs":10813,"articleLive":2,"columnArticles":167,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16744,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5152107779226424,"acs":4742,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9204,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5064810578829271,"acs":23249,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45903,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5621890547263682,"acs":339,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":603,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7878810082063306,"acs":10753,"articleLive":2,"columnArticles":146,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13648,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4803265873360549,"acs":5530,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11513,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5752598055648676,"acs":3432,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5966,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3580167417900837,"acs":1112,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3106,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6219020172910663,"acs":2158,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3470,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.531933508311461,"acs":608,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1143,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4714212152420185,"acs":1831,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3884,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7921706765917852,"acs":11919,"articleLive":2,"columnArticles":204,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15046,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4593311758360302,"acs":2129,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4635,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232710908808773,"acs":27966,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38666,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4890995260663507,"acs":1032,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2110,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4492097192734135,"acs":28563,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63585,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3106386641418489,"acs":3609,"articleLive":2,"columnArticles":103,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11618,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539212757646086,"acs":28458,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43519,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47096774193548385,"acs":2701,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5735,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7019464720194647,"acs":577,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":822,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8414186710150836,"acs":2064,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2453,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7097071902005202,"acs":8459,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11919,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6968603167688334,"acs":22395,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32137,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3627814009507092,"acs":28314,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78047,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4849483944954128,"acs":3383,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6976,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5938356164383561,"acs":867,"articleLive":2,"columnArticles":37,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1460,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.70276008492569,"acs":1324,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1884,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7480451781059948,"acs":11193,"articleLive":2,"columnArticles":222,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14963,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5309085681426107,"acs":3693,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6956,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4568627450980392,"acs":3262,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7140,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.47079037800687284,"acs":2192,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4656,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6805764680576468,"acs":9492,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13947,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6294820717131474,"acs":6004,"articleLive":2,"columnArticles":128,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9538,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4221799619657692,"acs":4218,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9991,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4108271503160209,"acs":2990,"articleLive":2,"columnArticles":50,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7278,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7949790794979079,"acs":380,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":478,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9207592648388069,"acs":3056,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3319,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6379233709663081,"acs":7176,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11249,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4292109681029659,"acs":4602,"articleLive":2,"columnArticles":96,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10722,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5390766056229043,"acs":4180,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7754,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4302055702917772,"acs":2595,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6032,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6911468812877264,"acs":687,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":994,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6100937918713711,"acs":4098,"articleLive":2,"columnArticles":81,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6717,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4756845116469146,"acs":2328,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4894,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5521229645411657,"acs":3628,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6571,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37606837606837606,"acs":1408,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3744,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7886255924170616,"acs":832,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1055,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.765528781793842,"acs":11437,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14940,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8562823449563078,"acs":10093,"articleLive":2,"columnArticles":171,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11787,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37030058322117543,"acs":4127,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11145,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36578864847914705,"acs":2333,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6378,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5194029850746269,"acs":348,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":670,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8427237435736019,"acs":16064,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19062,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5508045977011494,"acs":5990,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10875,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47423251690125234,"acs":4279,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9023,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4613980177360459,"acs":1769,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3834,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7819048995519584,"acs":5410,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6919,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5186246418338109,"acs":181,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":349,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6479802143446002,"acs":5502,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8491,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6647637556176363,"acs":5473,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8233,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5193916349809886,"acs":4098,"articleLive":2,"columnArticles":60,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7890,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29228522754928205,"acs":1201,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4109,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7978793903247183,"acs":1204,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1509,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42138935306755787,"acs":8826,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20945,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34998360476554813,"acs":6404,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18298,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34169845412567756,"acs":3404,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9962,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541345032487366,"acs":11779,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18007,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7169230769230769,"acs":233,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":325,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7115384615384616,"acs":1554,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2184,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6448611931482575,"acs":13101,"articleLive":2,"columnArticles":143,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20316,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8087118150961694,"acs":10007,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12374,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5135683094198378,"acs":6586,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12824,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4143130176258229,"acs":3902,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9418,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5807560137457045,"acs":169,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":291,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7857142857142857,"acs":1859,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2366,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48799882197025474,"acs":6628,"articleLive":2,"columnArticles":122,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13582,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5739396255254108,"acs":4506,"articleLive":2,"columnArticles":71,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7851,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5213921901528014,"acs":3071,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5890,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5185022026431718,"acs":2354,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4540,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6833882155118055,"acs":9754,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14273,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37899459756432563,"acs":4139,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10921,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2626110902490925,"acs":4196,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15978,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40937138449672195,"acs":2123,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5186,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.57125,"acs":457,"articleLive":2,"columnArticles":27,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":800,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48831493618489136,"acs":11325,"articleLive":2,"columnArticles":148,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23192,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6621466035563516,"acs":5176,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7817,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.586312877778916,"acs":5723,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9761,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2679100383982447,"acs":2442,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9115,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6258652094717668,"acs":1718,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2745,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6216216216216216,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":296,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6620370370370371,"acs":858,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1296,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7940683811212927,"acs":8059,"articleLive":2,"columnArticles":190,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10149,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5131869185767718,"acs":5351,"articleLive":2,"columnArticles":73,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10427,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3456957490074562,"acs":3570,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10327,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2985341437254201,"acs":1670,"articleLive":2,"columnArticles":39,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5594,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7530050687907314,"acs":10399,"articleLive":2,"columnArticles":155,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13810,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6984942220147076,"acs":5984,"articleLive":2,"columnArticles":96,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8567,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37358024691358027,"acs":25721,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68850,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3681782020684169,"acs":2314,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6285,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5048543689320388,"acs":104,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":206,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9018315018315018,"acs":2462,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2730,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8098134630981346,"acs":19970,"articleLive":2,"columnArticles":199,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24660,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7149742115498435,"acs":8456,"articleLive":2,"columnArticles":105,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11827,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6559749492213948,"acs":7751,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11816,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28574521052061913,"acs":2640,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9239,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4386252045826514,"acs":268,"articleLive":2,"columnArticles":21,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":611,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7947814413960903,"acs":9473,"articleLive":2,"columnArticles":138,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11919,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8674212708730248,"acs":7740,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8923,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6826675810046289,"acs":3982,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5833,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4875141884222474,"acs":859,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1762,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7400332225913622,"acs":891,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1204,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8246003826451892,"acs":13361,"articleLive":2,"columnArticles":212,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16203,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6844929855945768,"acs":43620,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63726,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3519028909869231,"acs":6001,"articleLive":2,"columnArticles":129,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17053,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5097155730780062,"acs":3620,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7102,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7094017094017094,"acs":415,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":585,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7957486136783734,"acs":7749,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9738,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42931377497995665,"acs":28916,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67354,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5749005744586831,"acs":6505,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11315,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3895175699821322,"acs":1962,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5037,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5137101287073307,"acs":918,"articleLive":2,"columnArticles":29,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1787,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6555555555555556,"acs":118,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":180,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5076427996781979,"acs":631,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1243,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8003954867977201,"acs":6881,"articleLive":2,"columnArticles":112,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8597,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5344515704653839,"acs":6500,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12162,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336453757158957,"acs":27549,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43477,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.35940868493994454,"acs":2334,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6494,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6828387778462622,"acs":7755,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11357,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3282000234219464,"acs":5605,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17078,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6097748208802457,"acs":2383,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3908,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4008854900382371,"acs":1992,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4969,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7032967032967034,"acs":192,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":273,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6460396039603961,"acs":1044,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1616,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7890894341918475,"acs":11673,"articleLive":2,"columnArticles":121,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14793,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6814165042235217,"acs":10487,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15390,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3562629979203327,"acs":4454,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12502,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45117634811576096,"acs":2167,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4803,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.634508348794063,"acs":342,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":539,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7667671018859502,"acs":6871,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8961,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7718558282208589,"acs":4026,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5216,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6189591078066915,"acs":3330,"articleLive":2,"columnArticles":68,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5380,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31274292059966685,"acs":2253,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7204,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9051804215791354,"acs":12668,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13995,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.387188108299416,"acs":4376,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11302,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5128726287262872,"acs":5299,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10332,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5975215517241379,"acs":2218,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3712,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7444608567208272,"acs":504,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":677,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5423728813559322,"acs":160,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":295,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7881397942743834,"acs":12719,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16138,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45574764937822265,"acs":7513,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16485,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.276346171608017,"acs":5984,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21654,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6211332312404287,"acs":2028,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3265,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8118657298985168,"acs":2080,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2562,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.893491124260355,"acs":302,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":338,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7463768115942029,"acs":412,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":552,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7279066971263677,"acs":6054,"articleLive":2,"columnArticles":94,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8317,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8202570395587575,"acs":31082,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37893,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4291433146517214,"acs":2144,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4996,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4131111111111111,"acs":1859,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4500,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7716723904672703,"acs":7415,"articleLive":2,"columnArticles":99,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9609,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3531790213888075,"acs":6027,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17065,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27827278958190543,"acs":3654,"articleLive":2,"columnArticles":110,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13131,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3757562662057044,"acs":1739,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4628,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6896304269824184,"acs":1922,"articleLive":2,"columnArticles":37,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2787,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5210970464135021,"acs":247,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":474,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5713678393027952,"acs":5376,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9409,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6457099659821091,"acs":5125,"articleLive":2,"columnArticles":65,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7937,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31701738334858187,"acs":2772,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8744,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2706380793426627,"acs":2108,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7789,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7071905114899926,"acs":954,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1349,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4672131147540984,"acs":285,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":610,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.337707182320442,"acs":489,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1448,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5912434852960545,"acs":31424,"articleLive":2,"columnArticles":409,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53149,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45816152687587963,"acs":37112,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81002,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5311695002575991,"acs":2062,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3882,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5056784219964137,"acs":846,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1673,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5312869947573144,"acs":6283,"articleLive":2,"columnArticles":78,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11826,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3102137044642178,"acs":4079,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13149,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6294665537679932,"acs":3717,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5905,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4362813370473538,"acs":1253,"articleLive":2,"columnArticles":35,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2872,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6608238387379491,"acs":754,"articleLive":2,"columnArticles":27,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1141,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4519774011299435,"acs":80,"articleLive":2,"columnArticles":4,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":177,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6439003436426117,"acs":7495,"articleLive":2,"columnArticles":102,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11640,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27888870676938204,"acs":3403,"articleLive":2,"columnArticles":70,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12202,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5706351122917169,"acs":4726,"articleLive":2,"columnArticles":94,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8282,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42329303592712414,"acs":2486,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5873,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5888077858880778,"acs":484,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":822,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.668,"acs":167,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":250,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32563494278537536,"acs":4667,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14332,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6754369825206992,"acs":3671,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5435,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5687784389219461,"acs":3250,"articleLive":2,"columnArticles":69,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5714,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2695319007163085,"acs":1618,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6003,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8365236974101751,"acs":8172,"articleLive":2,"columnArticles":83,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9769,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44068027210884353,"acs":3239,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7350,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3913641364136414,"acs":2846,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7272,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5517403574788335,"acs":1173,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2126,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28412537917087965,"acs":281,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":989,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.48880597014925375,"acs":131,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":268,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.39233038348082594,"acs":399,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1017,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9148164146868251,"acs":10589,"articleLive":2,"columnArticles":92,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11575,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34407393530660674,"acs":5510,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16014,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3610026550054662,"acs":4623,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12806,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23688825123545354,"acs":1486,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6273,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.37579617834394907,"acs":59,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":157,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6939573974786263,"acs":4789,"articleLive":2,"columnArticles":60,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6901,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34432515337423314,"acs":3592,"articleLive":2,"columnArticles":60,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10432,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4132288545747868,"acs":1793,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4339,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39656393907190934,"acs":2239,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5646,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9137037037037037,"acs":12335,"articleLive":2,"columnArticles":107,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13500,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.47956616052060735,"acs":5527,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11525,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5605479452054795,"acs":2046,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3650,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3272235576923077,"acs":1089,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3328,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5439900867410161,"acs":439,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":807,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7389033942558747,"acs":283,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":383,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7391829562925544,"acs":6731,"articleLive":2,"columnArticles":94,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9106,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45002805161497156,"acs":5615,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12477,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24236597184831937,"acs":3151,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13001,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34537177541729897,"acs":1138,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3295,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6237337192474675,"acs":431,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":691,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7954070981210856,"acs":381,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":479,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7719298245614035,"acs":4796,"articleLive":2,"columnArticles":85,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6213,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39254896589508287,"acs":2866,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7301,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4077922077922078,"acs":1884,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4620,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5775432424508942,"acs":1970,"articleLive":2,"columnArticles":52,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3411,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6640243902439025,"acs":6534,"articleLive":2,"columnArticles":75,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9840,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3043081312410842,"acs":5333,"articleLive":2,"columnArticles":81,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17525,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5415766738660908,"acs":4012,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7408,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5149572649572649,"acs":964,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1872,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5379464285714286,"acs":241,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":448,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5541666666666667,"acs":133,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":240,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6688741721854304,"acs":303,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":453,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5457122608079377,"acs":6930,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12699,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3255100475533057,"acs":4244,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13038,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4809496236247829,"acs":4153,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8635,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49617737003058104,"acs":2596,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5232,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.45625,"acs":146,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":320,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6059499661933739,"acs":4481,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7395,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42355336840319024,"acs":2496,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5893,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41402714932126694,"acs":1464,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3536,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2779524023349798,"acs":619,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2227,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5345650500384912,"acs":6944,"articleLive":2,"columnArticles":64,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12990,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4306919211441825,"acs":5571,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12935,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6153953229398663,"acs":4421,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7184,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.384125428711416,"acs":3136,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8164,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7369519832985386,"acs":353,"articleLive":2,"columnArticles":13,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":479,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7241379310344828,"acs":42,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":58,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7783762985763756,"acs":6069,"articleLive":2,"columnArticles":57,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7797,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35806178260534627,"acs":4648,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12981,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.278836029482148,"acs":2913,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10447,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47958069447477614,"acs":2196,"articleLive":2,"columnArticles":49,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4579,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5511811023622047,"acs":490,"articleLive":2,"columnArticles":19,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":889,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4552238805970149,"acs":183,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":402,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7402499053388868,"acs":3910,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5282,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3813996560391586,"acs":2883,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7559,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2894273127753304,"acs":1971,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6810,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24723247232472326,"acs":737,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2981,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5371900826446281,"acs":260,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":484,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8126571209968303,"acs":7435,"articleLive":2,"columnArticles":84,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9149,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5806548513066987,"acs":5799,"articleLive":2,"columnArticles":92,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9987,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29815268489704033,"acs":4503,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15103,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4573816155988858,"acs":821,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1795,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6578947368421053,"acs":50,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":76,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5800161648817943,"acs":5741,"articleLive":2,"columnArticles":64,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9898,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41270888302550574,"acs":5631,"articleLive":2,"columnArticles":79,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13644,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2757208008038958,"acs":3567,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12937,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.46098596147567744,"acs":1412,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3063,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6764705882352942,"acs":184,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":272,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.45555555555555555,"acs":41,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":90,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6096774193548387,"acs":189,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":310,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.660437629771602,"acs":4135,"articleLive":2,"columnArticles":57,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6261,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5944681716493797,"acs":2923,"articleLive":2,"columnArticles":56,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4917,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.384994640943194,"acs":1796,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4665,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3630862329803328,"acs":1200,"articleLive":2,"columnArticles":35,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3305,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5514046622833234,"acs":5535,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10038,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24676735284990173,"acs":4771,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19334,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3411764705882353,"acs":2088,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6120,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4195567144719687,"acs":1609,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3835,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6588235294117647,"acs":56,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":85,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7779076563413209,"acs":6655,"articleLive":2,"columnArticles":85,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8555,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.35829317778341363,"acs":5651,"articleLive":2,"columnArticles":124,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15772,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.571475249142297,"acs":3498,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6121,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39231738035264485,"acs":1869,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4764,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.3991031390134529,"acs":89,"articleLive":2,"columnArticles":4,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":223,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6744186046511628,"acs":29,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":43,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8839350617882239,"acs":3648,"articleLive":2,"columnArticles":49,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4127,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.29636626291810203,"acs":2667,"articleLive":2,"columnArticles":49,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":8999,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4192032686414709,"acs":2052,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4895,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4140700289110183,"acs":1289,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3113,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6224489795918368,"acs":61,"articleLive":2,"columnArticles":3,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":98,"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.9047958892377962,"acs":6339,"articleLive":2,"columnArticles":53,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":7006,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3555478321313754,"acs":4092,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11509,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3273450687243791,"acs":2715,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8294,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5202115602568946,"acs":1377,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2647,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8648648648648649,"acs":32,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":37,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5547057573826216,"acs":5222,"articleLive":2,"columnArticles":67,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9414,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34657002858309516,"acs":3395,"articleLive":2,"columnArticles":91,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9796,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41066725197541704,"acs":1871,"articleLive":2,"columnArticles":48,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4556,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34418446931163105,"acs":1015,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2949,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.828125,"acs":106,"articleLive":2,"columnArticles":4,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":128,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.7592592592592593,"acs":41,"articleLive":2,"columnArticles":4,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":54,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6580348499515973,"acs":2719,"articleLive":2,"columnArticles":32,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4132,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7564026206075045,"acs":2540,"articleLive":2,"columnArticles":37,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3358,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4763458401305057,"acs":2044,"articleLive":2,"columnArticles":52,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4291,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2556739231125521,"acs":1104,"articleLive":2,"columnArticles":38,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4318,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9130434782608695,"acs":147,"articleLive":2,"columnArticles":8,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":161,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5482625482625483,"acs":3976,"articleLive":2,"columnArticles":42,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7252,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.42181022570244125,"acs":3663,"articleLive":2,"columnArticles":53,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":8684,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.21626893070215694,"acs":1885,"articleLive":2,"columnArticles":66,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8716,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3392330383480826,"acs":1035,"articleLive":2,"columnArticles":37,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3051,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.7142857142857143,"acs":15,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":21,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6688934069125763,"acs":4606,"articleLive":2,"columnArticles":76,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":6886,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3816945974452127,"acs":3257,"articleLive":2,"columnArticles":65,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":8533,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.292259083728278,"acs":2405,"articleLive":2,"columnArticles":57,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":8229,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.26973365617433415,"acs":1114,"articleLive":2,"columnArticles":36,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":4130,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.8451006096926567,"acs":81226,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96114,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6909182899064003,"acs":13656,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19765,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21932602836739912,"acs":11149,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50833,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3772402739326825,"acs":2589,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6863,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.200077965110613,"acs":2053,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10261,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8397587352811233,"acs":43717,"articleLive":2,"columnArticles":659,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52059,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7693261678379496,"acs":39081,"articleLive":2,"columnArticles":470,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50799,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2882780554293503,"acs":5076,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17608,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27548243961655994,"acs":6581,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23889,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5890813991500491,"acs":1802,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3059,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6895722728638686,"acs":6884,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9983,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4106982126784107,"acs":6388,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15554,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6120137225710401,"acs":9455,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15449,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21078279702970298,"acs":2725,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12928,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5748824714573539,"acs":856,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1489,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3113496932515337,"acs":609,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1956,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7989600216099406,"acs":23662,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29616,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28654788637741974,"acs":17482,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":61009,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163635409285358,"acs":19675,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38103,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3123571805238179,"acs":1777,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5689,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3356788079470199,"acs":811,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2416,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3334698131467282,"acs":8959,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26866,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3381879108132491,"acs":2624,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7759,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28201970443349755,"acs":916,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3248,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3321917808219178,"acs":1164,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3504,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3351482153660012,"acs":554,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1653,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32886435331230285,"acs":1251,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3804,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28232532449599557,"acs":10223,"articleLive":2,"columnArticles":173,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36210,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1868038963425841,"acs":5082,"articleLive":2,"columnArticles":123,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27205,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3493142144638404,"acs":5603,"articleLive":2,"columnArticles":97,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16040,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2526716439759918,"acs":1726,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6831,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4051123160340821,"acs":1046,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2582,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.217079969242599,"acs":4517,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20808,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4835641926814141,"acs":2339,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4837,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39807162534435264,"acs":1156,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2904,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26192893401015227,"acs":774,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2955,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19290354822588707,"acs":772,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4002,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5620525059665871,"acs":471,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":838,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5039645208977288,"acs":3750,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7441,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23134822167080232,"acs":2797,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12090,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4165584415584416,"acs":1283,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3080,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19902248289345065,"acs":1018,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5115,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.39632277834525026,"acs":388,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":979,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8529182879377432,"acs":2192,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2570,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18503649635036495,"acs":1014,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5480,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.36617262423714037,"acs":840,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2294,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.353129282777524,"acs":773,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2189,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15146396396396397,"acs":269,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1776,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22396694214876034,"acs":271,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1210,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5440753335077164,"acs":4160,"articleLive":2,"columnArticles":96,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7646,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6971744471744472,"acs":3405,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4884,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41370869033047736,"acs":1690,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4085,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6781769375557132,"acs":402458,"articleLive":2,"columnArticles":2796,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":593441,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4033335996361893,"acs":262525,"articleLive":2,"columnArticles":2094,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":650888,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7609496715296653,"acs":288075,"articleLive":2,"columnArticles":1946,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":378573,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7514813506657742,"acs":304250,"articleLive":2,"columnArticles":2090,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":404867,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6978663971331435,"acs":189872,"articleLive":2,"columnArticles":1452,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":272075,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7155330162962803,"acs":265115,"articleLive":2,"columnArticles":1673,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":370514,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600687961892467,"acs":264414,"articleLive":2,"columnArticles":1862,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":734343,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44376649486750963,"acs":196226,"articleLive":2,"columnArticles":1318,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":442183,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49304752064178464,"acs":262924,"articleLive":2,"columnArticles":1635,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":533263,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4522340560282041,"acs":171375,"articleLive":2,"columnArticles":1145,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":378952,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5266131923682081,"acs":177723,"articleLive":2,"columnArticles":1714,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":337483,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5692584621686002,"acs":158440,"articleLive":2,"columnArticles":1316,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":278327,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3119878025538403,"acs":83487,"articleLive":2,"columnArticles":491,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":267597,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.747249584119923,"acs":199893,"articleLive":2,"columnArticles":1255,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":267505,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33985381457705577,"acs":124517,"articleLive":2,"columnArticles":760,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":366384,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773116173590352,"acs":150814,"articleLive":2,"columnArticles":1132,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":194020,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5966956193353474,"acs":189606,"articleLive":2,"columnArticles":1461,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":317760,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37673242514177585,"acs":66896,"articleLive":2,"columnArticles":447,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":177569,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24195208919244676,"acs":77084,"articleLive":2,"columnArticles":859,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":318592,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6431698701744994,"acs":194647,"articleLive":2,"columnArticles":1636,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":302637,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7980683447870581,"acs":262104,"articleLive":2,"columnArticles":2450,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":328423,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7427534674370677,"acs":293733,"articleLive":2,"columnArticles":1831,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":395465,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7284676392832664,"acs":185996,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":255325,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4655470864454922,"acs":146037,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":313689,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7919649108356328,"acs":192297,"articleLive":2,"columnArticles":1410,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":242810,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801477302939578,"acs":150564,"articleLive":2,"columnArticles":1090,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":259527,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44008109869421447,"acs":145864,"articleLive":2,"columnArticles":1484,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":331448,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5685553425970292,"acs":142389,"articleLive":2,"columnArticles":943,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":250440,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6157396083035729,"acs":113277,"articleLive":2,"columnArticles":950,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":183969,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6445306105267097,"acs":137800,"articleLive":2,"columnArticles":960,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":213799,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6866141653691061,"acs":137581,"articleLive":2,"columnArticles":1098,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":200376,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5888663224606651,"acs":120326,"articleLive":2,"columnArticles":1141,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":204335,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5513941513650054,"acs":113510,"articleLive":2,"columnArticles":953,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":205860,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5768596961495932,"acs":134072,"articleLive":2,"columnArticles":872,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":232417,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7200626546937213,"acs":120442,"articleLive":2,"columnArticles":830,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":167266,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6546646684151367,"acs":104838,"articleLive":2,"columnArticles":907,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":160140,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5613074089886178,"acs":77571,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138197,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792923679861954,"acs":158455,"articleLive":2,"columnArticles":1117,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":273532,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6911904294317884,"acs":168938,"articleLive":2,"columnArticles":1027,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":244416,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.570378976080378,"acs":248424,"articleLive":2,"columnArticles":1814,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":435542,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5814972321003042,"acs":63446,"articleLive":2,"columnArticles":461,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":109108,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054416219361646,"acs":222656,"articleLive":2,"columnArticles":1527,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":367758,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48607186112232537,"acs":49364,"articleLive":2,"columnArticles":512,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":101557,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41522375388190086,"acs":55755,"articleLive":2,"columnArticles":465,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":134277,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5611424346057862,"acs":109278,"articleLive":2,"columnArticles":809,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":194742,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5359024886091074,"acs":120204,"articleLive":2,"columnArticles":1443,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":224302,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889875368727306,"acs":119354,"articleLive":2,"columnArticles":998,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":173231,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46463665955225114,"acs":151735,"articleLive":2,"columnArticles":1039,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":326567,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514690683596633,"acs":88248,"articleLive":2,"columnArticles":519,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":135460,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.614739872835606,"acs":153728,"articleLive":2,"columnArticles":1058,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":250070,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4829987245500496,"acs":102246,"articleLive":2,"columnArticles":849,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":211690,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6499366840199353,"acs":175531,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":270074,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5379610463326678,"acs":190499,"articleLive":2,"columnArticles":1590,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":354113,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4471917028609635,"acs":168547,"articleLive":2,"columnArticles":1474,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":376901,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7568180339902806,"acs":162896,"articleLive":2,"columnArticles":1144,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":215238,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7899075593261035,"acs":177651,"articleLive":2,"columnArticles":1270,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":224901,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5882277347749167,"acs":137320,"articleLive":2,"columnArticles":941,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":233447,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.698548409543345,"acs":115447,"articleLive":2,"columnArticles":1032,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":165267,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8001945267253194,"acs":90498,"articleLive":2,"columnArticles":699,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":113095,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6660478241497104,"acs":134535,"articleLive":2,"columnArticles":845,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":201990,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7073545209477674,"acs":139595,"articleLive":2,"columnArticles":1860,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":197348,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4419090732980556,"acs":130026,"articleLive":2,"columnArticles":978,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":294237,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8577680434049393,"acs":205999,"articleLive":2,"columnArticles":1791,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":240157,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44433722256338276,"acs":131690,"articleLive":2,"columnArticles":1191,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":296374,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4752201952272214,"acs":94690,"articleLive":2,"columnArticles":1067,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":199255,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5615927427998182,"acs":65498,"articleLive":2,"columnArticles":591,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":116629,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45970856312465835,"acs":103445,"articleLive":2,"columnArticles":982,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":225023,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6553690776771127,"acs":110315,"articleLive":2,"columnArticles":767,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":168325,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6340147574694569,"acs":131035,"articleLive":2,"columnArticles":955,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":206675,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568360017630882,"acs":138020,"articleLive":2,"columnArticles":1299,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":161081,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5841597886014419,"acs":71625,"articleLive":2,"columnArticles":496,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":122612,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5977329459426279,"acs":73034,"articleLive":2,"columnArticles":528,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":122185,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2866494221703033,"acs":68707,"articleLive":2,"columnArticles":557,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":239690,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6941083269761165,"acs":118283,"articleLive":2,"columnArticles":691,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":170410,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7005825566904579,"acs":117494,"articleLive":2,"columnArticles":690,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":167709,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20226446401991166,"acs":8289,"articleLive":2,"columnArticles":109,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":40981,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5745369673241981,"acs":7631,"articleLive":2,"columnArticles":124,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":13282,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7829152320052467,"acs":9550,"articleLive":2,"columnArticles":144,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":12198,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6872246696035242,"acs":7800,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":11350,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7133208255159474,"acs":5703,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":7995,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6654422426292895,"acs":6884,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":10345,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4552907823155314,"acs":5942,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":13051,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5066222336153123,"acs":5929,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":11703,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5501655062207511,"acs":4820,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":8761,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4358575521899304,"acs":5324,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12215,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5660126862369081,"acs":3837,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6779,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6618705035971223,"acs":4692,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":7089,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6544102873216797,"acs":3257,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":4977,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5057642750576428,"acs":3729,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7373,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6408224459198972,"acs":2992,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4669,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4974098856032808,"acs":4609,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9266,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5183064021272243,"acs":2534,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4889,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5314659876318661,"acs":4383,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8247,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4742228476397595,"acs":3707,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":7817,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7049085659287777,"acs":3662,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5195,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5360784313725491,"acs":5468,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10200,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5225012228925485,"acs":6409,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":12266,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7032258064516129,"acs":4578,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6510,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7702581225118788,"acs":11996,"articleLive":2,"columnArticles":123,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":15574,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6055764411027569,"acs":3866,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6384,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6497175141242938,"acs":4255,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6549,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6093027644117369,"acs":6458,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":10599,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6251526251526252,"acs":2048,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3276,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2955299111287969,"acs":2228,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":7539,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5465243568691844,"acs":1997,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3654,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.56146705908988,"acs":2480,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4417,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6028790786948176,"acs":3141,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5210,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7965717981888745,"acs":2463,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3092,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5762841809353437,"acs":2255,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":3913,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6856465005931198,"acs":2312,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3372,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5840297121634169,"acs":2516,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4308,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4407726692209451,"acs":2761,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6264,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7795257102606246,"acs":3320,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4259,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5187515122187273,"acs":2144,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4133,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5705950991831972,"acs":1467,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2571,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7864128998149617,"acs":2975,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3783,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8474633980251958,"acs":2489,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2937,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6536523929471033,"acs":1557,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2382,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.646174556876823,"acs":2880,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4457,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8075896827749778,"acs":2724,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3373,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7253052164261932,"acs":2614,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3604,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6858407079646017,"acs":2480,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3616,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6765830854228644,"acs":1592,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2353,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7528913963328632,"acs":2669,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3545,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6164428431051425,"acs":1882,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":3053,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41416474210931487,"acs":1614,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3897,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.741001564945227,"acs":2841,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3834,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6348477525374577,"acs":2627,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4138,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8509316770186336,"acs":2192,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2576,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8914572864321608,"acs":1774,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1990,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7339815507354774,"acs":2944,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":4011,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.351681047307349,"acs":1182,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3361,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5970149253731343,"acs":1160,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1943,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6247928405701028,"acs":1885,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":3017,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6700691471847218,"acs":2035,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":3037,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.53828125,"acs":1378,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2560,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7641148325358852,"acs":1597,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2090,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7219653179190751,"acs":1249,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1730,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6356350184956844,"acs":1031,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1622,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6260477111540941,"acs":971,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1551,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6444866920152091,"acs":1017,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1578,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6579330422125182,"acs":904,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1374,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5089131684876366,"acs":2655,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5217,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7285714285714285,"acs":2652,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3640,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6704161979752531,"acs":2384,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3556,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5023183925811437,"acs":975,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1941,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.421234631147541,"acs":3289,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":7808,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5431923213650907,"acs":1528,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2813,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5490972050457581,"acs":2220,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4043,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.708880550343965,"acs":2267,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3198,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6726799934991061,"acs":4139,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6153,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5846710733396285,"acs":3715,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6354,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6331296377127892,"acs":2901,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4582,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8524124881740776,"acs":2703,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3171,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8071428571428572,"acs":2034,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2520,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7816257816257817,"acs":3250,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4158,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6407154129405576,"acs":2436,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3802,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8563218390804598,"acs":2980,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3480,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6773643851178642,"acs":2385,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3521,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8566070398153491,"acs":2969,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3466,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7652979066022544,"acs":1901,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2484,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6387349201173785,"acs":1959,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3067,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7404823599760814,"acs":3715,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":5017,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6221185510428101,"acs":2267,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3644,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5209284627092846,"acs":1369,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2628,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.76620660811376,"acs":1832,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2391,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6776315789473685,"acs":1442,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2128,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5753234750462107,"acs":1245,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2164,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5919540229885057,"acs":1030,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1740,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.663440333251654,"acs":5415,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8162,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49764150943396224,"acs":1055,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2120,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5416149068322982,"acs":872,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1610,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7790356394129979,"acs":1858,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2385,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6933663638865951,"acs":2519,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3633,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7336448598130841,"acs":1570,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2140,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48289250181994664,"acs":1990,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4121,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5946321147616844,"acs":1285,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2161,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4954128440366973,"acs":2484,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":5014,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5823817292006526,"acs":1071,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1839,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6996172033325827,"acs":3107,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4441,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5514075887392901,"acs":901,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1634,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.539044289044289,"acs":925,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1716,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5645491803278688,"acs":551,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":976,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6097414311485267,"acs":1014,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1663,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8383668903803132,"acs":1499,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1788,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6932270916334662,"acs":522,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":753,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5580767152890329,"acs":1033,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1851,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.58984375,"acs":1057,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1792,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4215091066782307,"acs":486,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1153,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.28880345987506006,"acs":601,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2081,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6377840909090909,"acs":3592,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5632,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6295503211991434,"acs":588,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":934,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6952636282394995,"acs":778,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1119,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4596438675320353,"acs":2762,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":6009,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7197880824516835,"acs":89533,"articleLive":2,"columnArticles":1537,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":124388,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6478286332101991,"acs":57522,"articleLive":2,"columnArticles":1106,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":88792,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.579220199740154,"acs":44136,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76199,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510466548091394,"acs":40276,"articleLive":2,"columnArticles":775,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":73090,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3321773313849384,"acs":32279,"articleLive":2,"columnArticles":556,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":97174,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4719093145007714,"acs":73103,"articleLive":2,"columnArticles":1174,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":154909,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7538603471141094,"acs":65371,"articleLive":2,"columnArticles":959,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":86715,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6213793497841191,"acs":43463,"articleLive":2,"columnArticles":488,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":69946,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5500478404646401,"acs":32768,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":59573,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6827439642710738,"acs":63289,"articleLive":2,"columnArticles":691,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":92698,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800040793309897,"acs":65011,"articleLive":2,"columnArticles":945,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83347,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8547793238655382,"acs":71504,"articleLive":2,"columnArticles":681,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83652,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.655287001220177,"acs":25241,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38519,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4668205863324411,"acs":36799,"articleLive":2,"columnArticles":522,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78829,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4834435448983376,"acs":39113,"articleLive":2,"columnArticles":506,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":80905,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6847165195496359,"acs":47861,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":69899,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5319797549488988,"acs":27223,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51173,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5378204813961469,"acs":10971,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20399,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6136574239076199,"acs":25827,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42087,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3867642943755247,"acs":8293,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21442,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7125485043844908,"acs":23321,"articleLive":2,"columnArticles":342,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32729,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5432265824688017,"acs":14452,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26604,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5879720585025103,"acs":10774,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18324,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5318679325149664,"acs":17591,"articleLive":2,"columnArticles":244,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33074,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.790256175663312,"acs":34550,"articleLive":2,"columnArticles":421,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43720,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8062649305205074,"acs":23963,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29721,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5844411009823878,"acs":33018,"articleLive":2,"columnArticles":384,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56495,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35169895863585443,"acs":25431,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72309,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5905572071939481,"acs":20063,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33973,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7167909000818647,"acs":16636,"articleLive":2,"columnArticles":176,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23209,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47650429799426935,"acs":6652,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13960,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7169052668787558,"acs":16225,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22632,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48633396038508353,"acs":17580,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36148,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.505143591941706,"acs":9428,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18664,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6902901284469595,"acs":7685,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11133,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3868998750669284,"acs":10839,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":28015,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38636696441645924,"acs":5277,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13658,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5273882459723168,"acs":11621,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22035,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7038985148514851,"acs":11375,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16160,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5534679818381086,"acs":3535,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6387,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36323652017082675,"acs":42697,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117546,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36099487239936345,"acs":12250,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33934,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6757987896141081,"acs":51925,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76835,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8201294879340789,"acs":20901,"articleLive":2,"columnArticles":329,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25485,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6790340285400659,"acs":21651,"articleLive":2,"columnArticles":479,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31885,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6567722075637643,"acs":23896,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36384,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8130579512785595,"acs":21494,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26436,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185769717051053,"acs":16482,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22937,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8134322792362768,"acs":21813,"articleLive":2,"columnArticles":347,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26816,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5589821093047953,"acs":13685,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24482,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4946833236490413,"acs":34054,"articleLive":2,"columnArticles":326,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68840,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7606382978723404,"acs":16731,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21996,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5015039248771184,"acs":6836,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13631,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5339569451563301,"acs":4167,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7804,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5548370028513477,"acs":56625,"articleLive":2,"columnArticles":2373,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102057,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396889069067788,"acs":34667,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46867,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3951248691490953,"acs":13211,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33435,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.553249793052265,"acs":19382,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35033,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4550040284443199,"acs":12989,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28547,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6236501079913607,"acs":4620,"articleLive":2,"columnArticles":84,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7408,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6670418145615098,"acs":7705,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11551,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8317989712675687,"acs":25389,"articleLive":2,"columnArticles":402,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30523,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7659904781618713,"acs":14802,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19324,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4423946130430772,"acs":9592,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21682,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4603235500991112,"acs":7199,"articleLive":2,"columnArticles":157,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15639,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4641875644108554,"acs":10810,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23288,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42412013760254036,"acs":12822,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30232,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7328997533079166,"acs":19608,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26754,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3729254799869834,"acs":2292,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6146,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5486075949367089,"acs":2167,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3950,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6815039178244551,"acs":10350,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15187,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409352322761929,"acs":50372,"articleLive":2,"columnArticles":581,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114239,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43044332823760645,"acs":1971,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4579,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5489596083231334,"acs":3588,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6536,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5032815392382342,"acs":8972,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17827,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4533442434160681,"acs":14959,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32997,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6005068740452715,"acs":34594,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57608,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3439786188308306,"acs":15187,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44151,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6117611761176117,"acs":20390,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33330,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7216015656853951,"acs":8849,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12263,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4648730174175343,"acs":9555,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20554,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5835470085470086,"acs":2731,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4680,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4716191472665446,"acs":10818,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22938,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5455321036736226,"acs":31972,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58607,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3880735649266208,"acs":14623,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37681,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5969052600846674,"acs":12267,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20551,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6436454580914577,"acs":28052,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":43583,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3876670673926879,"acs":5482,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14141,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45002888503755056,"acs":4674,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10386,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4122004151726741,"acs":8737,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21196,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27161945832924955,"acs":8314,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30609,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5488842072409488,"acs":14069,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25632,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.570589841616603,"acs":66864,"articleLive":2,"columnArticles":928,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117184,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6869738907119418,"acs":14445,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21027,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6318420016357192,"acs":20859,"articleLive":2,"columnArticles":291,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33013,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5527196746725381,"acs":24601,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44509,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5971210759552512,"acs":77074,"articleLive":2,"columnArticles":760,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":129076,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40267765190525234,"acs":5865,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14565,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184836055132354,"acs":61053,"articleLive":2,"columnArticles":1138,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117753,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4449230769230769,"acs":7953,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17875,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4455316777110299,"acs":7194,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16147,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5789649862756913,"acs":8648,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14937,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5708873670406528,"acs":3918,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6863,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359560540300517,"acs":44398,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69813,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37513788714467544,"acs":8842,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23570,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3786423979293646,"acs":4535,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11977,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5243326587645755,"acs":10882,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20754,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5038486209108403,"acs":1571,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3118,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3414827279026032,"acs":3450,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10103,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.6939773404889684,"acs":87285,"articleLive":2,"columnArticles":489,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":125775,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.5208849730247812,"acs":2567329,"articleLive":2,"columnArticles":14420,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4928783,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40922688735243523,"acs":1022410,"articleLive":2,"columnArticles":7260,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2498394,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3810587222963142,"acs":1269190,"articleLive":2,"columnArticles":7575,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3330694,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4088833806046943,"acs":524893,"articleLive":2,"columnArticles":3905,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1283723,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3554677510222455,"acs":753362,"articleLive":2,"columnArticles":4075,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2119354,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5074247592657647,"acs":309112,"articleLive":2,"columnArticles":2507,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":609178,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3524498159701376,"acs":850626,"articleLive":2,"columnArticles":5351,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2413467,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.2172215571511798,"acs":353469,"articleLive":2,"columnArticles":2718,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1627228,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5836570950347936,"acs":783890,"articleLive":2,"columnArticles":4987,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1343066,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31606802078699703,"acs":208188,"articleLive":2,"columnArticles":1253,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":658681,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6272421073914013,"acs":546013,"articleLive":2,"columnArticles":3100,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":870498,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6648123434514047,"acs":230648,"articleLive":2,"columnArticles":1801,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":346937,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6318836227971344,"acs":475591,"articleLive":2,"columnArticles":3937,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":752656,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4101362581505,"acs":635169,"articleLive":2,"columnArticles":3964,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1548678,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33675875774305003,"acs":671730,"articleLive":2,"columnArticles":3170,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1994692,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4591124025567852,"acs":264968,"articleLive":2,"columnArticles":1454,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":577131,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5731875277275646,"acs":346258,"articleLive":2,"columnArticles":3119,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":604092,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3985975066785396,"acs":225603,"articleLive":2,"columnArticles":1550,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":565992,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42971676542417075,"acs":529980,"articleLive":2,"columnArticles":3958,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1233324,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.445039399250011,"acs":797641,"articleLive":2,"columnArticles":5648,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1792293,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6674895944037252,"acs":729193,"articleLive":2,"columnArticles":3533,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1092441,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7727705408118113,"acs":358013,"articleLive":2,"columnArticles":2691,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":463285,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5599619465936635,"acs":331974,"articleLive":2,"columnArticles":2142,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":592851,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7032608837941974,"acs":322334,"articleLive":2,"columnArticles":2553,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":458342,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.65773591986132,"acs":234865,"articleLive":2,"columnArticles":2231,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":357081,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5388905878908157,"acs":828194,"articleLive":2,"columnArticles":4608,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1536850,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5970896613231883,"acs":491403,"articleLive":2,"columnArticles":4154,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":822997,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40564030008679214,"acs":477652,"articleLive":2,"columnArticles":3277,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1177526,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.21921817235714844,"acs":128913,"articleLive":2,"columnArticles":1036,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":588058,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3589995790966084,"acs":81028,"articleLive":2,"columnArticles":603,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":225705,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37311675361845353,"acs":219274,"articleLive":2,"columnArticles":1771,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":587682,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3567935056486563,"acs":194704,"articleLive":2,"columnArticles":1313,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":545705,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4278073335127675,"acs":373525,"articleLive":2,"columnArticles":2463,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":873115,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4234485422362235,"acs":350825,"articleLive":2,"columnArticles":3363,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":828495,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4629669296691197,"acs":523048,"articleLive":2,"columnArticles":4016,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1129774,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6401118423085241,"acs":207185,"articleLive":2,"columnArticles":1467,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":323670,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707772453682548,"acs":102751,"articleLive":2,"columnArticles":870,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":153182,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5805322817812215,"acs":218326,"articleLive":2,"columnArticles":2293,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":376079,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277510497594478,"acs":342468,"articleLive":2,"columnArticles":1997,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":470584,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6221427744855015,"acs":204298,"articleLive":2,"columnArticles":1421,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":328378,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4197423154610723,"acs":167907,"articleLive":2,"columnArticles":1435,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":400024,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5821127039518771,"acs":332118,"articleLive":2,"columnArticles":2474,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":570539,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44904605827017874,"acs":172898,"articleLive":2,"columnArticles":1168,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":385034,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32838565762749605,"acs":85531,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":260459,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4304895006351634,"acs":207734,"articleLive":2,"columnArticles":1662,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":482553,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7831532541664543,"acs":430255,"articleLive":2,"columnArticles":2751,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":549388,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6381002972458316,"acs":219823,"articleLive":2,"columnArticles":1512,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":344496,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7353621392636226,"acs":226707,"articleLive":2,"columnArticles":1910,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":308293,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6654076921569341,"acs":237663,"articleLive":2,"columnArticles":1344,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":357169,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37641195446244174,"acs":220536,"articleLive":2,"columnArticles":1306,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":585890,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7388377004005644,"acs":156044,"articleLive":2,"columnArticles":1563,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":211202,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8226113144502698,"acs":74842,"articleLive":2,"columnArticles":617,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90981,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5528096422252724,"acs":699590,"articleLive":2,"columnArticles":3853,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1265517,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4814974214744512,"acs":192429,"articleLive":2,"columnArticles":2029,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":399647,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4327305841030311,"acs":332640,"articleLive":2,"columnArticles":2548,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":768700,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4698489317139595,"acs":307783,"articleLive":2,"columnArticles":2359,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":655068,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41146327933281307,"acs":87524,"articleLive":2,"columnArticles":938,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":212714,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37678691664297576,"acs":251818,"articleLive":2,"columnArticles":2707,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":668330,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7898145834983579,"acs":129622,"articleLive":2,"columnArticles":1600,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":164117,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.524421312306912,"acs":90985,"articleLive":2,"columnArticles":965,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173496,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.417667037535867,"acs":199710,"articleLive":2,"columnArticles":2030,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":478156,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6623713904341842,"acs":319573,"articleLive":2,"columnArticles":2463,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":482468,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3920406650428889,"acs":185102,"articleLive":2,"columnArticles":1745,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":472150,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883401125816972,"acs":273302,"articleLive":2,"columnArticles":2113,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":397045,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2695078170237406,"acs":46544,"articleLive":2,"columnArticles":644,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":172700,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45724387711036624,"acs":355765,"articleLive":2,"columnArticles":3210,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":778064,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5428160864167284,"acs":197185,"articleLive":2,"columnArticles":1803,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":363263,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5242595223971195,"acs":38002,"articleLive":2,"columnArticles":577,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72487,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3919551084732458,"acs":393461,"articleLive":2,"columnArticles":1976,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1003842,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5302911528072475,"acs":585819,"articleLive":2,"columnArticles":3647,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1104712,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4216037756752565,"acs":95137,"articleLive":2,"columnArticles":836,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":225655,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142463184978376,"acs":179527,"articleLive":2,"columnArticles":1252,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":292272,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6045293283405139,"acs":135125,"articleLive":2,"columnArticles":992,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":223521,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46141647066387353,"acs":172244,"articleLive":2,"columnArticles":1725,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":373294,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5964949687245037,"acs":274164,"articleLive":2,"columnArticles":1892,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":459625,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42722556659626143,"acs":188920,"articleLive":2,"columnArticles":1289,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":442202,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.770078136759856,"acs":225100,"articleLive":2,"columnArticles":1325,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":292308,"title":"组合","titleSlug":"combinations"},{"acceptance":0.801535377982831,"acs":317925,"articleLive":2,"columnArticles":2081,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":396645,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4586909245852611,"acs":228218,"articleLive":2,"columnArticles":1439,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":497542,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6168657029985212,"acs":149746,"articleLive":2,"columnArticles":1339,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":242753,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4148414115379665,"acs":125704,"articleLive":2,"columnArticles":1002,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":303017,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5308733447631191,"acs":184857,"articleLive":2,"columnArticles":1707,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":348213,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385712470405692,"acs":322113,"articleLive":2,"columnArticles":1970,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":598088,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43346464594603423,"acs":185737,"articleLive":2,"columnArticles":1175,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":428494,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5160144202717346,"acs":99050,"articleLive":2,"columnArticles":700,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":191952,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6326634005703482,"acs":121131,"articleLive":2,"columnArticles":1116,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":191462,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4870066590872178,"acs":41979,"articleLive":2,"columnArticles":313,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86198,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.517422870880545,"acs":474142,"articleLive":2,"columnArticles":3318,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":916353,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7100889889567921,"acs":59607,"articleLive":2,"columnArticles":486,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":83943,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.633736331677114,"acs":140429,"articleLive":2,"columnArticles":1238,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":221589,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30960961017002925,"acs":165904,"articleLive":2,"columnArticles":1536,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":535849,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5489887491659918,"acs":215578,"articleLive":2,"columnArticles":2054,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":392682,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5408660670391835,"acs":156227,"articleLive":2,"columnArticles":1352,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":288846,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.755761836626971,"acs":574150,"articleLive":2,"columnArticles":2351,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":759697,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.702597375676292,"acs":101682,"articleLive":2,"columnArticles":635,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":144723,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6996781256195976,"acs":165858,"articleLive":2,"columnArticles":1312,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":237049,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45589684805385394,"acs":62441,"articleLive":2,"columnArticles":550,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":136963,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3503939422112591,"acs":354270,"articleLive":2,"columnArticles":1965,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1011062,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6115554655597178,"acs":72484,"articleLive":2,"columnArticles":597,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":118524,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6019907818351837,"acs":253644,"articleLive":2,"columnArticles":1906,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":421342,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5640520920907974,"acs":418653,"articleLive":2,"columnArticles":2297,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":742224,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421121458543615,"acs":404600,"articleLive":2,"columnArticles":2543,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":630108,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.571767462482726,"acs":176671,"articleLive":2,"columnArticles":1607,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":308991,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661777887133342,"acs":523137,"articleLive":2,"columnArticles":2591,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":682788,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7047925548218117,"acs":252943,"articleLive":2,"columnArticles":1452,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":358890,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7218085617059408,"acs":135329,"articleLive":2,"columnArticles":897,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":187486,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.697498774323342,"acs":165031,"articleLive":2,"columnArticles":1322,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":236604,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7604271302770796,"acs":194553,"articleLive":2,"columnArticles":1203,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":255847,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7630692211418119,"acs":95112,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124644,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5636371114204138,"acs":260384,"articleLive":2,"columnArticles":1489,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":461971,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48662955301227784,"acs":275699,"articleLive":2,"columnArticles":1815,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":566548,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.526372606834077,"acs":274028,"articleLive":2,"columnArticles":1720,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":520597,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6276980893122626,"acs":182394,"articleLive":2,"columnArticles":1282,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":290576,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7260582287027957,"acs":180652,"articleLive":2,"columnArticles":1356,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":248812,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5219965593840296,"acs":62507,"articleLive":2,"columnArticles":686,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":119746,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7046984541693881,"acs":161834,"articleLive":2,"columnArticles":1235,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":229650,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6149027033560291,"acs":91575,"articleLive":2,"columnArticles":780,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":148926,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7312407651451619,"acs":219732,"articleLive":2,"columnArticles":1774,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":300492,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6677442969712677,"acs":146855,"articleLive":2,"columnArticles":1222,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":219927,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6815513548047653,"acs":181354,"articleLive":2,"columnArticles":1597,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":266090,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5734923258512343,"acs":572846,"articleLive":2,"columnArticles":3436,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":998873,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6896786088610828,"acs":469827,"articleLive":2,"columnArticles":2681,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":681226,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5369375757990886,"acs":133262,"articleLive":2,"columnArticles":827,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":248189,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.444934427171869,"acs":162543,"articleLive":2,"columnArticles":1106,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":365319,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4728465646879296,"acs":281356,"articleLive":2,"columnArticles":1855,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":595026,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3962632606745131,"acs":37540,"articleLive":2,"columnArticles":332,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94735,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4685661882157502,"acs":124670,"articleLive":2,"columnArticles":660,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":266067,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5432627963349462,"acs":174138,"articleLive":2,"columnArticles":1138,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":320541,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.682723335952783,"acs":122499,"articleLive":2,"columnArticles":1130,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":179427,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44532052546719914,"acs":130918,"articleLive":2,"columnArticles":1189,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":293986,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7229598385232762,"acs":135748,"articleLive":2,"columnArticles":885,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":187767,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4923709672646934,"acs":49921,"articleLive":2,"columnArticles":443,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101389,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6761383465275609,"acs":73622,"articleLive":2,"columnArticles":529,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":108886,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.576313802100998,"acs":127442,"articleLive":2,"columnArticles":985,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":221133,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48601632672718953,"acs":100914,"articleLive":2,"columnArticles":808,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":207635,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7191546276895061,"acs":508648,"articleLive":2,"columnArticles":2303,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":707286,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197970120399722,"acs":101274,"articleLive":2,"columnArticles":761,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":140698,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6616275890951182,"acs":113749,"articleLive":2,"columnArticles":863,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":171923,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5159228684659848,"acs":197616,"articleLive":2,"columnArticles":1227,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":383034,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4906222388209253,"acs":53861,"articleLive":2,"columnArticles":549,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109781,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5125037197888966,"acs":539055,"articleLive":2,"columnArticles":2778,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1051807,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.552908447511954,"acs":302494,"articleLive":2,"columnArticles":1768,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":547096,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6214285714285714,"acs":129456,"articleLive":2,"columnArticles":1093,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":208320,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7038500909918107,"acs":420801,"articleLive":2,"columnArticles":1870,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":597856,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.750649675101217,"acs":306476,"articleLive":2,"columnArticles":1577,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":408281,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5260632530985098,"acs":238243,"articleLive":2,"columnArticles":1402,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":452879,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6817119623946402,"acs":100937,"articleLive":2,"columnArticles":792,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":148064,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6670972936033177,"acs":213780,"articleLive":2,"columnArticles":1264,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":320463,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.34183577670253484,"acs":47334,"articleLive":2,"columnArticles":517,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138470,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5355050414653064,"acs":134634,"articleLive":2,"columnArticles":1061,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":251415,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4841332291660812,"acs":172273,"articleLive":2,"columnArticles":1442,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":355838,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4214815899440208,"acs":187102,"articleLive":2,"columnArticles":1256,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":443915,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.566956765490669,"acs":214393,"articleLive":2,"columnArticles":1518,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":378147,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5316387412398796,"acs":114322,"articleLive":2,"columnArticles":902,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":215037,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5735494490781214,"acs":291292,"articleLive":2,"columnArticles":1618,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":507876,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7246503496503497,"acs":6632,"articleLive":2,"columnArticles":115,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9152,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5332886291790402,"acs":5567,"articleLive":2,"columnArticles":83,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10439,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5919899874843555,"acs":2838,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4794,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5470881069285325,"acs":16045,"articleLive":2,"columnArticles":194,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29328,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6146038154112335,"acs":341016,"articleLive":2,"columnArticles":1997,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":554855,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3364158303019678,"acs":7676,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22817,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4971143756558237,"acs":162970,"articleLive":2,"columnArticles":1105,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":327832,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32652204338698393,"acs":9332,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28580,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6099073428723709,"acs":59505,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97564,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192387108358021,"acs":86757,"articleLive":2,"columnArticles":928,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":167085,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3310452467788944,"acs":41572,"articleLive":2,"columnArticles":377,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":125578,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5867669297129564,"acs":298388,"articleLive":2,"columnArticles":1958,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":508529,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43245730439336394,"acs":85057,"articleLive":2,"columnArticles":760,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":196683,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.664743251114091,"acs":392608,"articleLive":2,"columnArticles":2221,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":590616,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4188136896750625,"acs":8713,"articleLive":2,"columnArticles":88,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20804,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7181402215985422,"acs":107981,"articleLive":2,"columnArticles":921,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":150362,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.44023174127016834,"acs":91868,"articleLive":2,"columnArticles":598,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":208681,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.804683359128204,"acs":75909,"articleLive":2,"columnArticles":635,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94334,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4806755440077947,"acs":38480,"articleLive":2,"columnArticles":410,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":80054,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.739528952967337,"acs":307965,"articleLive":2,"columnArticles":1476,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":416434,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35587784149989043,"acs":254979,"articleLive":2,"columnArticles":1023,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":716479,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4629753097424013,"acs":129853,"articleLive":2,"columnArticles":502,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":280475,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6035315326112468,"acs":120859,"articleLive":2,"columnArticles":677,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":200253,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40958405354712957,"acs":122507,"articleLive":2,"columnArticles":972,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":299101,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4869059753712223,"acs":88371,"articleLive":2,"columnArticles":515,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":181495,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.701838146517943,"acs":165671,"articleLive":2,"columnArticles":681,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":236053,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967035597550519,"acs":183053,"articleLive":2,"columnArticles":593,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":229763,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6767625066761617,"acs":152055,"articleLive":2,"columnArticles":548,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":224680,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47719530832826973,"acs":103664,"articleLive":2,"columnArticles":679,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":217236,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49671699681396314,"acs":71716,"articleLive":2,"columnArticles":634,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":144380,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7563736588246874,"acs":7684,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10159,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5210617873467289,"acs":73984,"articleLive":2,"columnArticles":543,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":141987,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3927374928765089,"acs":90969,"articleLive":2,"columnArticles":703,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":231628,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.450254901809404,"acs":349921,"articleLive":2,"columnArticles":1741,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":777162,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6987334879605439,"acs":133456,"articleLive":2,"columnArticles":838,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":190997,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7493437350517429,"acs":192684,"articleLive":2,"columnArticles":1215,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":257137,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3562641552474215,"acs":21865,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61373,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3250972232543162,"acs":26249,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80742,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34510561737855666,"acs":10358,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30014,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43635233766708503,"acs":35811,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":82069,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653444460262201,"acs":102821,"articleLive":2,"columnArticles":395,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":154538,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5338137224186547,"acs":95416,"articleLive":2,"columnArticles":510,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":178744,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.515944261332115,"acs":395252,"articleLive":2,"columnArticles":2721,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":766075,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6525133481217367,"acs":143842,"articleLive":2,"columnArticles":1607,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":220443,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5576152271307214,"acs":335555,"articleLive":2,"columnArticles":2146,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":601768,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5245030341075538,"acs":50132,"articleLive":2,"columnArticles":327,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95580,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6194225438700562,"acs":172293,"articleLive":2,"columnArticles":1407,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":278151,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5166037046063856,"acs":237398,"articleLive":2,"columnArticles":1683,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":459536,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37787343244617205,"acs":170218,"articleLive":2,"columnArticles":738,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":450463,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5007274089432099,"acs":114958,"articleLive":2,"columnArticles":885,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":229582,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7233684808208278,"acs":723626,"articleLive":2,"columnArticles":7411,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1000356,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5430723730254889,"acs":144328,"articleLive":2,"columnArticles":950,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":265762,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167044714112846,"acs":146293,"articleLive":2,"columnArticles":990,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":204119,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47315052128325397,"acs":198824,"articleLive":2,"columnArticles":1412,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":420213,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5427350172229551,"acs":90913,"articleLive":2,"columnArticles":681,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":167509,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4825037928840601,"acs":29577,"articleLive":2,"columnArticles":328,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61299,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.462736282975756,"acs":62375,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":134796,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4332980155500617,"acs":169306,"articleLive":2,"columnArticles":1555,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":390738,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37169685889978393,"acs":31311,"articleLive":2,"columnArticles":307,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84238,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6462732699771682,"acs":448080,"articleLive":2,"columnArticles":2329,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":693329,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7368535687578501,"acs":101492,"articleLive":2,"columnArticles":1047,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":137737,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5578660270421881,"acs":374920,"articleLive":2,"columnArticles":1747,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":672061,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422130165359992,"acs":31675,"articleLive":2,"columnArticles":281,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58418,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4248682280989606,"acs":112124,"articleLive":2,"columnArticles":902,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":263903,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2865742864199273,"acs":64979,"articleLive":2,"columnArticles":424,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":226744,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4769828083029729,"acs":141527,"articleLive":2,"columnArticles":1007,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":296713,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7819948152263048,"acs":118247,"articleLive":2,"columnArticles":888,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":151212,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.523304334631531,"acs":41385,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":79084,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41781868684227347,"acs":71902,"articleLive":2,"columnArticles":660,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":172089,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6753544948571204,"acs":137359,"articleLive":2,"columnArticles":4762,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":203388,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7880544680937436,"acs":310603,"articleLive":2,"columnArticles":1881,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":394139,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43754825770869893,"acs":87269,"articleLive":2,"columnArticles":704,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":199450,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5798985383494902,"acs":57726,"articleLive":2,"columnArticles":650,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99545,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4645084201486128,"acs":37320,"articleLive":2,"columnArticles":319,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80343,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7420431334058413,"acs":139864,"articleLive":2,"columnArticles":883,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":188485,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5044834134472732,"acs":170021,"articleLive":2,"columnArticles":1226,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":337020,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6909904882796692,"acs":162219,"articleLive":2,"columnArticles":1284,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":234763,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47722518852865087,"acs":34679,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72668,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49716256955683763,"acs":315476,"articleLive":2,"columnArticles":2018,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":634553,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660625807322292,"acs":172740,"articleLive":2,"columnArticles":989,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":259345,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6808824712099475,"acs":262455,"articleLive":2,"columnArticles":1415,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":385463,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481630621118261,"acs":211263,"articleLive":2,"columnArticles":1018,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":249083,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7234893113472076,"acs":140621,"articleLive":2,"columnArticles":887,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":194365,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49695501625003796,"acs":196335,"articleLive":2,"columnArticles":1344,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":395076,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47863495935186245,"acs":171504,"articleLive":2,"columnArticles":776,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":358319,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7381577130230631,"acs":32070,"articleLive":2,"columnArticles":288,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43446,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6457938096671072,"acs":296152,"articleLive":2,"columnArticles":1718,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":458586,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6566034964007639,"acs":8939,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13614,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5517465827728357,"acs":5086,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9218,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6011831063420002,"acs":4370,"articleLive":2,"columnArticles":60,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7269,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47571707953063885,"acs":5838,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12272,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5249774752227451,"acs":5244,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9989,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46444172636728986,"acs":2658,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5723,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.637850212580399,"acs":5851,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9173,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6348180413095406,"acs":4518,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7117,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.544228774633279,"acs":3673,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6749,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5642496876590625,"acs":12194,"articleLive":2,"columnArticles":158,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21611,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5012640665947279,"acs":32517,"articleLive":2,"columnArticles":351,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":64870,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5695552398644956,"acs":5212,"articleLive":2,"columnArticles":77,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9151,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4751131221719457,"acs":5250,"articleLive":2,"columnArticles":61,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11050,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6411911477543936,"acs":11821,"articleLive":2,"columnArticles":187,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18436,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6828857552377754,"acs":144360,"articleLive":2,"columnArticles":1072,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":211397,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.692190602829124,"acs":79125,"articleLive":2,"columnArticles":657,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114311,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5653721426876532,"acs":7148,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12643,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7232050806218813,"acs":52611,"articleLive":2,"columnArticles":449,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72747,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4941439889769204,"acs":8607,"articleLive":2,"columnArticles":118,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17418,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.434334137718166,"acs":38697,"articleLive":2,"columnArticles":376,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":89095,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152869452511821,"acs":107342,"articleLive":2,"columnArticles":839,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":208315,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5800703776628416,"acs":101050,"articleLive":2,"columnArticles":616,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":174203,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5897260858435021,"acs":6911,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11719,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6744394618834081,"acs":6768,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10035,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44741278692776554,"acs":3450,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7711,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.625878189105766,"acs":153496,"articleLive":2,"columnArticles":1112,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":245249,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3384510584783064,"acs":6459,"articleLive":2,"columnArticles":108,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19084,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.554047992823503,"acs":9882,"articleLive":2,"columnArticles":139,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17836,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5538493463374144,"acs":2669,"articleLive":2,"columnArticles":46,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4819,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6475959746552367,"acs":3475,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5366,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.36743176827355434,"acs":28110,"articleLive":2,"columnArticles":345,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":76504,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4399902184545158,"acs":53978,"articleLive":2,"columnArticles":564,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122680,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46210496792696937,"acs":51076,"articleLive":2,"columnArticles":418,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110529,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4922619870111925,"acs":7125,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14474,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5701787751996957,"acs":7495,"articleLive":2,"columnArticles":85,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13145,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4533533365338454,"acs":188867,"articleLive":2,"columnArticles":1074,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":416600,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6322671736000886,"acs":205545,"articleLive":2,"columnArticles":1209,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":325092,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6851986434108527,"acs":5657,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8256,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7588735699618656,"acs":2587,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3409,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3920196375411292,"acs":7506,"articleLive":2,"columnArticles":81,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":19147,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6390888560657608,"acs":500613,"articleLive":2,"columnArticles":3415,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":783323,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.771225974995335,"acs":24798,"articleLive":2,"columnArticles":207,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32154,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6352062868369351,"acs":8083,"articleLive":2,"columnArticles":104,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12725,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5095803919849169,"acs":11622,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22807,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6594177008443557,"acs":180873,"articleLive":2,"columnArticles":1234,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":274292,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43247884214399607,"acs":3526,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8153,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533737476507412,"acs":53314,"articleLive":2,"columnArticles":831,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70767,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45657004619392694,"acs":83419,"articleLive":2,"columnArticles":1110,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":182708,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5316482139126801,"acs":2545,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4787,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.708341021193894,"acs":115172,"articleLive":2,"columnArticles":768,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162594,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7118304210827843,"acs":4970,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6982,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5813027552157987,"acs":3650,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6279,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5232086306462456,"acs":64599,"articleLive":2,"columnArticles":506,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123467,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6206380857427717,"acs":2490,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4012,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5606101291548858,"acs":106475,"articleLive":2,"columnArticles":765,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":189927,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5773351968320521,"acs":4957,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8586,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5046017084978768,"acs":30539,"articleLive":2,"columnArticles":362,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60521,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5168204894155299,"acs":366895,"articleLive":2,"columnArticles":2032,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":709908,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5237938905043305,"acs":33505,"articleLive":2,"columnArticles":235,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":63966,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6559870550161813,"acs":2027,"articleLive":2,"columnArticles":39,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3090,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7265160191056116,"acs":130050,"articleLive":2,"columnArticles":797,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":179005,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5473209385290889,"acs":63822,"articleLive":2,"columnArticles":569,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116608,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3834393778720396,"acs":4339,"articleLive":2,"columnArticles":65,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11316,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3373386473142585,"acs":17013,"articleLive":2,"columnArticles":252,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50433,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5396974579305407,"acs":24118,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44688,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6107671601615074,"acs":2269,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3715,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6087457377200258,"acs":118899,"articleLive":2,"columnArticles":945,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":195318,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3794373859449781,"acs":22040,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":58086,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7612670068027211,"acs":3581,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4704,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.683103253216508,"acs":56757,"articleLive":2,"columnArticles":384,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":83087,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6289716328377901,"acs":40997,"articleLive":2,"columnArticles":356,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65181,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5466603505447655,"acs":4616,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8444,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41800902592482786,"acs":50758,"articleLive":2,"columnArticles":481,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121428,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47634345385573706,"acs":68059,"articleLive":2,"columnArticles":538,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":142878,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48362494392104083,"acs":4312,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8916,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6853591997575023,"acs":20349,"articleLive":2,"columnArticles":181,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29691,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5185525431324222,"acs":23143,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44630,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6775073914032295,"acs":2979,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4397,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42431596478705685,"acs":26751,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":63045,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4449828113969568,"acs":309494,"articleLive":2,"columnArticles":1835,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":695519,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6323978562784532,"acs":10974,"articleLive":2,"columnArticles":152,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17353,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37830264211369097,"acs":25515,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67446,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5374184689323721,"acs":9393,"articleLive":2,"columnArticles":104,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17478,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.504518434398547,"acs":136390,"articleLive":2,"columnArticles":582,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":270337,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4208844080994237,"acs":24756,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58819,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6558278028716344,"acs":129949,"articleLive":2,"columnArticles":1072,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":198145,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48623043023475143,"acs":56711,"articleLive":2,"columnArticles":495,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":116634,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5337927155111799,"acs":18979,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35555,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4799531939790437,"acs":45118,"articleLive":2,"columnArticles":506,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":94005,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44979824886760855,"acs":40019,"articleLive":2,"columnArticles":331,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":88971,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46957632949965594,"acs":4777,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10173,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41191018949629016,"acs":46800,"articleLive":2,"columnArticles":309,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":113617,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36938577324593347,"acs":3043,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8238,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40134371218551895,"acs":22222,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55369,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6078348215314688,"acs":131857,"articleLive":2,"columnArticles":931,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":216929,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869682630373528,"acs":161153,"articleLive":2,"columnArticles":1386,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":204777,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8094107489747464,"acs":3750,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4633,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49466457109769213,"acs":11960,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24178,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.727432748953084,"acs":51244,"articleLive":2,"columnArticles":490,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70445,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5162367884622182,"acs":87625,"articleLive":2,"columnArticles":773,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":169738,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.606316361167685,"acs":111638,"articleLive":2,"columnArticles":1058,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":184125,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7692109600329625,"acs":373375,"articleLive":2,"columnArticles":1970,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":485400,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5393285656349842,"acs":109049,"articleLive":2,"columnArticles":1037,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":202194,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7062713797035348,"acs":12388,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17540,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.622304475725087,"acs":204778,"articleLive":2,"columnArticles":1508,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":329064,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5997076379583384,"acs":4923,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8209,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7389247634779997,"acs":216502,"articleLive":2,"columnArticles":1533,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":292996,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5504928038449148,"acs":252903,"articleLive":2,"columnArticles":1414,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":459412,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5900559762923938,"acs":5376,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9111,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6796898104031808,"acs":20685,"articleLive":2,"columnArticles":344,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":30433,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4272273425499232,"acs":2225,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5208,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45397011389169667,"acs":70512,"articleLive":2,"columnArticles":545,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155323,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4075926971004988,"acs":26723,"articleLive":2,"columnArticles":439,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65563,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35251482538985285,"acs":1605,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4553,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.520606556345561,"acs":24822,"articleLive":2,"columnArticles":388,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47679,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3516518173933612,"acs":4460,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12683,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7271774917689314,"acs":4859,"articleLive":2,"columnArticles":57,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6682,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6021347844286312,"acs":2877,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4778,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5665184678522572,"acs":3313,"articleLive":2,"columnArticles":65,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5848,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6912863070539419,"acs":3332,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4820,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48950146801506567,"acs":33011,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67438,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7219188767550702,"acs":1851,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2564,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36572744193052104,"acs":33994,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92949,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7647478167884513,"acs":4291,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5611,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.43896936261442016,"acs":78216,"articleLive":2,"columnArticles":623,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":178181,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4590706388946717,"acs":41898,"articleLive":2,"columnArticles":455,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91267,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.617775951794029,"acs":4511,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7302,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7227282826038658,"acs":3253,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4501,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127675696154574,"acs":80870,"articleLive":2,"columnArticles":507,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131975,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5105593607305936,"acs":14312,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":28032,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4170574740646,"acs":20543,"articleLive":2,"columnArticles":208,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49257,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5154954410667719,"acs":83618,"articleLive":2,"columnArticles":569,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":162209,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46950381801335506,"acs":14695,"articleLive":2,"columnArticles":124,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31299,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46447898256290654,"acs":76476,"articleLive":2,"columnArticles":819,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":164649,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5092403583950136,"acs":65361,"articleLive":2,"columnArticles":554,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":128350,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6391432921239947,"acs":80185,"articleLive":2,"columnArticles":565,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125457,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6388944522331264,"acs":3190,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4993,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5033765861352069,"acs":35108,"articleLive":2,"columnArticles":220,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":69745,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44125190266686126,"acs":21162,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47959,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6321075523922499,"acs":15986,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25290,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6022969563629259,"acs":70903,"articleLive":2,"columnArticles":779,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":117721,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5794148149782652,"acs":52517,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":90638,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41783957944717653,"acs":7392,"articleLive":2,"columnArticles":85,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17691,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7498085439350048,"acs":22519,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30033,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5342248229955767,"acs":224399,"articleLive":2,"columnArticles":1216,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":420046,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5280733627476425,"acs":6104,"articleLive":2,"columnArticles":111,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11559,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6915764673746031,"acs":101271,"articleLive":2,"columnArticles":993,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":146435,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.466442732002898,"acs":7082,"articleLive":2,"columnArticles":96,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15183,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35777419106909536,"acs":4655,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13011,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152342907251077,"acs":148067,"articleLive":2,"columnArticles":1586,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":287378,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3910181958962447,"acs":11110,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28413,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5528851558249437,"acs":122960,"articleLive":2,"columnArticles":1311,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":222397,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205002849344651,"acs":52062,"articleLive":2,"columnArticles":429,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":100023,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42896480911042656,"acs":9191,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21426,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37712426178136677,"acs":15645,"articleLive":2,"columnArticles":195,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41485,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6578685709120492,"acs":14556,"articleLive":2,"columnArticles":123,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22126,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5919490460094421,"acs":42380,"articleLive":2,"columnArticles":531,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71594,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4168436407319218,"acs":19432,"articleLive":2,"columnArticles":198,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46617,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.613975854307346,"acs":54009,"articleLive":2,"columnArticles":658,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87966,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32720846355368155,"acs":81559,"articleLive":2,"columnArticles":590,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":249257,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45555291696350825,"acs":46040,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":101064,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5842871199958568,"acs":101538,"articleLive":2,"columnArticles":1131,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":173781,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5620320593072636,"acs":45791,"articleLive":2,"columnArticles":463,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81474,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7375869615718496,"acs":120653,"articleLive":2,"columnArticles":799,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":163578,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48301027285827175,"acs":10391,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21513,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32446516730663744,"acs":3549,"articleLive":2,"columnArticles":83,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10938,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5559893553695858,"acs":95271,"articleLive":2,"columnArticles":1333,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":171354,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5649091143483306,"acs":39438,"articleLive":2,"columnArticles":319,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69813,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5027808676307007,"acs":904,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1798,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.688219950115192,"acs":72292,"articleLive":2,"columnArticles":937,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":105042,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39342743277647335,"acs":87466,"articleLive":2,"columnArticles":1136,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":222318,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5384912585723944,"acs":150525,"articleLive":2,"columnArticles":1089,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":279531,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5077817536459864,"acs":176248,"articleLive":2,"columnArticles":996,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":347094,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.481191303896643,"acs":27822,"articleLive":2,"columnArticles":329,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":57819,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36095947063689,"acs":2182,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6045,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7553106825834098,"acs":12338,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16335,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20833018939108128,"acs":2761,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13253,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6221524546354955,"acs":33292,"articleLive":2,"columnArticles":307,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53511,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42696151392728043,"acs":2008,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4703,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5698477633961505,"acs":8497,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14911,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5314121096553279,"acs":51835,"articleLive":2,"columnArticles":450,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97542,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6161251504211793,"acs":1536,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2493,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6689938791124713,"acs":6995,"articleLive":2,"columnArticles":115,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10456,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.613467813705132,"acs":4136,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6742,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6519065190651907,"acs":2650,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4065,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7000956689146893,"acs":59275,"articleLive":2,"columnArticles":477,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":84667,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5877363774571254,"acs":44072,"articleLive":2,"columnArticles":674,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74986,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7321578505457599,"acs":872,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1191,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37893958357037205,"acs":6661,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17578,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.532215416541152,"acs":15901,"articleLive":2,"columnArticles":215,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29877,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.399184367250379,"acs":62939,"articleLive":2,"columnArticles":876,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":157669,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5076922280007459,"acs":98011,"articleLive":2,"columnArticles":861,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":193052,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4879160716247391,"acs":8883,"articleLive":2,"columnArticles":146,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18206,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5742776490028229,"acs":125115,"articleLive":2,"columnArticles":1028,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":217865,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.518880064611657,"acs":96369,"articleLive":2,"columnArticles":847,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":185725,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.590677793608793,"acs":2902,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4913,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38033649994277213,"acs":16615,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43685,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4589211618257261,"acs":76867,"articleLive":2,"columnArticles":744,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":167495,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6973857767183155,"acs":43883,"articleLive":2,"columnArticles":445,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62925,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4771749875377037,"acs":56477,"articleLive":2,"columnArticles":693,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118357,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2516294397656536,"acs":3436,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13655,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5884566416749186,"acs":83196,"articleLive":2,"columnArticles":940,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141380,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515073581940277,"acs":19300,"articleLive":2,"columnArticles":172,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34995,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6629458836294588,"acs":48879,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73730,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6489182905536,"acs":138997,"articleLive":2,"columnArticles":1098,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":214198,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5580734505953023,"acs":15515,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27801,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48681923064765936,"acs":61606,"articleLive":2,"columnArticles":625,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":126548,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7116078553832275,"acs":82037,"articleLive":2,"columnArticles":954,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115284,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5089240289472865,"acs":98032,"articleLive":2,"columnArticles":854,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":192626,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5563899178611693,"acs":27637,"articleLive":2,"columnArticles":313,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49672,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6034559820610138,"acs":79658,"articleLive":2,"columnArticles":500,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":132003,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5770480485663473,"acs":153796,"articleLive":2,"columnArticles":1259,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":266522,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.362560789261779,"acs":57182,"articleLive":2,"columnArticles":463,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157717,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43619931385736094,"acs":28862,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66167,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6118462507876496,"acs":6797,"articleLive":2,"columnArticles":65,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11109,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5114448802576613,"acs":80192,"articleLive":2,"columnArticles":644,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":156795,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43783070477752295,"acs":34174,"articleLive":2,"columnArticles":404,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":78053,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8122908485064858,"acs":170642,"articleLive":2,"columnArticles":1361,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":210075,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6051925941689721,"acs":14219,"articleLive":2,"columnArticles":132,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23495,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7086030865205012,"acs":78149,"articleLive":2,"columnArticles":942,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110286,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3560875079264426,"acs":11231,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31540,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5293148880105402,"acs":1607,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3036,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37388790749959855,"acs":11641,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31135,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44117352558325823,"acs":8812,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19974,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2514895358237108,"acs":25199,"articleLive":2,"columnArticles":298,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100199,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4346443030653557,"acs":1503,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3458,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470582707569817,"acs":64037,"articleLive":2,"columnArticles":336,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":117057,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.619161105815062,"acs":1299,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2098,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39874939874939874,"acs":6632,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16632,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4201002227171492,"acs":21126,"articleLive":2,"columnArticles":181,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50288,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6121794096541938,"acs":75928,"articleLive":2,"columnArticles":604,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":124029,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33480671492376407,"acs":21739,"articleLive":2,"columnArticles":241,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64930,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7013051653578144,"acs":38043,"articleLive":2,"columnArticles":489,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54246,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038703479904558,"acs":38975,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64542,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43757369317437445,"acs":6680,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15266,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41972290138549306,"acs":3090,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7362,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44820283190124655,"acs":29628,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66104,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5414676094018728,"acs":5667,"articleLive":2,"columnArticles":97,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10466,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.472145704754931,"acs":40622,"articleLive":2,"columnArticles":431,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":86037,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5907312440645774,"acs":15551,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26325,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6357730619315721,"acs":1468,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2309,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6071512874481185,"acs":123463,"articleLive":2,"columnArticles":994,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":203348,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5865217281646448,"acs":46510,"articleLive":2,"columnArticles":402,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79298,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5780076104985852,"acs":5924,"articleLive":2,"columnArticles":115,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10249,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3877169852779609,"acs":3529,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9102,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.720425343376163,"acs":1626,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2257,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4837103428652724,"acs":6800,"articleLive":2,"columnArticles":82,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14058,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5458191845757652,"acs":47900,"articleLive":2,"columnArticles":406,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":87758,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5524026686935225,"acs":19623,"articleLive":2,"columnArticles":182,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35523,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3458933052489241,"acs":26603,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76911,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4932684398581187,"acs":151720,"articleLive":2,"columnArticles":1046,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":307581,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5426795867097335,"acs":28730,"articleLive":2,"columnArticles":439,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52941,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6872470239081039,"acs":103742,"articleLive":2,"columnArticles":1072,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":150953,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40485555404855555,"acs":2985,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7373,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.46904741581665316,"acs":43961,"articleLive":2,"columnArticles":455,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":93724,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.37260967379077614,"acs":2650,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7112,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7093763648484013,"acs":30860,"articleLive":2,"columnArticles":480,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43503,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5131066982901611,"acs":66200,"articleLive":2,"columnArticles":545,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":129018,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44115433251038716,"acs":29305,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66428,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6359632735313394,"acs":103828,"articleLive":2,"columnArticles":987,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":163261,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5040300913487372,"acs":30954,"articleLive":2,"columnArticles":324,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61413,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4835343426567445,"acs":5653,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11691,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5639577070591894,"acs":21762,"articleLive":2,"columnArticles":291,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38588,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4127099055946977,"acs":29640,"articleLive":2,"columnArticles":232,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":71818,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.677496328928047,"acs":14764,"articleLive":2,"columnArticles":211,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21792,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6745220704639001,"acs":247126,"articleLive":2,"columnArticles":1498,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":366372,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6075199110946472,"acs":3280,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5399,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7326378427237119,"acs":19453,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26552,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5377741195837498,"acs":18294,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":34018,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7313295224045732,"acs":51558,"articleLive":2,"columnArticles":575,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":70499,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5009402317544216,"acs":19713,"articleLive":2,"columnArticles":243,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39352,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.644555632616665,"acs":39033,"articleLive":2,"columnArticles":426,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60558,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.654201462750964,"acs":87033,"articleLive":2,"columnArticles":624,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":133037,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.510053050397878,"acs":19229,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37700,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6574408850965363,"acs":109101,"articleLive":2,"columnArticles":689,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":165948,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3977836103820356,"acs":2728,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6858,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5639412118415349,"acs":40328,"articleLive":2,"columnArticles":647,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71511,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7133480434600452,"acs":25540,"articleLive":2,"columnArticles":253,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35803,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3621053743004963,"acs":6859,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18942,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2747071407553502,"acs":69085,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":251486,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4955534505904881,"acs":72719,"articleLive":2,"columnArticles":758,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":146743,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5360399735399736,"acs":45379,"articleLive":2,"columnArticles":517,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84656,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7351888667992048,"acs":33282,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45270,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5789626195305708,"acs":1998,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3451,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47699721406520595,"acs":31675,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66405,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6451100521896982,"acs":39802,"articleLive":2,"columnArticles":463,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61698,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6210689728170107,"acs":79213,"articleLive":2,"columnArticles":638,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":127543,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6587849499482223,"acs":3817,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5794,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.375,"acs":25536,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68096,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5253042921204356,"acs":1640,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3122,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6754009697873927,"acs":14486,"articleLive":2,"columnArticles":139,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21448,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8422870503214837,"acs":15851,"articleLive":2,"columnArticles":102,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18819,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.538072834988674,"acs":3088,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5739,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.712725949290307,"acs":11750,"articleLive":2,"columnArticles":174,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16486,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7012061543164276,"acs":110109,"articleLive":2,"columnArticles":841,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":157028,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5984624482554701,"acs":14168,"articleLive":2,"columnArticles":190,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23674,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5822036687913338,"acs":38911,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66834,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6072782661964602,"acs":73358,"articleLive":2,"columnArticles":805,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":120798,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45786975905032096,"acs":70044,"articleLive":2,"columnArticles":649,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":152978,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5527450679414366,"acs":151241,"articleLive":2,"columnArticles":1244,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":273618,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7111042375502629,"acs":2299,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3233,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4186498300145702,"acs":3448,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8236,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6285714285714286,"acs":15114,"articleLive":2,"columnArticles":121,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24045,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6188131884714049,"acs":164035,"articleLive":2,"columnArticles":1147,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":265080,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35498025449758663,"acs":1618,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4558,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.481358189081225,"acs":2169,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4506,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43867714158290166,"acs":12787,"articleLive":2,"columnArticles":179,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29149,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5676822287852697,"acs":59010,"articleLive":2,"columnArticles":758,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103949,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.577727054300817,"acs":24045,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41620,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6054532505850035,"acs":5951,"articleLive":2,"columnArticles":87,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9829,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5030780838244782,"acs":46008,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91453,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3429368029739777,"acs":1107,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3228,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32591016862771166,"acs":14708,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45129,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7454214957358408,"acs":163623,"articleLive":2,"columnArticles":1344,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":219504,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5043177892918825,"acs":2920,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5790,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7284919507575758,"acs":61543,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84480,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4466148580537778,"acs":152410,"articleLive":2,"columnArticles":934,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":341256,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7748322233935873,"acs":90402,"articleLive":2,"columnArticles":752,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116673,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46638003105219156,"acs":3905,"articleLive":2,"columnArticles":63,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8373,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6061962583701714,"acs":32500,"articleLive":2,"columnArticles":326,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53613,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17954691516709512,"acs":4470,"articleLive":2,"columnArticles":77,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24896,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6108822155205369,"acs":14382,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23543,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6887828866486354,"acs":70032,"articleLive":2,"columnArticles":651,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":101675,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4319486429267206,"acs":120172,"articleLive":2,"columnArticles":1096,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":278209,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5078689919183327,"acs":1194,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2351,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5652050275834613,"acs":9938,"articleLive":2,"columnArticles":157,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17583,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6613108900790614,"acs":12965,"articleLive":2,"columnArticles":113,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19605,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48776845398947516,"acs":6859,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14062,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4732426556664251,"acs":84895,"articleLive":2,"columnArticles":742,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":179390,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6642949547218628,"acs":1027,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1546,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6476364931562612,"acs":12728,"articleLive":2,"columnArticles":114,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19653,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6834225627544641,"acs":42636,"articleLive":2,"columnArticles":440,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62386,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4685734974656046,"acs":25884,"articleLive":2,"columnArticles":281,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55240,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.702254458098494,"acs":15201,"articleLive":2,"columnArticles":86,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21646,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49646941819990054,"acs":9984,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20110,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41080653663679495,"acs":7793,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18970,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5233881817241023,"acs":10115,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19326,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40505968722673014,"acs":99590,"articleLive":2,"columnArticles":864,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":245865,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40822237794907734,"acs":8738,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21405,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6192338144832207,"acs":50836,"articleLive":2,"columnArticles":493,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":82095,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7746187789755907,"acs":13868,"articleLive":2,"columnArticles":62,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17903,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5956861915838444,"acs":8451,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14187,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7465805664310774,"acs":14683,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19667,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3847524047025294,"acs":2160,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5614,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42631880733944955,"acs":1487,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3488,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7452796997771783,"acs":88970,"articleLive":2,"columnArticles":567,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119378,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7612899329669666,"acs":63031,"articleLive":2,"columnArticles":464,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82795,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33989774663889416,"acs":1795,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5281,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5233677374463643,"acs":4513,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8623,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4426505390481199,"acs":8417,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19015,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5184474901912487,"acs":29467,"articleLive":2,"columnArticles":271,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56837,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.796797027346569,"acs":103786,"articleLive":2,"columnArticles":239,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":130254,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42111919389250185,"acs":81914,"articleLive":2,"columnArticles":286,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":194515,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4418703326544467,"acs":10414,"articleLive":2,"columnArticles":83,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23568,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5180332039946568,"acs":16288,"articleLive":2,"columnArticles":211,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31442,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221929305428525,"acs":29118,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55761,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48147408867486713,"acs":19297,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40079,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5007174732327294,"acs":31754,"articleLive":2,"columnArticles":376,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63417,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6291901055713955,"acs":8165,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12977,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6712890009454775,"acs":12780,"articleLive":2,"columnArticles":112,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":19038,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3741216009776963,"acs":2449,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6546,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3337393496651125,"acs":109872,"articleLive":2,"columnArticles":1262,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":329215,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5688597796963382,"acs":28662,"articleLive":2,"columnArticles":315,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50385,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6599014991611192,"acs":12193,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18477,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6565500685871056,"acs":7658,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11664,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48646633360674074,"acs":6524,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13411,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6653017512914199,"acs":10561,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15874,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319991595755856,"acs":50641,"articleLive":2,"columnArticles":394,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95190,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.667932375011301,"acs":7388,"articleLive":2,"columnArticles":64,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11061,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8176675977653631,"acs":11709,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14320,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34663510314507945,"acs":8200,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23656,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4245320589406611,"acs":5330,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12555,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46124947822457213,"acs":3315,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7187,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.787863358254059,"acs":190321,"articleLive":2,"columnArticles":1259,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":241566,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6197951310363177,"acs":4659,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7517,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46593415570623314,"acs":11407,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24482,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735752450636298,"acs":93673,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":121091,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5711961478130814,"acs":78291,"articleLive":2,"columnArticles":499,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":137065,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43723774127802423,"acs":65646,"articleLive":2,"columnArticles":424,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":150138,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5461143477831539,"acs":11061,"articleLive":2,"columnArticles":190,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20254,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.42020665901262916,"acs":2196,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5226,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3428649237472767,"acs":2518,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7344,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6842777502291545,"acs":45538,"articleLive":2,"columnArticles":356,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66549,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8080692892013647,"acs":85741,"articleLive":2,"columnArticles":341,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":106106,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5248818260165574,"acs":80393,"articleLive":2,"columnArticles":762,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":153164,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4068411251592669,"acs":4151,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10203,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3684725660659796,"acs":6400,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17369,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28855853464295195,"acs":1087,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3767,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5980122178963695,"acs":18893,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31593,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3977811124787132,"acs":94368,"articleLive":2,"columnArticles":769,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":237236,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44089147286821706,"acs":1365,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3096,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.55396370582617,"acs":4060,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7329,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5525505347443865,"acs":9868,"articleLive":2,"columnArticles":113,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17859,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6899162976612851,"acs":75254,"articleLive":2,"columnArticles":653,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":109077,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5923041213184093,"acs":11483,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19387,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37691271652512254,"acs":20149,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53458,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42492574644364545,"acs":10873,"articleLive":2,"columnArticles":212,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25588,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5329373917347191,"acs":21536,"articleLive":2,"columnArticles":242,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40410,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4896579156722355,"acs":2462,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5028,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45058020670304416,"acs":63913,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":141846,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4020293911826452,"acs":1149,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2858,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4338556059852572,"acs":68921,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":158857,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5778133305808583,"acs":22392,"articleLive":2,"columnArticles":201,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38753,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6567947634470125,"acs":125124,"articleLive":2,"columnArticles":922,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":190507,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.584902057074262,"acs":21439,"articleLive":2,"columnArticles":280,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36654,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48189645200204917,"acs":29161,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60513,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5671341302071948,"acs":49297,"articleLive":2,"columnArticles":655,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86923,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5835519209998457,"acs":3782,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6481,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5712569637883008,"acs":32813,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57440,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5980793835626285,"acs":41603,"articleLive":2,"columnArticles":395,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69561,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8106077881661726,"acs":60430,"articleLive":2,"columnArticles":611,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":74549,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5980818979115402,"acs":9479,"articleLive":2,"columnArticles":139,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15849,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.308336366945759,"acs":847,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2747,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834162773215594,"acs":82330,"articleLive":2,"columnArticles":628,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105091,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4547787042976267,"acs":26942,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59242,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419534422603954,"acs":28426,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52451,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6560150375939849,"acs":698,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1064,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5607164541590771,"acs":16623,"articleLive":2,"columnArticles":214,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29646,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40922621146928123,"acs":29008,"articleLive":2,"columnArticles":274,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":70885,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46443406022845274,"acs":1789,"articleLive":2,"columnArticles":36,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3852,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6538450149536584,"acs":22081,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33771,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2707944379969292,"acs":75133,"articleLive":2,"columnArticles":942,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":277454,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6179382644146768,"acs":2122,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3434,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6243192780457445,"acs":8025,"articleLive":2,"columnArticles":121,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12854,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5080178173719376,"acs":6843,"articleLive":2,"columnArticles":67,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13470,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6657376033810617,"acs":36545,"articleLive":2,"columnArticles":309,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54894,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45213570213570214,"acs":19138,"articleLive":2,"columnArticles":286,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42328,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4860968635105079,"acs":53546,"articleLive":2,"columnArticles":670,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110155,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.548094103633115,"acs":3681,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6716,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4353353792196405,"acs":47664,"articleLive":2,"columnArticles":418,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":109488,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4968644682394096,"acs":93176,"articleLive":2,"columnArticles":769,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":187528,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.400963523743978,"acs":2913,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7265,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5882112491824723,"acs":7195,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12232,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6176470588235294,"acs":14994,"articleLive":2,"columnArticles":252,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24276,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38566580049848864,"acs":43635,"articleLive":2,"columnArticles":479,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113142,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.54158687869453,"acs":26020,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":48044,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015489938455155,"acs":87102,"articleLive":2,"columnArticles":825,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":216915,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5033895022273872,"acs":2599,"articleLive":2,"columnArticles":63,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5163,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6949144880584646,"acs":46118,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66365,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4346468981662115,"acs":2228,"articleLive":2,"columnArticles":51,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5126,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658592427912533,"acs":60201,"articleLive":2,"columnArticles":608,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90411,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43112589889449393,"acs":20084,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46585,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3560819278098486,"acs":17333,"articleLive":2,"columnArticles":196,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48677,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4413761362328846,"acs":38360,"articleLive":2,"columnArticles":273,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86910,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108516309176292,"acs":8050,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15758,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4871377882909521,"acs":3295,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6764,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6477818853974122,"acs":56072,"articleLive":2,"columnArticles":568,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86560,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4920071047957371,"acs":3601,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7319,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5777377387538277,"acs":68299,"articleLive":2,"columnArticles":739,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":118218,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6099080599243945,"acs":26137,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42854,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5355456453305352,"acs":4083,"articleLive":2,"columnArticles":78,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7624,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6650003806237154,"acs":131035,"articleLive":2,"columnArticles":1299,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":197045,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6319119902426065,"acs":52328,"articleLive":2,"columnArticles":476,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82809,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6049524775978762,"acs":66768,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110369,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44684617673311516,"acs":30037,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67220,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4781411359724613,"acs":2778,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5810,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.760508138295918,"acs":82795,"articleLive":2,"columnArticles":523,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":108868,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7232515817562917,"acs":76703,"articleLive":2,"columnArticles":568,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":106053,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7421928038017651,"acs":4373,"articleLive":2,"columnArticles":77,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5892,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.51302710587916,"acs":60490,"articleLive":2,"columnArticles":552,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117908,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5556657098322744,"acs":294819,"articleLive":2,"columnArticles":1460,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":530569,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6450823043299443,"acs":67444,"articleLive":2,"columnArticles":434,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":104551,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6442014045841924,"acs":58431,"articleLive":2,"columnArticles":391,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":90703,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3220138881970251,"acs":64643,"articleLive":2,"columnArticles":443,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":200746,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33946188340807176,"acs":2271,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6690,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7587478357523032,"acs":70993,"articleLive":2,"columnArticles":511,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93566,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3527714400751577,"acs":5257,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14902,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5600624024960998,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1282,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6722440510352744,"acs":15227,"articleLive":2,"columnArticles":171,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22651,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41431219360091465,"acs":23917,"articleLive":2,"columnArticles":221,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":57727,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7218923042758798,"acs":100774,"articleLive":2,"columnArticles":672,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":139597,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4096719544124442,"acs":2660,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6493,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4602630074328187,"acs":4025,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8745,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115055672099403,"acs":31698,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61970,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5645438555736236,"acs":85057,"articleLive":2,"columnArticles":589,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":150665,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36982322184413646,"acs":8912,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24098,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4848832043397947,"acs":20737,"articleLive":2,"columnArticles":275,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42767,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46935536119209587,"acs":28978,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61740,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3218442256042972,"acs":5033,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15638,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7204595185995624,"acs":1317,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1828,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46290124715454223,"acs":138482,"articleLive":2,"columnArticles":866,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":299161,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6085554573409858,"acs":48881,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80323,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524264966347857,"acs":21833,"articleLive":2,"columnArticles":398,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39522,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4094598376714246,"acs":2926,"articleLive":2,"columnArticles":50,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7146,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7601422373305899,"acs":33989,"articleLive":2,"columnArticles":310,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44714,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5135369555789604,"acs":8289,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16141,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4902351038686404,"acs":3941,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8039,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5056376847907793,"acs":4036,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7982,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6104547081990691,"acs":3410,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5586,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804497667618186,"acs":66696,"articleLive":2,"columnArticles":571,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":114904,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.47967289719626166,"acs":2053,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4280,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40692473781616284,"acs":21108,"articleLive":2,"columnArticles":265,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51872,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4635014836795252,"acs":1562,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3370,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4614835099416597,"acs":3876,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8399,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.501817829269475,"acs":41408,"articleLive":2,"columnArticles":590,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82516,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.680129312676397,"acs":213749,"articleLive":2,"columnArticles":1525,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":314277,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6296291776994131,"acs":51600,"articleLive":2,"columnArticles":598,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":81953,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3673469387755102,"acs":3996,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10878,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49500805152979066,"acs":1537,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3105,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5205442226167615,"acs":57466,"articleLive":2,"columnArticles":525,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":110396,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4589257503949447,"acs":41251,"articleLive":2,"columnArticles":366,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89886,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3928230317915132,"acs":2879,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7329,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5883720729208987,"acs":136134,"articleLive":2,"columnArticles":1303,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":231374,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4167643074219179,"acs":45529,"articleLive":2,"columnArticles":405,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109244,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6019869456709541,"acs":12543,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20836,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.4987240247903755,"acs":1368,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2743,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7215417867435159,"acs":2003,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2776,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027007562117393,"acs":1396,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2777,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5302784433862113,"acs":69931,"articleLive":2,"columnArticles":592,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":131876,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5921052631578947,"acs":3240,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5472,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43083109919571044,"acs":8035,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18650,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49904104334484084,"acs":1301,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2607,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5652920962199313,"acs":4606,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8148,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41989708404802745,"acs":2448,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5830,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.46219704952581664,"acs":3509,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7592,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6609336609336609,"acs":1883,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2849,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.839608593916188,"acs":3947,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4701,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5906021384355655,"acs":2099,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3554,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7002038895859473,"acs":17858,"articleLive":2,"columnArticles":143,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25504,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631757352872891,"acs":82178,"articleLive":2,"columnArticles":990,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":107679,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4937514737090309,"acs":4188,"articleLive":2,"columnArticles":54,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8482,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6652689152233364,"acs":29192,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43880,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080786897057499,"acs":55034,"articleLive":2,"columnArticles":636,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77723,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47790269316515455,"acs":40086,"articleLive":2,"columnArticles":498,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83879,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.505716715487102,"acs":5352,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10583,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.587637555607586,"acs":12549,"articleLive":2,"columnArticles":150,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21355,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5548837209302325,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2150,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512696023153369,"acs":153243,"articleLive":2,"columnArticles":1115,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":180017,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4933875079668579,"acs":6193,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12552,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7133133927481382,"acs":23371,"articleLive":2,"columnArticles":333,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32764,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5901898734177216,"acs":1119,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1896,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46005434782608695,"acs":5079,"articleLive":2,"columnArticles":81,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11040,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5692405871091257,"acs":1784,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3134,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32347493922907744,"acs":5589,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17278,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5941385659159121,"acs":23557,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39649,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4363983616365226,"acs":18965,"articleLive":2,"columnArticles":236,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43458,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28591340709121005,"acs":3282,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11479,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.617077376965067,"acs":43296,"articleLive":2,"columnArticles":661,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70163,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42836839113132463,"acs":1507,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3518,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5959787492099284,"acs":69776,"articleLive":2,"columnArticles":671,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117078,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6871079922995715,"acs":44258,"articleLive":2,"columnArticles":488,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64412,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5123301523099286,"acs":40533,"articleLive":2,"columnArticles":406,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":79115,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.47304791481810116,"acs":4265,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9016,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39101320772143716,"acs":42335,"articleLive":2,"columnArticles":399,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108270,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6081121089509524,"acs":18486,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30399,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6922364460322186,"acs":20927,"articleLive":2,"columnArticles":295,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30231,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4496195526861886,"acs":3900,"articleLive":2,"columnArticles":67,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8674,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948822491328425,"acs":11419,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16433,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4642437854116686,"acs":9095,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19591,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39314641744548284,"acs":5048,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12840,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.34086803464727405,"acs":7359,"articleLive":2,"columnArticles":104,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21589,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5326446828234671,"acs":8044,"articleLive":2,"columnArticles":89,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15102,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5304723721638632,"acs":23684,"articleLive":2,"columnArticles":282,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44647,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7930814747382795,"acs":43560,"articleLive":2,"columnArticles":540,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":54925,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46408286000668225,"acs":1389,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2993,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40877651398708886,"acs":5319,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13012,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7060843964671246,"acs":1439,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2038,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4195428835276463,"acs":7269,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17326,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5765110093098862,"acs":31210,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54136,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48200958441354386,"acs":12271,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25458,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7714219276828276,"acs":39810,"articleLive":2,"columnArticles":400,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51606,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2907855812424674,"acs":2654,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9127,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.656648806624452,"acs":13481,"articleLive":2,"columnArticles":151,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20530,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8454642693424337,"acs":16599,"articleLive":2,"columnArticles":219,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19633,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48104860731840526,"acs":4404,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9155,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41918674184179056,"acs":4907,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11706,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7335334628288893,"acs":16616,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22652,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7051414691196978,"acs":15676,"articleLive":2,"columnArticles":200,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22231,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.630422175829274,"acs":10871,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17244,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5502087107190675,"acs":6986,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12697,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6991872393534443,"acs":22969,"articleLive":2,"columnArticles":355,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32851,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4335809517630648,"acs":26732,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61654,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51058352402746,"acs":3570,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6992,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.591510546312066,"acs":13545,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22899,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43328992541730793,"acs":3660,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8447,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42146857975907315,"acs":21972,"articleLive":2,"columnArticles":249,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52132,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5076570101724901,"acs":55095,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108528,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6927664273881833,"acs":25092,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36220,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5021795989537925,"acs":2880,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5735,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.428051267113312,"acs":2939,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6866,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6154604902641289,"acs":16847,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27373,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3915300224135897,"acs":6638,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16954,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3744429374152296,"acs":7730,"articleLive":2,"columnArticles":113,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20644,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.38973416531327465,"acs":9119,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23398,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4917632702867602,"acs":3224,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6556,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3659119496855346,"acs":8727,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23850,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5432712907709512,"acs":51984,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95687,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40540832882639266,"acs":7496,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18490,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7957724270980189,"acs":85797,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107816,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.43020346897931955,"acs":5159,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11992,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5284869976359338,"acs":13413,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25380,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5743207245604688,"acs":4312,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7508,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4793837328832316,"acs":37774,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78797,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3958639555773314,"acs":19391,"articleLive":2,"columnArticles":245,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48984,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.500069783670621,"acs":7166,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14330,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5746647064118335,"acs":19153,"articleLive":2,"columnArticles":269,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33329,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3599250488378583,"acs":9028,"articleLive":2,"columnArticles":114,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25083,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6577777777777778,"acs":55648,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84600,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4881285996733431,"acs":28392,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58165,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3795868442511552,"acs":2793,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7358,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5125804364849682,"acs":90330,"articleLive":2,"columnArticles":990,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":176226,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4212859072690938,"acs":37735,"articleLive":2,"columnArticles":556,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89571,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5116565858241823,"acs":8713,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17029,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6810360507839499,"acs":18721,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27489,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44945544554455447,"acs":9079,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20200,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42673562973232376,"acs":16006,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37508,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4491603616903488,"acs":2434,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5419,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4815227070347284,"acs":4326,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8984,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7144656107908927,"acs":84537,"articleLive":2,"columnArticles":732,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":118322,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38412258354563167,"acs":10253,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26692,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35973298170430196,"acs":4365,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12134,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4083593157495576,"acs":4846,"articleLive":2,"columnArticles":57,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11867,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6267975610691414,"acs":16345,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26077,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4666049668363412,"acs":3025,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6483,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5551075268817204,"acs":2891,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5208,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30213239424447996,"acs":27969,"articleLive":2,"columnArticles":364,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92572,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.587043717199078,"acs":90157,"articleLive":2,"columnArticles":775,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":153578,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8084161339187143,"acs":31487,"articleLive":2,"columnArticles":440,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38949,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19241314110139446,"acs":16282,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84620,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6046511627906976,"acs":35360,"articleLive":2,"columnArticles":564,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58480,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4560192134494146,"acs":3038,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6662,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6580438889696265,"acs":9056,"articleLive":2,"columnArticles":131,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13762,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2247473237246576,"acs":7516,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33442,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6701884500423573,"acs":83858,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125126,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6244285278878391,"acs":16390,"articleLive":2,"columnArticles":237,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26248,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.55094726062468,"acs":6456,"articleLive":2,"columnArticles":96,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11718,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42947229627081723,"acs":14983,"articleLive":2,"columnArticles":192,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34887,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3421658157762278,"acs":9517,"articleLive":2,"columnArticles":126,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27814,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521406810132305,"acs":60578,"articleLive":2,"columnArticles":723,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92891,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5112973516594033,"acs":15252,"articleLive":2,"columnArticles":113,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29830,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41547623838074926,"acs":20650,"articleLive":2,"columnArticles":229,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49702,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4796929622938026,"acs":44870,"articleLive":2,"columnArticles":355,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":93539,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7062562221157037,"acs":153235,"articleLive":2,"columnArticles":1651,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":216968,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7572765995208093,"acs":68270,"articleLive":2,"columnArticles":484,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90152,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28112039813692336,"acs":4406,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15673,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5543727607804727,"acs":21508,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38797,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528910272642863,"acs":5992,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23694,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5377735642162014,"acs":47081,"articleLive":2,"columnArticles":573,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87548,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4846425659146507,"acs":1783,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3679,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6892233746521629,"acs":10898,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15812,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6618563685636857,"acs":19538,"articleLive":2,"columnArticles":253,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29520,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6920677361853832,"acs":4659,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6732,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42676631102807416,"acs":8680,"articleLive":2,"columnArticles":115,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20339,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2913769951216196,"acs":51426,"articleLive":2,"columnArticles":338,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":176493,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6405350809198318,"acs":54539,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85146,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.676079661829433,"acs":15514,"articleLive":2,"columnArticles":148,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22947,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7265997696989637,"acs":8834,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12158,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33040157389191066,"acs":2855,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8641,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6386232536747092,"acs":33324,"articleLive":2,"columnArticles":682,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52181,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.725001683388324,"acs":10767,"articleLive":2,"columnArticles":105,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14851,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7746636112580058,"acs":13184,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17019,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5459743824336688,"acs":7161,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13116,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867172824814862,"acs":59658,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101681,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7440948646839438,"acs":62248,"articleLive":2,"columnArticles":711,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83656,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3382601615832655,"acs":5401,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15967,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5369943676395289,"acs":4195,"articleLive":2,"columnArticles":47,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7812,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4935121737862662,"acs":3385,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6859,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5459341667622434,"acs":19040,"articleLive":2,"columnArticles":233,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34876,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3291913214990138,"acs":3338,"articleLive":2,"columnArticles":78,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10140,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5308887283236994,"acs":2939,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5536,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4540044359531809,"acs":20674,"articleLive":2,"columnArticles":285,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":45537,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7005115243425408,"acs":58202,"articleLive":2,"columnArticles":605,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":83085,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2774486322954746,"acs":2201,"articleLive":2,"columnArticles":39,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7933,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3175438596491228,"acs":11403,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35910,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6987052959084674,"acs":20885,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29891,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45957338463279396,"acs":16245,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35348,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31899486884381145,"acs":6652,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20853,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.42660507212218346,"acs":4525,"articleLive":2,"columnArticles":69,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10607,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5602817986094125,"acs":231351,"articleLive":2,"columnArticles":1063,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":412919,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.399581589958159,"acs":1910,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4780,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3887511780218736,"acs":49088,"articleLive":2,"columnArticles":619,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126271,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.469375560203167,"acs":9426,"articleLive":2,"columnArticles":115,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20082,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44204200055263887,"acs":6399,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14476,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5702241215941832,"acs":29488,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51713,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3577508732661851,"acs":21098,"articleLive":2,"columnArticles":225,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":58974,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6333137829912023,"acs":5399,"articleLive":2,"columnArticles":101,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8525,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48392949714878175,"acs":1867,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3858,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.737804237436526,"acs":21068,"articleLive":2,"columnArticles":312,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28555,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.713937903961299,"acs":90024,"articleLive":2,"columnArticles":827,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126095,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33886038347285985,"acs":6274,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18515,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3590241672856082,"acs":6284,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17503,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38738108776836894,"acs":50413,"articleLive":2,"columnArticles":677,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130138,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5228266707588429,"acs":6814,"articleLive":2,"columnArticles":124,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13033,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33733294312749973,"acs":3458,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10251,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4196360879454132,"acs":2214,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5276,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6442370251739152,"acs":25745,"articleLive":2,"columnArticles":232,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39962,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5448478204797523,"acs":33798,"articleLive":2,"columnArticles":343,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62032,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6650465519962128,"acs":21072,"articleLive":2,"columnArticles":272,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31685,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.632722185406082,"acs":8593,"articleLive":2,"columnArticles":83,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13581,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7252505450981177,"acs":36256,"articleLive":2,"columnArticles":311,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49991,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4735797220606814,"acs":23616,"articleLive":2,"columnArticles":267,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49867,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4751415496781199,"acs":6126,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12893,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37863372093023256,"acs":1563,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4128,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5869384968053456,"acs":12034,"articleLive":2,"columnArticles":128,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20503,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8186402862555252,"acs":97234,"articleLive":2,"columnArticles":803,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118775,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45379482902418683,"acs":5441,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11990,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42118102288021536,"acs":5007,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11888,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3925567650847372,"acs":62170,"articleLive":2,"columnArticles":615,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158372,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7303501192855761,"acs":22654,"articleLive":2,"columnArticles":214,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31018,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47044025157232705,"acs":1870,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3975,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6896283575802741,"acs":21284,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30863,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48618799671142776,"acs":35482,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72980,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6246568448023426,"acs":27305,"articleLive":2,"columnArticles":301,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43712,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6128539177876023,"acs":26061,"articleLive":2,"columnArticles":337,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42524,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3916896869244936,"acs":6806,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17376,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3708167770419426,"acs":8399,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22650,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7745824141191302,"acs":9831,"articleLive":2,"columnArticles":146,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12692,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6639661642937987,"acs":11146,"articleLive":2,"columnArticles":168,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16787,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3522948380450956,"acs":3078,"articleLive":2,"columnArticles":59,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8737,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.553163808397398,"acs":14031,"articleLive":2,"columnArticles":170,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25365,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.30070227708022984,"acs":7065,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23495,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32990111122438576,"acs":3236,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9809,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.437777537095202,"acs":4042,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9233,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36087552689045754,"acs":14212,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39382,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5364788399061942,"acs":24935,"articleLive":2,"columnArticles":231,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46479,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.74349076597033,"acs":19646,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26424,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5564853556485355,"acs":1995,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3585,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768100734522561,"acs":36765,"articleLive":2,"columnArticles":303,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54321,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44312695023813437,"acs":13491,"articleLive":2,"columnArticles":134,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30445,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5035756853396901,"acs":2535,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5034,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.431777909037212,"acs":1462,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3386,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6837464202567114,"acs":33187,"articleLive":2,"columnArticles":393,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48537,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4037454164484023,"acs":3083,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7636,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4638517983880669,"acs":7712,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16626,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49906523468575975,"acs":25093,"articleLive":2,"columnArticles":328,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50280,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6513299784327822,"acs":15402,"articleLive":2,"columnArticles":196,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23647,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41400127488844723,"acs":11041,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26669,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44040182883637063,"acs":6839,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15529,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4110898661567878,"acs":1290,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3138,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6412559024196371,"acs":67766,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105677,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4662566014290152,"acs":37522,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80475,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44766274734728995,"acs":3122,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6974,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972528083639195,"acs":53699,"articleLive":2,"columnArticles":501,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89910,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7099657029270637,"acs":174298,"articleLive":2,"columnArticles":1358,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":245502,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4734970345567155,"acs":43271,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91386,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7126746339000168,"acs":8468,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11882,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7347378133169307,"acs":14334,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19509,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5324137586989599,"acs":21345,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40091,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5450662110209312,"acs":2552,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4682,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6341887352550581,"acs":32473,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51204,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4174377388021912,"acs":9068,"articleLive":2,"columnArticles":145,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21723,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.600516414607156,"acs":16280,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27110,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6783466219051616,"acs":25864,"articleLive":2,"columnArticles":251,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":38128,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5328405151633416,"acs":23210,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43559,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4981926429938337,"acs":9372,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18812,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4712648818841293,"acs":52686,"articleLive":2,"columnArticles":596,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111797,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5028258778258778,"acs":33452,"articleLive":2,"columnArticles":503,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66528,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5201400011864508,"acs":8768,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16857,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4529662719289855,"acs":23677,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52271,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570817137616282,"acs":51022,"articleLive":2,"columnArticles":806,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91588,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5093204884967489,"acs":55301,"articleLive":2,"columnArticles":1409,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":108578,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5398009950248757,"acs":21483,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39798,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49479583666933546,"acs":4326,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8743,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5104625780348429,"acs":36714,"articleLive":2,"columnArticles":398,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":71923,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6148540263073468,"acs":7666,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12468,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906842987183551,"acs":30502,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44162,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.40973981119042135,"acs":3559,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8686,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2920353982300885,"acs":2112,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7232,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.735529109038276,"acs":57169,"articleLive":2,"columnArticles":601,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77725,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5768812372889373,"acs":12197,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21143,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5970025639444214,"acs":67758,"articleLive":2,"columnArticles":715,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113497,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5311166030105594,"acs":26004,"articleLive":2,"columnArticles":420,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":48961,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6274226453587215,"acs":44286,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70584,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46522922952387963,"acs":6322,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13589,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7224372580846548,"acs":17358,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":24027,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928585215209419,"acs":15358,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25905,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45262025285501184,"acs":18509,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40893,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6266516174460506,"acs":60517,"articleLive":2,"columnArticles":581,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96572,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.334455789702368,"acs":3079,"articleLive":2,"columnArticles":65,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9206,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39699328088597763,"acs":47031,"articleLive":2,"columnArticles":920,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118468,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5509190334402199,"acs":38485,"articleLive":2,"columnArticles":453,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":69856,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3547799475371612,"acs":4869,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13724,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5839982020451736,"acs":5197,"articleLive":2,"columnArticles":80,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8899,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5610064883684127,"acs":3545,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6319,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5162478158385421,"acs":44022,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85273,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.598287570121051,"acs":20264,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33870,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5367985280588776,"acs":9336,"articleLive":2,"columnArticles":139,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17392,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7829916394531091,"acs":57784,"articleLive":2,"columnArticles":655,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73799,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7050071022727272,"acs":19853,"articleLive":2,"columnArticles":266,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28160,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5647376359450663,"acs":7114,"articleLive":2,"columnArticles":156,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12597,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5571749812609311,"acs":33450,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":60035,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095649067388689,"acs":75475,"articleLive":2,"columnArticles":649,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106368,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6712660698660564,"acs":9973,"articleLive":2,"columnArticles":169,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14857,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43436816505076226,"acs":13306,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30633,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7320322627106438,"acs":20330,"articleLive":2,"columnArticles":424,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27772,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6559118860434343,"acs":16853,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25694,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105083200364714,"acs":40521,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57031,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5672391634536745,"acs":4855,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8559,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3979320068933104,"acs":2540,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6383,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39062833558670745,"acs":10979,"articleLive":2,"columnArticles":167,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28106,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43244547384674775,"acs":4481,"articleLive":2,"columnArticles":98,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10362,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6333274084607181,"acs":35631,"articleLive":2,"columnArticles":387,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56260,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.29998157361341443,"acs":3256,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10854,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43827272727272726,"acs":9642,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22000,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7934894774695894,"acs":25375,"articleLive":2,"columnArticles":318,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31979,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5547123623011015,"acs":4532,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8170,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5209274906661426,"acs":2651,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5089,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48299748110831237,"acs":6903,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14292,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5299575332348597,"acs":11481,"articleLive":2,"columnArticles":152,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21664,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6916173038951714,"acs":7706,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11142,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20898786310456682,"acs":5734,"articleLive":2,"columnArticles":73,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27437,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6399002870524249,"acs":8471,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13238,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6600338653601451,"acs":65876,"articleLive":2,"columnArticles":914,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99807,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7248264007312315,"acs":106261,"articleLive":2,"columnArticles":984,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":146602,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4551031790295594,"acs":9792,"articleLive":2,"columnArticles":135,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21516,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6452008678087828,"acs":43122,"articleLive":2,"columnArticles":404,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":66835,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7576382879584637,"acs":11382,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15023,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7533769905516758,"acs":31177,"articleLive":2,"columnArticles":371,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41383,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5813391346386271,"acs":48100,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82740,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4592466810744057,"acs":5950,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12956,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37633898947767563,"acs":7940,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21098,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5878505848320966,"acs":4674,"articleLive":2,"columnArticles":86,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7951,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4098995522207431,"acs":3387,"articleLive":2,"columnArticles":66,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8263,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4653752287980476,"acs":3051,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6556,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34169439467622215,"acs":1335,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3907,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36308478365000796,"acs":2274,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6263,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.531392062906991,"acs":4325,"articleLive":2,"columnArticles":64,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8139,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6058172346429347,"acs":2791,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4607,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5431384807752423,"acs":3475,"articleLive":2,"columnArticles":48,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6398,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7062190003815337,"acs":1851,"articleLive":2,"columnArticles":40,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2621,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6507547939616483,"acs":4785,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7353,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5422034651266104,"acs":2441,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4502,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47412199630314233,"acs":2052,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4328,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4225855901890649,"acs":827,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1957,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8645190919826794,"acs":13177,"articleLive":2,"columnArticles":63,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15242,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8192514155452607,"acs":11141,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13599,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4807208974437565,"acs":7842,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16313,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866680208544925,"acs":34658,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59076,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5807127882599581,"acs":3324,"articleLive":2,"columnArticles":54,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5724,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.334996534996535,"acs":2417,"articleLive":2,"columnArticles":54,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7215,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6693215552820215,"acs":18488,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27622,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.693852309930884,"acs":9537,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13745,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4960116026105874,"acs":10260,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20685,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7207456978967495,"acs":7539,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10460,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6223008288897102,"acs":11787,"articleLive":2,"columnArticles":183,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18941,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7346435752740481,"acs":11326,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15417,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4908964397541459,"acs":4233,"articleLive":2,"columnArticles":91,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8623,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5709317154229625,"acs":14774,"articleLive":2,"columnArticles":147,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25877,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7605446695450017,"acs":11450,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15055,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5277638568708028,"acs":10531,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19954,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5368657574332445,"acs":10274,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19137,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7729117709891049,"acs":3618,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4681,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6908062996365595,"acs":5132,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7429,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5340742907282832,"acs":1826,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3419,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4513084513084513,"acs":1052,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2331,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854696983422412,"acs":19389,"articleLive":2,"columnArticles":289,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33117,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5449750138811771,"acs":3926,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7204,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37879987652498354,"acs":28224,"articleLive":2,"columnArticles":288,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":74509,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.49004651162790697,"acs":2634,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5375,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37921463815789475,"acs":3689,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9728,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6085326467466179,"acs":26944,"articleLive":2,"columnArticles":379,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44277,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37283805775271545,"acs":19703,"articleLive":2,"columnArticles":386,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52846,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5480078380143697,"acs":1678,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3062,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5196078431372549,"acs":6201,"articleLive":2,"columnArticles":111,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11934,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4720949738692819,"acs":7317,"articleLive":2,"columnArticles":103,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15499,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5807917713192202,"acs":4856,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8361,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6997677912853435,"acs":5123,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7321,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.667129372570794,"acs":2403,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3602,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37067395264116576,"acs":5291,"articleLive":2,"columnArticles":67,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14274,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6367328681338343,"acs":35587,"articleLive":2,"columnArticles":1103,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55890,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.761016814088772,"acs":28650,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37647,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5593385214007782,"acs":5175,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9252,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5772058823529411,"acs":4239,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7344,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41200394380083805,"acs":6686,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16228,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8396096584511448,"acs":67110,"articleLive":2,"columnArticles":682,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79930,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.576977978165208,"acs":58610,"articleLive":2,"columnArticles":586,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101581,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6301354528154035,"acs":11258,"articleLive":2,"columnArticles":203,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17866,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713008778930567,"acs":24161,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31325,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6451339437097321,"acs":7610,"articleLive":2,"columnArticles":87,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11796,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5407883394718282,"acs":6901,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12761,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6536828984823729,"acs":77617,"articleLive":2,"columnArticles":581,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118738,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619294093167218,"acs":43209,"articleLive":2,"columnArticles":479,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76894,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5197082628378069,"acs":22731,"articleLive":2,"columnArticles":369,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43738,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.521297323221726,"acs":17391,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33361,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6428767499313752,"acs":2342,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3643,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.866729088639201,"acs":8331,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9612,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6098685727461379,"acs":2645,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4337,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5756940806705081,"acs":1099,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1909,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070209510996344,"acs":65164,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92167,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7024800554977454,"acs":8101,"articleLive":2,"columnArticles":104,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11532,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3183694787107043,"acs":12801,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40208,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49087679638301307,"acs":3040,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6193,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6932438580527752,"acs":6095,"articleLive":2,"columnArticles":93,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8792,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4130639589657699,"acs":3946,"articleLive":2,"columnArticles":73,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9553,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5449213308503307,"acs":37162,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68197,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3799449709568939,"acs":6214,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16355,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6291369586038097,"acs":5912,"articleLive":2,"columnArticles":103,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9397,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4551101908001775,"acs":3077,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6761,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39008852486142137,"acs":4715,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12087,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.648095133230566,"acs":2943,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4541,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7763061074319353,"acs":3165,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4077,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.536036036036036,"acs":6307,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11766,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5705508908457915,"acs":2786,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4883,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6082170888952221,"acs":78963,"articleLive":2,"columnArticles":873,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":129827,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43306809379621153,"acs":6150,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14201,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4782630751280881,"acs":9428,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19713,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6516972785844792,"acs":6777,"articleLive":2,"columnArticles":96,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10399,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5099459349178823,"acs":9998,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19606,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.370562724206243,"acs":6921,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18677,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6370382191015719,"acs":167664,"articleLive":2,"columnArticles":1134,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":263193,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44194114875572876,"acs":10318,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23347,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4688917233560091,"acs":6617,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14112,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28729319229726064,"acs":4237,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14748,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5610493064139541,"acs":4085,"articleLive":2,"columnArticles":82,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7281,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7148369315571887,"acs":7781,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10885,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.442427774540005,"acs":5314,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12011,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6049845041322314,"acs":4685,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7744,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4860613071139387,"acs":4202,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8645,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38626126126126126,"acs":1372,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3552,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.371111594518164,"acs":1706,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4597,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5698065434980417,"acs":14403,"articleLive":2,"columnArticles":223,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25277,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47843811394891944,"acs":9741,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20360,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4317708333333333,"acs":4974,"articleLive":2,"columnArticles":83,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11520,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32021298809772397,"acs":3067,"articleLive":2,"columnArticles":46,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9578,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5502714659159461,"acs":5473,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9946,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48757047667862635,"acs":3805,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7804,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6868997044698929,"acs":59502,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86624,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6335776949885831,"acs":10544,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16642,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4694571519436358,"acs":38380,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81754,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2672963080121108,"acs":5915,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22129,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.607600341588386,"acs":5692,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9368,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8370836090889036,"acs":7589,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9066,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4839576985122782,"acs":2700,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5579,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.434401789042117,"acs":2331,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5366,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5703544575725027,"acs":1593,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2793,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32260070806621377,"acs":6743,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20902,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166794185156848,"acs":13702,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22219,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4747393451618804,"acs":12977,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27335,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2678050362044742,"acs":2478,"articleLive":2,"columnArticles":54,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9253,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7579145138562705,"acs":8068,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10645,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6185999237708042,"acs":4869,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7871,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4913014160485502,"acs":7286,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14830,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.450281425891182,"acs":4320,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9594,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.265527950310559,"acs":6156,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23184,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4618980134755476,"acs":18578,"articleLive":2,"columnArticles":184,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40221,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6366771941489362,"acs":30642,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48128,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7761527020327219,"acs":3131,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4034,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37253924744580114,"acs":1495,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4013,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.39812463371752294,"acs":2038,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5119,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5990740740740741,"acs":647,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1080,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5853306508047585,"acs":13383,"articleLive":2,"columnArticles":261,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22864,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6073450897912959,"acs":11262,"articleLive":2,"columnArticles":205,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18543,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39412909674364777,"acs":7492,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19009,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44151838671411625,"acs":1861,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4215,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6938083121289228,"acs":3272,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4716,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6455454096742349,"acs":20926,"articleLive":2,"columnArticles":326,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32416,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6509937404448034,"acs":45136,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69334,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2672517485632824,"acs":5999,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22447,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49784055095132485,"acs":4265,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8567,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.601738185768604,"acs":5539,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9205,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5056647067259429,"acs":3526,"articleLive":2,"columnArticles":63,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6973,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6367676027303129,"acs":13900,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21829,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6935419173686321,"acs":3458,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4986,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.37018092984197265,"acs":4849,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13099,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7465411222136817,"acs":3885,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5204,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4377962085308057,"acs":739,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1688,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6858962065129838,"acs":17882,"articleLive":2,"columnArticles":251,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26071,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.2469667158550582,"acs":6025,"articleLive":2,"columnArticles":86,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24396,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5034455638365605,"acs":26885,"articleLive":2,"columnArticles":295,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53402,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6217725409836066,"acs":12137,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19520,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7265675500969618,"acs":5620,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7735,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4678707884682181,"acs":5388,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11516,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6135326232882843,"acs":6855,"articleLive":2,"columnArticles":89,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11173,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304630837305118,"acs":59925,"articleLive":2,"columnArticles":831,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82037,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4968098146654234,"acs":47420,"articleLive":2,"columnArticles":613,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95449,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5289508053983457,"acs":12150,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22970,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44900371496116176,"acs":2659,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5922,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6553471419681749,"acs":7372,"articleLive":2,"columnArticles":62,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11249,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5098178858480008,"acs":5011,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9829,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7745740498034076,"acs":5910,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7630,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6350817822899041,"acs":3378,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5319,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41202438511667017,"acs":1960,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4757,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5402046783625731,"acs":1478,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2736,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6940395668603728,"acs":21856,"articleLive":2,"columnArticles":356,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31491,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42254379284082255,"acs":8322,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19695,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6305403288958497,"acs":12078,"articleLive":2,"columnArticles":172,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19155,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5265720081135903,"acs":3894,"articleLive":2,"columnArticles":73,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7395,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439305083998413,"acs":76558,"articleLive":2,"columnArticles":1109,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90716,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6723842195540308,"acs":5880,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8745,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4752489131959052,"acs":3389,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7131,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32718062591076263,"acs":4715,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14411,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5388826275962003,"acs":3347,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6211,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5972522771878617,"acs":11868,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19871,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6628213579433092,"acs":10055,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15170,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5397657752141234,"acs":3088,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5721,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41787190082644626,"acs":2427,"articleLive":2,"columnArticles":44,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5808,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4941139039134585,"acs":3106,"articleLive":2,"columnArticles":62,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6286,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5630580357142857,"acs":3027,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5376,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46954578886745585,"acs":33835,"articleLive":2,"columnArticles":421,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72059,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48226651412055155,"acs":8009,"articleLive":2,"columnArticles":115,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16607,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3438574008271684,"acs":5903,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17167,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4631257719973843,"acs":6374,"articleLive":2,"columnArticles":111,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13763,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.562618595825427,"acs":1186,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2108,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7106478242619281,"acs":10158,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14294,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.659704641350211,"acs":3127,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4740,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49112601482527357,"acs":34784,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70825,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49477351916376305,"acs":2556,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5166,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5952983047672568,"acs":6356,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10677,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4712599923867529,"acs":1238,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2627,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5410758965804837,"acs":2595,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4796,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6208291203235592,"acs":2456,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3956,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5107975813417794,"acs":3548,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6946,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4812877921228959,"acs":2945,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6119,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6174425205790519,"acs":8701,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14092,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5595718125960062,"acs":34971,"articleLive":2,"columnArticles":480,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62496,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5752087379865298,"acs":22803,"articleLive":2,"columnArticles":320,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39643,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5627195701591238,"acs":2723,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4839,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7723726037953954,"acs":8018,"articleLive":2,"columnArticles":96,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10381,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.748622789214265,"acs":18074,"articleLive":2,"columnArticles":315,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24143,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3932677135772785,"acs":5234,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13309,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5985096626269243,"acs":14618,"articleLive":2,"columnArticles":228,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24424,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6817458513298477,"acs":2999,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4399,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6672458731537794,"acs":1536,"articleLive":2,"columnArticles":37,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2302,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5633281972265023,"acs":1828,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3245,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5565099457504521,"acs":1231,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2212,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4801260300533204,"acs":1981,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4126,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6044515565900495,"acs":12465,"articleLive":2,"columnArticles":253,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20622,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7289980463298912,"acs":7836,"articleLive":2,"columnArticles":100,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10749,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5255046755227355,"acs":13094,"articleLive":2,"columnArticles":202,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24917,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4199245079536263,"acs":3115,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7418,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.567950368722931,"acs":4852,"articleLive":2,"columnArticles":85,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8543,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9221476510067114,"acs":2748,"articleLive":2,"columnArticles":67,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2980,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8240835100669293,"acs":29920,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36307,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071451685975018,"acs":9381,"articleLive":2,"columnArticles":146,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15451,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5852517722721625,"acs":8008,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13683,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4914545898040491,"acs":30222,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61495,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8032301480484523,"acs":5968,"articleLive":2,"columnArticles":84,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7430,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5072403806371535,"acs":2452,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4834,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5193673337637186,"acs":1609,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3098,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.543598615916955,"acs":1571,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2890,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6009852216748769,"acs":976,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1624,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5418157720344599,"acs":8176,"articleLive":2,"columnArticles":169,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15090,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5016111707841031,"acs":6538,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13034,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7250066195105345,"acs":19167,"articleLive":2,"columnArticles":235,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26437,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.597629239380968,"acs":3630,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6074,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6203667577058135,"acs":1590,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2563,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5064739536284252,"acs":6728,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13284,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318754469934533,"acs":45363,"articleLive":2,"columnArticles":616,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54531,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.810420997920998,"acs":12474,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15392,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41781846466822237,"acs":6983,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16713,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6602139582272033,"acs":2592,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3926,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8116129032258065,"acs":4403,"articleLive":2,"columnArticles":60,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5425,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6459518007040347,"acs":4771,"articleLive":2,"columnArticles":93,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7386,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6034683878995256,"acs":15520,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25718,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5628060069944456,"acs":13679,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24305,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.625976748618258,"acs":6569,"articleLive":2,"columnArticles":98,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10494,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8092331744862524,"acs":53831,"articleLive":2,"columnArticles":699,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66521,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5198430327261958,"acs":7021,"articleLive":2,"columnArticles":156,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13506,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.470153319324461,"acs":6041,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12849,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35980376300609196,"acs":13348,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37098,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6561620709060214,"acs":6996,"articleLive":2,"columnArticles":73,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10662,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8083740779945225,"acs":48112,"articleLive":2,"columnArticles":638,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59517,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4545614860098754,"acs":7733,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17012,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45844541979328896,"acs":6476,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14126,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5976696367374914,"acs":2616,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4377,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7865812716285315,"acs":30458,"articleLive":2,"columnArticles":433,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38722,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46668470802002593,"acs":24143,"articleLive":2,"columnArticles":363,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51733,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36136338154501624,"acs":3223,"articleLive":2,"columnArticles":76,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8919,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8188699536730641,"acs":19797,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24176,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.822160407974038,"acs":8867,"articleLive":2,"columnArticles":84,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10785,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7238121133845422,"acs":21296,"articleLive":2,"columnArticles":384,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29422,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7471367393685888,"acs":15004,"articleLive":2,"columnArticles":226,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20082,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5755002632964719,"acs":17486,"articleLive":2,"columnArticles":272,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30384,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33093525179856115,"acs":1840,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5560,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7513429459994345,"acs":5315,"articleLive":2,"columnArticles":60,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7074,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7557595310582996,"acs":16632,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22007,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.712859670718572,"acs":37063,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51992,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.378174143917217,"acs":5555,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14689,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.666624890337135,"acs":10638,"articleLive":2,"columnArticles":151,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15958,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8319046375228552,"acs":35034,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42113,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.740143144148669,"acs":11789,"articleLive":2,"columnArticles":193,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15928,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.810121789613176,"acs":12838,"articleLive":2,"columnArticles":263,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15847,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44073957016434895,"acs":2789,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6328,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6144868246901697,"acs":10214,"articleLive":2,"columnArticles":193,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16622,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.655107973421927,"acs":6310,"articleLive":2,"columnArticles":113,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9632,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6169037122738426,"acs":30926,"articleLive":2,"columnArticles":513,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50131,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.589396100808369,"acs":2479,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4206,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6141281585927684,"acs":4399,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7163,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5939454870420018,"acs":5317,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8952,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7551171850844104,"acs":24422,"articleLive":2,"columnArticles":479,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32342,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5888734076433121,"acs":5917,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10048,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7273825598749201,"acs":10235,"articleLive":2,"columnArticles":182,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14071,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4726078028747433,"acs":5754,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12175,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6894433299899699,"acs":5499,"articleLive":2,"columnArticles":52,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7976,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4626204538389804,"acs":5953,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12868,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7716995698687549,"acs":6997,"articleLive":2,"columnArticles":157,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9067,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3788517677586766,"acs":1168,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3083,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.535623869801085,"acs":11848,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22120,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.686779316846762,"acs":9470,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13789,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5437765751836103,"acs":5627,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10348,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49021814404432135,"acs":5663,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11552,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5855043420173681,"acs":3506,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5988,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4210773935544578,"acs":1790,"articleLive":2,"columnArticles":49,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4251,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.705962280558726,"acs":38967,"articleLive":2,"columnArticles":623,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55197,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6398870455347688,"acs":9064,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14165,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39865996649916247,"acs":8330,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20895,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5739745773817324,"acs":4380,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7631,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.47994916690200506,"acs":3399,"articleLive":2,"columnArticles":48,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7082,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8203083777921089,"acs":41976,"articleLive":2,"columnArticles":638,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51171,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5445995403864159,"acs":12797,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23498,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5924030702617595,"acs":6020,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10162,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36660147624755535,"acs":5811,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15851,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43490519100005526,"acs":15734,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36178,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7402400983079687,"acs":7831,"articleLive":2,"columnArticles":116,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10579,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30547198194810077,"acs":3249,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10636,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5063617329682719,"acs":3144,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6209,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.848240395280831,"acs":8412,"articleLive":2,"columnArticles":85,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9917,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7546146044624746,"acs":29762,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39440,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4449642451380071,"acs":6658,"articleLive":2,"columnArticles":72,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14963,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28392359729407085,"acs":11416,"articleLive":2,"columnArticles":154,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40208,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28184202856310114,"acs":2901,"articleLive":2,"columnArticles":71,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10293,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6613484302624807,"acs":3855,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5829,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315414817888722,"acs":45834,"articleLive":2,"columnArticles":507,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62654,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5300889586603872,"acs":4052,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7644,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49508944230094704,"acs":5646,"articleLive":2,"columnArticles":112,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11404,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5513945777257655,"acs":2827,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5127,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5055748923367352,"acs":8570,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16951,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4023681377825619,"acs":7476,"articleLive":2,"columnArticles":202,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18580,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5253501676859341,"acs":5326,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10138,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3653546808983767,"acs":4929,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13491,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6740176423416199,"acs":3362,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4988,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250213128729753,"acs":85162,"articleLive":2,"columnArticles":1089,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103224,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5382925535944246,"acs":7106,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13201,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4182372657838343,"acs":15223,"articleLive":2,"columnArticles":222,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36398,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5253099927060539,"acs":3601,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6855,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6060538615624305,"acs":2723,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4493,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900849253412618,"acs":48098,"articleLive":2,"columnArticles":577,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60877,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799328547643093,"acs":21247,"articleLive":2,"columnArticles":266,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36637,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5129971813341685,"acs":8190,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15965,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4043480629869776,"acs":7421,"articleLive":2,"columnArticles":168,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18353,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7395874220419556,"acs":16958,"articleLive":2,"columnArticles":226,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22929,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5749022725766911,"acs":8677,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15093,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5030728122912491,"acs":7531,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14970,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32428449546265414,"acs":4181,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12893,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8614062313477379,"acs":7216,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8377,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8374285023765408,"acs":10395,"articleLive":2,"columnArticles":161,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12413,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7279427798857342,"acs":16691,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22929,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7317599211239832,"acs":11875,"articleLive":2,"columnArticles":157,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16228,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6923744037663383,"acs":11177,"articleLive":2,"columnArticles":174,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16143,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.322874708501166,"acs":4569,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14151,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5438840902758428,"acs":1952,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3589,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7008357408171688,"acs":13585,"articleLive":2,"columnArticles":203,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19384,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3120876940627945,"acs":6292,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20161,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6952178533475026,"acs":9813,"articleLive":2,"columnArticles":170,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14115,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5415428349916009,"acs":4191,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7739,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8312378253940145,"acs":28164,"articleLive":2,"columnArticles":480,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33882,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3540528487010815,"acs":6351,"articleLive":2,"columnArticles":116,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17938,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3996645501377741,"acs":6672,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16694,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4041131105398458,"acs":7860,"articleLive":2,"columnArticles":143,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19450,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8562132661628883,"acs":4079,"articleLive":2,"columnArticles":60,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4764,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6650227175643665,"acs":17125,"articleLive":2,"columnArticles":275,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25751,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7482539515832589,"acs":14249,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19043,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41315642234833344,"acs":10338,"articleLive":2,"columnArticles":144,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":25022,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3738590726542534,"acs":1024,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2739,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7622121423586881,"acs":4369,"articleLive":2,"columnArticles":66,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5732,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6711567243959803,"acs":9417,"articleLive":2,"columnArticles":152,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14031,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6050643685498457,"acs":5687,"articleLive":2,"columnArticles":97,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9399,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4168969181721573,"acs":3923,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9410,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7533421937299664,"acs":9636,"articleLive":2,"columnArticles":176,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12791,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6910847578117426,"acs":21387,"articleLive":2,"columnArticles":362,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30947,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49302421009437836,"acs":7209,"articleLive":2,"columnArticles":154,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14622,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5074248460702644,"acs":5604,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11044,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5683335285162197,"acs":4853,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8539,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.666704610130905,"acs":5857,"articleLive":2,"columnArticles":66,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8785,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6152362584378014,"acs":13398,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21777,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8068498606133014,"acs":8104,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10044,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47526648369183633,"acs":7446,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15667,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5505633902629155,"acs":7769,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14111,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5545365853658537,"acs":2842,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5125,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6933926302414232,"acs":10914,"articleLive":2,"columnArticles":223,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15740,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6035059111292295,"acs":7402,"articleLive":2,"columnArticles":148,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12265,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6849371950586526,"acs":6598,"articleLive":2,"columnArticles":180,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9633,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40841799709724236,"acs":2814,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6890,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.519052978535252,"acs":12913,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24878,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7326508681635654,"acs":25908,"articleLive":2,"columnArticles":415,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35362,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41861327400815723,"acs":7903,"articleLive":2,"columnArticles":151,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18879,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5971948818897638,"acs":2427,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4064,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7487818083378451,"acs":2766,"articleLive":2,"columnArticles":34,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3694,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5405654578979717,"acs":10554,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19524,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5542004561581348,"acs":34990,"articleLive":2,"columnArticles":510,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63136,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39767153241534187,"acs":6729,"articleLive":2,"columnArticles":145,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16921,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43923825181531717,"acs":3206,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7299,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.708994708994709,"acs":1474,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2079,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.655575014594279,"acs":1123,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1713,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5952380952380952,"acs":875,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1470,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5048998721772475,"acs":1185,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2347,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5837479270315091,"acs":704,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1206,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462383660806618,"acs":78558,"articleLive":2,"columnArticles":1031,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92832,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39381533101045296,"acs":4521,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11480,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6407994046986287,"acs":6028,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9407,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.465730951512942,"acs":2555,"articleLive":2,"columnArticles":45,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5486,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6200749063670412,"acs":4139,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6675,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8218884120171673,"acs":43279,"articleLive":2,"columnArticles":639,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":52658,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5868189708270339,"acs":10480,"articleLive":2,"columnArticles":176,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17859,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4828414500183083,"acs":32966,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68275,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5621605310802655,"acs":3726,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6628,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6987162693214567,"acs":2667,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3817,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6477117117117117,"acs":17974,"articleLive":2,"columnArticles":378,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27750,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.791567750182615,"acs":34677,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43808,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4106830122591944,"acs":5628,"articleLive":2,"columnArticles":140,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13704,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5270108043217286,"acs":2634,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4998,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8569277108433735,"acs":3983,"articleLive":2,"columnArticles":52,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4648,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5728111636281792,"acs":12725,"articleLive":2,"columnArticles":216,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22215,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6173522656086866,"acs":5913,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9578,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7114500474348683,"acs":9749,"articleLive":2,"columnArticles":156,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13703,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6278564899451554,"acs":16485,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26256,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8026574311498884,"acs":24103,"articleLive":2,"columnArticles":342,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30029,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.52296875,"acs":10041,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19200,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4992880475751738,"acs":5961,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11939,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36465074760098193,"acs":1634,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4481,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3963217302075933,"acs":5021,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12669,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6329380764163373,"acs":12010,"articleLive":2,"columnArticles":205,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18975,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5227688119774451,"acs":13443,"articleLive":2,"columnArticles":210,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25715,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6323155216284987,"acs":7952,"articleLive":2,"columnArticles":139,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12576,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4425183200693405,"acs":5616,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12691,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5967110415035238,"acs":2286,"articleLive":2,"columnArticles":47,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3831,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7451666180899641,"acs":15340,"articleLive":2,"columnArticles":311,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20586,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5008926294312676,"acs":5892,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11763,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42757345387302237,"acs":6243,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14601,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5915090189177299,"acs":2689,"articleLive":2,"columnArticles":65,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4546,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7685415341927279,"acs":26590,"articleLive":2,"columnArticles":370,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34598,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30969244202968854,"acs":6384,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20614,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4842929945995284,"acs":6367,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13147,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6178225205070843,"acs":1657,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2682,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7074506069983337,"acs":2972,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4201,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7950377562028047,"acs":2211,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2781,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8427782758457981,"acs":53583,"articleLive":2,"columnArticles":725,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63579,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5443438580996541,"acs":7396,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13587,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6170683343502136,"acs":8091,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13112,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6744276964510664,"acs":15526,"articleLive":2,"columnArticles":166,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23021,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7190969652109549,"acs":1943,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2702,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7217524980784013,"acs":15024,"articleLive":2,"columnArticles":233,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20816,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8650386483343594,"acs":12646,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14619,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2907478569317174,"acs":4918,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16915,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5803007191109174,"acs":2663,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4589,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5651290977661735,"acs":1948,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3447,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692405927147172,"acs":128645,"articleLive":2,"columnArticles":1288,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147997,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5141901479829718,"acs":10146,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19732,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5865730368808479,"acs":31157,"articleLive":2,"columnArticles":405,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53117,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30025899794587835,"acs":3362,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11197,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8079673135852911,"acs":791,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":979,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6603379202229577,"acs":3791,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5741,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8584398157662504,"acs":71011,"articleLive":2,"columnArticles":682,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82721,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3105547492339945,"acs":7703,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24804,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2372220054623488,"acs":7296,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30756,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6909961112772959,"acs":11550,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16715,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8565279770444764,"acs":1194,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1394,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6715854726770433,"acs":19934,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29682,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.661967665615142,"acs":6715,"articleLive":2,"columnArticles":80,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10144,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5674214755295837,"acs":7768,"articleLive":2,"columnArticles":147,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13690,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3697976640894884,"acs":2248,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6079,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5430527036276523,"acs":3967,"articleLive":2,"columnArticles":38,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7305,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5371949426639224,"acs":10962,"articleLive":2,"columnArticles":166,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20406,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.390720104878734,"acs":8345,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21358,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3346557460967494,"acs":5230,"articleLive":2,"columnArticles":66,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15628,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3750346356331394,"acs":2707,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7218,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30225330225330227,"acs":778,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2574,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5901333715760791,"acs":4115,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6973,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7168381006058898,"acs":25437,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35485,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5130820931349016,"acs":8550,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16664,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5948972246660802,"acs":7438,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12503,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36299637003629964,"acs":3300,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9091,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8410404624277457,"acs":582,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":692,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5900692840646651,"acs":9709,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16454,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5527583386349177,"acs":6082,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11003,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.547460669411889,"acs":5185,"articleLive":2,"columnArticles":77,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9471,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5766919850357103,"acs":5087,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8821,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6784383606026243,"acs":4188,"articleLive":2,"columnArticles":60,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6173,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488540131217666,"acs":58739,"articleLive":2,"columnArticles":745,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69198,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3799910735743468,"acs":11068,"articleLive":2,"columnArticles":149,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29127,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3234220563507362,"acs":7886,"articleLive":2,"columnArticles":137,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24383,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34284780477176163,"acs":3147,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9179,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7325234441602728,"acs":3437,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4692,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6744601396330573,"acs":24924,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36954,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29778617710583155,"acs":5515,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18520,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33280360217189775,"acs":2513,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7551,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3968158606188045,"acs":2642,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6658,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7090909090909091,"acs":741,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1045,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5775428868480332,"acs":9999,"articleLive":2,"columnArticles":171,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17313,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42802056555269924,"acs":4995,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11670,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6623790273183878,"acs":5407,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8163,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6161635832521909,"acs":3164,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5135,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5032176832680471,"acs":3597,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7148,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.785143246572829,"acs":29954,"articleLive":2,"columnArticles":359,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38151,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6908032596041909,"acs":8901,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12885,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5675040783034258,"acs":8697,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15325,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32838224767358626,"acs":1835,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5588,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6152615946995659,"acs":2693,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4377,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6189473684210526,"acs":294,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":475,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7892995035852178,"acs":17172,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21756,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4532223820286282,"acs":13235,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29202,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44044172831564277,"acs":4108,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9327,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36686925098554535,"acs":4467,"articleLive":2,"columnArticles":89,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12176,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5990566037735849,"acs":127,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":212,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5391318591318591,"acs":16457,"articleLive":2,"columnArticles":248,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30525,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.317685518143184,"acs":4859,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15295,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4613599443026224,"acs":5964,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12927,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.385099846390169,"acs":2507,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6510,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5514981273408239,"acs":2945,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5340,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5463931756066588,"acs":19792,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36223,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5540201005025126,"acs":7497,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13532,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41419406575781875,"acs":5165,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12470,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5369269388294359,"acs":4064,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7569,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7119675456389453,"acs":351,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":493,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6635287789133943,"acs":2467,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3718,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6593093186186373,"acs":21268,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32258,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8170020414114902,"acs":11206,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13716,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.511037651277454,"acs":9121,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17848,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.295785411333155,"acs":7741,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26171,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7107001321003963,"acs":538,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":757,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4382217090069284,"acs":3036,"articleLive":2,"columnArticles":57,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6928,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5788745141883618,"acs":10873,"articleLive":2,"columnArticles":166,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18783,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7684589908435613,"acs":7889,"articleLive":2,"columnArticles":107,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10266,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6227203118474175,"acs":4473,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7183,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3662845725102534,"acs":3483,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9509,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.574571314635119,"acs":8645,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15046,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7799007776883883,"acs":11633,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14916,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30958105646630235,"acs":4249,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13725,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3784814956123617,"acs":3968,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10484,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5449299258037923,"acs":661,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1213,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7234420048791306,"acs":3262,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4509,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4458279339681109,"acs":7913,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17749,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3990405582206716,"acs":12810,"articleLive":2,"columnArticles":205,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":32102,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45588235294117646,"acs":2573,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5644,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4737327188940092,"acs":2056,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4340,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8984247691472026,"acs":1654,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1841,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7587816807469987,"acs":3413,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4498,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048235442931231,"acs":19088,"articleLive":2,"columnArticles":322,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23717,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2951296982530439,"acs":4460,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15112,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3264496717724289,"acs":4774,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14624,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5956454121306376,"acs":4213,"articleLive":2,"columnArticles":68,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7073,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4763153711651566,"acs":17979,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37746,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3251763808555266,"acs":5116,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15733,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5826114854026307,"acs":10896,"articleLive":2,"columnArticles":203,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18702,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6190476190476191,"acs":16107,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26019,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.632420091324201,"acs":277,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":438,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8076388888888889,"acs":3489,"articleLive":2,"columnArticles":46,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4320,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6706569959861981,"acs":9524,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14201,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853021070405991,"acs":18669,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27242,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6641952661214299,"acs":26069,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39249,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299638989169675,"acs":2382,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5540,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6266233766233766,"acs":386,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":616,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8256312529776084,"acs":3466,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4198,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8389209209973653,"acs":43941,"articleLive":2,"columnArticles":700,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52378,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29370042708968885,"acs":3851,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13112,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2686358279316441,"acs":3647,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13576,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5786458333333333,"acs":1111,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1920,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4449623108349157,"acs":7733,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17379,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5312036396004352,"acs":5371,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10111,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31355805243445695,"acs":4186,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13350,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46505905511811024,"acs":1890,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4064,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7496159754224271,"acs":2440,"articleLive":2,"columnArticles":42,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3255,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628959276018099,"acs":293,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":442,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6723759600146288,"acs":11031,"articleLive":2,"columnArticles":150,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16406,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41927789222595685,"acs":3867,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9223,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6788585209003215,"acs":16890,"articleLive":2,"columnArticles":207,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24880,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48988309352517984,"acs":2179,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4448,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7837837837837838,"acs":696,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":888,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443934911242603,"acs":57081,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67600,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41505684954189204,"acs":3760,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9059,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7362660944206009,"acs":3431,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4660,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34145828955662955,"acs":1625,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4759,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5455063651909557,"acs":2871,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5263,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6398671961460842,"acs":9829,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15361,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5120233352305066,"acs":7197,"articleLive":2,"columnArticles":125,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14056,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27038479157123224,"acs":2361,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8732,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.610011641443539,"acs":2096,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3436,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7355371900826446,"acs":445,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":605,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7221025420077553,"acs":1676,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2321,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8213366985390477,"acs":16922,"articleLive":2,"columnArticles":286,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20603,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4971119806223216,"acs":5336,"articleLive":2,"columnArticles":64,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10734,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2755706760316067,"acs":5022,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18224,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6214310891787099,"acs":1763,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2837,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5925925925925926,"acs":320,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":540,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6740619008490825,"acs":7383,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10953,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3713985594237695,"acs":2475,"articleLive":2,"columnArticles":43,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6664,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4410891089108911,"acs":1782,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4040,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14971546192032933,"acs":2473,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16518,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7831545309290117,"acs":3431,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4381,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6257434386424401,"acs":11468,"articleLive":2,"columnArticles":197,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18327,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.543205317577548,"acs":2942,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5416,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3865513173417224,"acs":3932,"articleLive":2,"columnArticles":85,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10172,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3810487007935273,"acs":2449,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6427,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8430962343096234,"acs":403,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":478,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5244399824308213,"acs":8358,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15937,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7681653746770026,"acs":7432,"articleLive":2,"columnArticles":116,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9675,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4932518906340896,"acs":25437,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51570,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3188028627195836,"acs":1470,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4611,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6569431051108968,"acs":2725,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4148,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5252403846153846,"acs":437,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":832,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5482209737827716,"acs":1171,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2136,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7065589058128692,"acs":9092,"articleLive":2,"columnArticles":178,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12868,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8067138341110944,"acs":5359,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6643,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7120141342756183,"acs":2821,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3962,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40182218033301914,"acs":1279,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3183,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.65920281967553,"acs":12718,"articleLive":2,"columnArticles":217,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19293,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7709354900337515,"acs":12106,"articleLive":2,"columnArticles":278,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15703,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4511779831815971,"acs":6492,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14389,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4518,"acs":2259,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5000,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5462469733656174,"acs":1128,"articleLive":2,"columnArticles":23,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2065,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.409903011740684,"acs":803,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1959,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5366407412520902,"acs":34982,"articleLive":2,"columnArticles":357,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65187,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5148438050913193,"acs":7301,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14181,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27795960724834357,"acs":3482,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12527,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.474036850921273,"acs":2547,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5373,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.791641057160418,"acs":1288,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1627,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6837837837837838,"acs":759,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1110,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6564641817669702,"acs":6992,"articleLive":2,"columnArticles":177,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10651,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5060933862796111,"acs":3696,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7303,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2739563567362429,"acs":3465,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12648,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38295044617429275,"acs":2017,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5267,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7813990461049285,"acs":7864,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10064,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4649449618966977,"acs":5491,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11810,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29990259631209487,"acs":8929,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29773,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4125230202578269,"acs":1344,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3258,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7381818181818182,"acs":406,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":550,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7254571026722926,"acs":2579,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3555,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8122257053291536,"acs":20728,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25520,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5724957047882274,"acs":7664,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13387,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5452438532849657,"acs":5411,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9924,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.663594470046083,"acs":5184,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7812,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6034720308624966,"acs":2190,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3629,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44414257067080665,"acs":6866,"articleLive":2,"columnArticles":129,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15459,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.758202987180995,"acs":12894,"articleLive":2,"columnArticles":237,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":17006,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5269424327973488,"acs":4293,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8147,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46809480401093895,"acs":2054,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4388,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8509415262636274,"acs":38637,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45405,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.354311152764761,"acs":7561,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21340,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3642950297058397,"acs":2514,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6901,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43481149310745726,"acs":2618,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6021,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7643253234750462,"acs":827,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1082,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3892423366107577,"acs":2019,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5187,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8301259206462342,"acs":17470,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21045,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4974237870330614,"acs":6951,"articleLive":2,"columnArticles":113,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13974,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.464515575388312,"acs":5413,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11653,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.384379042690815,"acs":2377,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6184,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5229067930489731,"acs":331,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":633,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8961172537927488,"acs":3485,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3889,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8282217563021113,"acs":16986,"articleLive":2,"columnArticles":356,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20509,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.599838056680162,"acs":3704,"articleLive":2,"columnArticles":86,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6175,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4714158504007124,"acs":2647,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5615,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4020964360587002,"acs":959,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2385,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8053322561098768,"acs":19936,"articleLive":2,"columnArticles":267,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24755,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8670725220166676,"acs":14670,"articleLive":2,"columnArticles":192,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16919,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5175771971496437,"acs":4358,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8420,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4883256834963081,"acs":2447,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5011,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6523297491039427,"acs":182,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":279,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.7986647926914968,"acs":2273,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2846,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6353162281418533,"acs":7775,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12238,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.46223765888264856,"acs":6255,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13532,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3979020979020979,"acs":6259,"articleLive":2,"columnArticles":112,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15730,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5262140613674801,"acs":2178,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4139,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5233853006681515,"acs":470,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":898,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7980383415069104,"acs":1790,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2243,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7087809642191246,"acs":7983,"articleLive":2,"columnArticles":182,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11263,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6099468251485768,"acs":3900,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6394,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47805035506778565,"acs":2962,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6196,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38316357100059917,"acs":1279,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3338,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7814888560601194,"acs":12167,"articleLive":2,"columnArticles":185,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15569,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34686592449177156,"acs":5733,"articleLive":2,"columnArticles":121,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16528,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5854353132628153,"acs":4317,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7374,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5030864197530864,"acs":14181,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28188,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6994780014914244,"acs":938,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1341,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.703307392996109,"acs":1446,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2056,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6944028733912002,"acs":11600,"articleLive":2,"columnArticles":185,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16705,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35913065260696864,"acs":30107,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83833,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2626053035647591,"acs":6328,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24097,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4960547580568495,"acs":15654,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31557,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.638961038961039,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":385,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7310286677908938,"acs":1734,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2372,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6747320558622929,"acs":8310,"articleLive":2,"columnArticles":194,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12316,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4321716873400276,"acs":2195,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5079,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4908909408535064,"acs":1967,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4007,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3700234192037471,"acs":632,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1708,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8692263117557993,"acs":46501,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53497,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6449115702971476,"acs":10830,"articleLive":2,"columnArticles":167,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16793,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5153160981968281,"acs":4744,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9206,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5064892644048604,"acs":23259,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45922,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5629139072847682,"acs":340,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":604,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7879165140974003,"acs":10759,"articleLive":2,"columnArticles":146,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13655,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.48051046097751543,"acs":5535,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11519,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5753768844221105,"acs":3435,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5970,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3580167417900837,"acs":1112,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3106,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6221198156682027,"acs":2160,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3472,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5325803649000869,"acs":613,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1151,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4714506172839506,"acs":1833,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3888,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.791970802919708,"acs":11935,"articleLive":2,"columnArticles":205,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15070,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45926724137931035,"acs":2131,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4640,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232766199513885,"acs":27972,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38674,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48887837198296263,"acs":1033,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2113,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491659985222217,"acs":28571,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63609,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31078988125967993,"acs":3612,"articleLive":2,"columnArticles":104,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11622,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539371797523035,"acs":28460,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43521,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4709778629945965,"acs":2702,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5737,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7019464720194647,"acs":577,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":822,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8416123778501629,"acs":2067,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2456,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7084657855111259,"acs":8469,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11954,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6968546806458638,"acs":22399,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32143,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3627814009507092,"acs":28314,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78047,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4853256979241231,"acs":3390,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6985,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5948158253751705,"acs":872,"articleLive":2,"columnArticles":37,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1466,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7027027027027027,"acs":1326,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1887,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7477477477477478,"acs":11205,"articleLive":2,"columnArticles":223,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14985,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5309493034611518,"acs":3697,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6963,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45678321678321676,"acs":3266,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7150,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4707269997855458,"acs":2195,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4663,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6804123711340206,"acs":9504,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13968,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6295559279430247,"acs":6011,"articleLive":2,"columnArticles":128,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9548,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4221688675470188,"acs":4220,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9996,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4110462749355408,"acs":3029,"articleLive":2,"columnArticles":51,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7369,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7954070981210856,"acs":381,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":479,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9208546494131808,"acs":3060,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3323,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6381392045454546,"acs":7188,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11264,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4293296089385475,"acs":4611,"articleLive":2,"columnArticles":96,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10740,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5395414734672849,"acs":4189,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7764,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4303231151615576,"acs":2597,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6035,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6913827655310621,"acs":690,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":998,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6093796378747403,"acs":4106,"articleLive":2,"columnArticles":81,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6738,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4757916241062308,"acs":2329,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4895,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5516300227445035,"acs":3638,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6595,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37593383137673425,"acs":1409,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3748,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7900188323917138,"acs":839,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1062,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7656291744589901,"acs":11463,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14972,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8564406779661017,"acs":10106,"articleLive":2,"columnArticles":171,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11800,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3703471163333034,"acs":4129,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11149,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3654297792390794,"acs":2334,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6387,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5194029850746269,"acs":348,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":670,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8427643298753013,"acs":16085,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19086,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5511760382212422,"acs":5999,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10884,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47424393486208044,"acs":4281,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9027,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46121811556481,"acs":1772,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3842,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7821567778258987,"acs":5418,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6927,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5186246418338109,"acs":181,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":349,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.648013167176111,"acs":5512,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8506,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6652137062598378,"acs":5494,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8259,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5196152872690458,"acs":4106,"articleLive":2,"columnArticles":61,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7902,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2922740524781341,"acs":1203,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4116,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7980132450331126,"acs":1205,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1510,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42127355115668974,"acs":8832,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20965,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35005464480874315,"acs":6406,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18300,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3420260782347041,"acs":3410,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9970,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541386776217176,"acs":11783,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18013,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7169230769230769,"acs":233,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":325,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7114769090077732,"acs":1556,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2187,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6444116924588553,"acs":13117,"articleLive":2,"columnArticles":144,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20355,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8088472715531159,"acs":10020,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12388,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.513753603989714,"acs":6593,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12833,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41449952234370024,"acs":3905,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9421,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5777027027027027,"acs":171,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":296,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7855939342881213,"acs":1865,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2374,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48813459701711853,"acs":6644,"articleLive":2,"columnArticles":122,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13611,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5744437380801017,"acs":4518,"articleLive":2,"columnArticles":72,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7865,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.521680216802168,"acs":3080,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5904,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5186000440237728,"acs":2356,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4543,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6833636490835315,"acs":9768,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14294,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3791083035796027,"acs":4141,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10923,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2627728097054593,"acs":4202,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15991,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4091259145167501,"acs":2125,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5194,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.57125,"acs":457,"articleLive":2,"columnArticles":27,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":800,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48783952477293274,"acs":11333,"articleLive":2,"columnArticles":148,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23231,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6623193964966116,"acs":5180,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7821,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5861821903787103,"acs":5727,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9770,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2679609520675661,"acs":2443,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9117,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6261376046596286,"acs":1720,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2747,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6216216216216216,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":296,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.662557781201849,"acs":860,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1298,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7941118550610476,"acs":8065,"articleLive":2,"columnArticles":190,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10156,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5134231393904652,"acs":5374,"articleLive":2,"columnArticles":74,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10467,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3456216739235607,"acs":3572,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10335,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2990353697749196,"acs":1674,"articleLive":2,"columnArticles":39,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5598,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7525102940114137,"acs":10417,"articleLive":2,"columnArticles":156,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13843,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6984256559766764,"acs":5989,"articleLive":2,"columnArticles":97,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8575,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3735081453088248,"acs":25725,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68874,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.368220136790202,"acs":2315,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6287,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5048543689320388,"acs":104,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":206,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9020109689213894,"acs":2467,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2735,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8096608177655307,"acs":19980,"articleLive":2,"columnArticles":199,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24677,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7152144545761567,"acs":8471,"articleLive":2,"columnArticles":105,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11844,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6555189595473355,"acs":7762,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11841,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28574518710793856,"acs":2642,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9246,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4386252045826514,"acs":268,"articleLive":2,"columnArticles":21,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":611,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7936653852582316,"acs":9497,"articleLive":2,"columnArticles":139,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11966,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8673606447280053,"acs":7749,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8934,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6827219746314707,"acs":3983,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5834,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4878048780487805,"acs":860,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1763,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7404643449419569,"acs":893,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1206,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8244350021553051,"acs":13388,"articleLive":2,"columnArticles":213,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16239,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6844986900522411,"acs":43632,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63743,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3540628260113597,"acs":6109,"articleLive":2,"columnArticles":131,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17254,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5097073719752392,"acs":3623,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7108,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7081911262798635,"acs":415,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":586,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7954941116231439,"acs":7768,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9765,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4292284184135179,"acs":28933,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67407,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5743874493213468,"acs":6517,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11346,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3890318748762621,"acs":1965,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5051,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5144444444444445,"acs":926,"articleLive":2,"columnArticles":29,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1800,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6555555555555556,"acs":118,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":180,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5087440381558028,"acs":640,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1258,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8001392757660167,"acs":6894,"articleLive":2,"columnArticles":113,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8616,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5342185066797803,"acs":6518,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12201,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336453757158957,"acs":27549,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43477,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3592740695170717,"acs":2336,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6502,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.682890336208414,"acs":7759,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11362,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3282393582762457,"acs":5606,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17079,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6099744245524297,"acs":2385,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3910,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4010458567980692,"acs":1994,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4972,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6967509025270758,"acs":193,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":277,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6445264452644527,"acs":1048,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1626,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7888873886038348,"acs":11685,"articleLive":2,"columnArticles":121,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14812,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.680376256892637,"acs":10488,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15415,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35611510791366907,"acs":4455,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12510,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4513715710723192,"acs":2172,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4812,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.634508348794063,"acs":342,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":539,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7667223149693935,"acs":6889,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8985,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7719869706840391,"acs":4029,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5219,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6188440810258317,"acs":3330,"articleLive":2,"columnArticles":68,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5381,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31274292059966685,"acs":2253,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7204,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9048672566371682,"acs":12679,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14012,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38741048536822564,"acs":4382,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11311,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5128626692456479,"acs":5303,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10340,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5972558514931396,"acs":2220,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3717,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7426470588235294,"acs":505,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":680,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5423728813559322,"acs":160,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":295,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7879876160990712,"acs":12726,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16150,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4556586045947748,"acs":7517,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16497,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.276346171608017,"acs":5984,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21654,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6212492345376608,"acs":2029,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3266,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8128155339805825,"acs":2093,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2575,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.893491124260355,"acs":302,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":338,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7468354430379747,"acs":413,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":553,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7278617710583153,"acs":6066,"articleLive":2,"columnArticles":94,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8334,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8202869501002216,"acs":31102,"articleLive":2,"columnArticles":401,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37916,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.429171668667467,"acs":2145,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4998,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4104592397275324,"acs":1868,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4551,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7711231056674278,"acs":7429,"articleLive":2,"columnArticles":100,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9634,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35329236172080775,"acs":6036,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17085,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2782893234913629,"acs":3657,"articleLive":2,"columnArticles":110,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13141,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3757562662057044,"acs":1739,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4628,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6901358112937813,"acs":1931,"articleLive":2,"columnArticles":38,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2798,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5210970464135021,"acs":247,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":474,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.571443736730361,"acs":5383,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9420,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.645762498425891,"acs":5128,"articleLive":2,"columnArticles":64,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7941,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3170592270752344,"acs":2773,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8746,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2706969580284944,"acs":2109,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7791,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7080561714708056,"acs":958,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1353,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.46895424836601307,"acs":287,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":612,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.337707182320442,"acs":489,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1448,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5912441703023921,"acs":31440,"articleLive":2,"columnArticles":410,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53176,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45813841539429995,"acs":37117,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81017,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5307435039876511,"acs":2063,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3887,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5056784219964137,"acs":846,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1673,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5311234817813765,"acs":6297,"articleLive":2,"columnArticles":79,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11856,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.31020594270081314,"acs":4082,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13159,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6296108291032149,"acs":3721,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5910,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43667362560890743,"acs":1255,"articleLive":2,"columnArticles":36,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2874,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6586206896551724,"acs":764,"articleLive":2,"columnArticles":27,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1160,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4519774011299435,"acs":80,"articleLive":2,"columnArticles":4,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":177,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6431198152740956,"acs":7520,"articleLive":2,"columnArticles":102,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11693,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.28162638428582976,"acs":3484,"articleLive":2,"columnArticles":71,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12371,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5709292515367,"acs":4737,"articleLive":2,"columnArticles":94,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8297,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4242527173913043,"acs":2498,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5888,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5903030303030303,"acs":487,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":825,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6693227091633466,"acs":168,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":251,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32531627971639093,"acs":4680,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14386,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6756657483930211,"acs":3679,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5445,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5687129403557726,"acs":3261,"articleLive":2,"columnArticles":70,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5734,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.26933907569985094,"acs":1626,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6037,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8362913096695227,"acs":8199,"articleLive":2,"columnArticles":84,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9804,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4411524870888828,"acs":3246,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7358,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3918956043956044,"acs":2853,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7280,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5525821596244131,"acs":1177,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2130,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2831505483549352,"acs":284,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":1003,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4944649446494465,"acs":134,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":271,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3910939012584705,"acs":404,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1033,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9149668646182976,"acs":10631,"articleLive":2,"columnArticles":92,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11619,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3441947565543071,"acs":5514,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16020,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36118913857677903,"acs":4629,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12816,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23709369024856597,"acs":1488,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6276,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38650306748466257,"acs":63,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":163,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6937210648148148,"acs":4795,"articleLive":2,"columnArticles":60,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6912,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3444253203289348,"acs":3602,"articleLive":2,"columnArticles":62,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10458,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4129684985054035,"acs":1796,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4349,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3965303593556382,"acs":2240,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5649,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9137943759687062,"acs":12381,"articleLive":2,"columnArticles":107,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13549,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4795316565481353,"acs":5529,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11530,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5599015317286652,"acs":2047,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3656,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3271252628416942,"acs":1089,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3329,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.541871921182266,"acs":440,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":812,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7376623376623377,"acs":284,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":385,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7394165387146304,"acs":6742,"articleLive":2,"columnArticles":94,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9118,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45008812690273997,"acs":5618,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12482,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2422565521481823,"acs":3152,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13011,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34537177541729897,"acs":1138,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3295,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6239193083573487,"acs":433,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":694,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7958333333333333,"acs":382,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":480,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7725521669341894,"acs":4813,"articleLive":2,"columnArticles":85,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6230,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39255915743400355,"acs":2870,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7311,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40765570934256057,"acs":1885,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4624,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5771028037383178,"acs":1976,"articleLive":2,"columnArticles":54,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3424,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6644030002027164,"acs":6555,"articleLive":2,"columnArticles":76,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9866,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30427340674388087,"acs":5333,"articleLive":2,"columnArticles":81,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17527,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.541616079859706,"acs":4015,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7413,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5149572649572649,"acs":964,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1872,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5340659340659341,"acs":243,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":455,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5541666666666667,"acs":133,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":240,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6703056768558951,"acs":307,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":458,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5463115720009427,"acs":6954,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12729,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3253445635528331,"acs":4249,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13060,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4806847096923433,"acs":4156,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8646,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49617737003058104,"acs":2596,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5232,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.46060606060606063,"acs":152,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":330,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6055256064690027,"acs":4493,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7420,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42351346772827375,"acs":2500,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5903,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41374474053295934,"acs":1475,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3565,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27860026917900405,"acs":621,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2229,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5345278375884344,"acs":6951,"articleLive":2,"columnArticles":64,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13004,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.430845309843919,"acs":5576,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12942,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6152455139796912,"acs":4423,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7189,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38420085731781994,"acs":3137,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8165,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7370600414078675,"acs":356,"articleLive":2,"columnArticles":13,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":483,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7241379310344828,"acs":42,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":58,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7785320865889587,"acs":6078,"articleLive":2,"columnArticles":57,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7807,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35821010474430065,"acs":4651,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12984,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2789050535987749,"acs":2914,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10448,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47892220773576705,"acs":2204,"articleLive":2,"columnArticles":50,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4602,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5453551912568306,"acs":499,"articleLive":2,"columnArticles":19,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":915,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.456575682382134,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":403,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7403628117913832,"acs":3918,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5292,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38170055452865065,"acs":2891,"articleLive":2,"columnArticles":46,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7574,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28936170212765955,"acs":1972,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6815,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2471495640509725,"acs":737,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2982,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5282258064516129,"acs":262,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":496,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8124863804750491,"acs":7457,"articleLive":2,"columnArticles":87,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9178,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5813349320543565,"acs":5818,"articleLive":2,"columnArticles":93,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10008,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.298360438979241,"acs":4513,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15126,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4576837416481069,"acs":822,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1796,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6578947368421053,"acs":50,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":76,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5805020667405989,"acs":5758,"articleLive":2,"columnArticles":64,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9919,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4126567512394284,"acs":5660,"articleLive":2,"columnArticles":80,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13716,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2757636531934588,"acs":3575,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12964,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.46116187989556134,"acs":1413,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3064,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6738351254480287,"acs":188,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":279,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.45555555555555555,"acs":41,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":90,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6050955414012739,"acs":190,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":314,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6597530082330589,"acs":4167,"articleLive":2,"columnArticles":57,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6316,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5945561649400772,"acs":2927,"articleLive":2,"columnArticles":56,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4923,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3851915257864327,"acs":1800,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4673,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.36402052520374284,"acs":1206,"articleLive":2,"columnArticles":36,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3313,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5517412441710488,"acs":5561,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10079,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24703087885985747,"acs":4784,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19366,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34092758340113916,"acs":2095,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6145,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.41985926505082094,"acs":1611,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3837,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6666666666666666,"acs":58,"articleLive":2,"columnArticles":6,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":87,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.777067843866171,"acs":6689,"articleLive":2,"columnArticles":85,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8608,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3586337760910816,"acs":5670,"articleLive":2,"columnArticles":124,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15810,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5714285714285714,"acs":3504,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6132,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39154988496130516,"acs":1872,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4781,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.40707964601769914,"acs":92,"articleLive":2,"columnArticles":4,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":226,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6744186046511628,"acs":29,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":43,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8830297219558965,"acs":3684,"articleLive":2,"columnArticles":50,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4172,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.2963207755012117,"acs":2690,"articleLive":2,"columnArticles":50,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":9078,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.419446704637917,"acs":2062,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4916,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41490722968650035,"acs":1297,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3126,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.62,"acs":62,"articleLive":2,"columnArticles":3,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":100,"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.905045351473923,"acs":6386,"articleLive":2,"columnArticles":54,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":7056,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3558234324863412,"acs":4103,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11531,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32779983158907733,"acs":2725,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8313,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5185185185185185,"acs":1386,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2673,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8780487804878049,"acs":36,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":41,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5533480500367918,"acs":5264,"articleLive":2,"columnArticles":67,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9513,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.346497461928934,"acs":3413,"articleLive":2,"columnArticles":93,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9850,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41141732283464566,"acs":1881,"articleLive":2,"columnArticles":48,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4572,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34438430311231394,"acs":1018,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2956,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8222222222222222,"acs":111,"articleLive":2,"columnArticles":4,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":135,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.7758620689655172,"acs":45,"articleLive":2,"columnArticles":5,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":58,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6573809523809524,"acs":2761,"articleLive":2,"columnArticles":33,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4200,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7554252199413489,"acs":2576,"articleLive":2,"columnArticles":36,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3410,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4757126567844926,"acs":2086,"articleLive":2,"columnArticles":53,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4385,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.25678160919540227,"acs":1117,"articleLive":2,"columnArticles":37,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4350,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9127906976744186,"acs":157,"articleLive":2,"columnArticles":8,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":172,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5497953615279673,"acs":4030,"articleLive":2,"columnArticles":42,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7330,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4217307034545662,"acs":3699,"articleLive":2,"columnArticles":53,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":8771,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.21831385453307614,"acs":1924,"articleLive":2,"columnArticles":66,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8813,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3389175257731959,"acs":1052,"articleLive":2,"columnArticles":38,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3104,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.625,"acs":15,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":24,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6651105313744337,"acs":4844,"articleLive":2,"columnArticles":78,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":7283,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.37601603384923726,"acs":3377,"articleLive":2,"columnArticles":68,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":8981,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.29680205415499533,"acs":2543,"articleLive":2,"columnArticles":58,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":8568,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.2818627450980392,"acs":1265,"articleLive":2,"columnArticles":39,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":4488,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.8451152533910293,"acs":81246,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96136,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6909734513274336,"acs":13664,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19775,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.2194882276640069,"acs":11168,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50882,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3773310023310023,"acs":2590,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6864,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.1998444033842264,"acs":2055,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10283,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8398249284932716,"acs":43749,"articleLive":2,"columnArticles":659,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52093,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7692413603194272,"acs":39109,"articleLive":2,"columnArticles":470,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50841,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2884462603563727,"acs":5083,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17622,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27548117154811713,"acs":6584,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23900,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5894839973873286,"acs":1805,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3062,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6896827779445612,"acs":6892,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9993,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41096418025420467,"acs":6402,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15578,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6120639440812893,"acs":9457,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15451,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21079492731209404,"acs":2726,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12932,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5748824714573539,"acs":856,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1489,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3113496932515337,"acs":609,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1956,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7990483903624216,"acs":23679,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29634,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2865099516749939,"acs":17490,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":61045,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163347240809257,"acs":19677,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38109,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3124123422159888,"acs":1782,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5704,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3356788079470199,"acs":811,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2416,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3334697522137064,"acs":8963,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26878,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33835845896147404,"acs":2626,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7761,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28201970443349755,"acs":916,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3248,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33238231098430815,"acs":1165,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3505,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3355501813784764,"acs":555,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1654,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3287779237844941,"acs":1251,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3805,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2822718500137855,"acs":10238,"articleLive":2,"columnArticles":174,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36270,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18679543201263174,"acs":5087,"articleLive":2,"columnArticles":123,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27233,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3494553376906318,"acs":5614,"articleLive":2,"columnArticles":97,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16065,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2526716439759918,"acs":1726,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6831,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40534262485482,"acs":1047,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2583,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21716783552694782,"acs":4521,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20818,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.48399752219698533,"acs":2344,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4843,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39807162534435264,"acs":1156,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2904,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26242813662495773,"acs":776,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2957,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19290354822588707,"acs":772,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4002,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5612366230677764,"acs":472,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":841,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5046942060085837,"acs":3763,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7456,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23168414966548279,"acs":2805,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12107,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.41674780915287246,"acs":1284,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3081,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.1994140625,"acs":1021,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5120,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3971486761710794,"acs":390,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":982,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8514660493827161,"acs":2207,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2592,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.1861692447679709,"acs":1023,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5495,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3668407310704961,"acs":843,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2298,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3532633500684619,"acs":774,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2191,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15146396396396397,"acs":269,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1776,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22322899505766064,"acs":271,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1214,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5446498307732361,"acs":4184,"articleLive":2,"columnArticles":96,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7682,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6971300630979035,"acs":3425,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4913,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.413330078125,"acs":1693,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4096,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6782200955971796,"acs":403113,"articleLive":2,"columnArticles":2798,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":594369,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40336188584618454,"acs":262998,"articleLive":2,"columnArticles":2095,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":652015,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7608648677137135,"acs":288733,"articleLive":2,"columnArticles":1950,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":379480,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.751388786198398,"acs":304876,"articleLive":2,"columnArticles":2092,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":405750,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6979064568351266,"acs":190116,"articleLive":2,"columnArticles":1454,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":272409,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7154602828576426,"acs":265840,"articleLive":2,"columnArticles":1682,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":371565,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.36008279703845547,"acs":264766,"articleLive":2,"columnArticles":1862,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":735292,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44385177691110816,"acs":196546,"articleLive":2,"columnArticles":1321,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":442819,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49308602168658006,"acs":263339,"articleLive":2,"columnArticles":1636,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":534063,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.452255229000996,"acs":171639,"articleLive":2,"columnArticles":1145,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":379518,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.526716066334442,"acs":177990,"articleLive":2,"columnArticles":1716,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":337924,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5692311557247909,"acs":158610,"articleLive":2,"columnArticles":1316,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":278639,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3120014334081144,"acs":83583,"articleLive":2,"columnArticles":492,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":267893,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7472783157863286,"acs":200089,"articleLive":2,"columnArticles":1255,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":267757,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3398786887480406,"acs":124676,"articleLive":2,"columnArticles":760,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":366825,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7772915197166202,"acs":150971,"articleLive":2,"columnArticles":1132,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":194227,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5968167260177959,"acs":189885,"articleLive":2,"columnArticles":1462,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":318163,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3766737178477395,"acs":66953,"articleLive":2,"columnArticles":448,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":177748,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2419770122152008,"acs":77158,"articleLive":2,"columnArticles":859,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":318865,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6431267113119784,"acs":194951,"articleLive":2,"columnArticles":1636,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":303130,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7980899081452643,"acs":262396,"articleLive":2,"columnArticles":2451,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":328780,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.742684215970472,"acs":294377,"articleLive":2,"columnArticles":1831,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":396369,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7284787897277044,"acs":186256,"articleLive":2,"columnArticles":1189,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":255678,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.465608111978918,"acs":146295,"articleLive":2,"columnArticles":1188,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":314202,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7919967098498869,"acs":192574,"articleLive":2,"columnArticles":1413,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":243150,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801626566743866,"acs":150804,"articleLive":2,"columnArticles":1090,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":259934,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44010234587843866,"acs":146033,"articleLive":2,"columnArticles":1484,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":331816,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5682369599630893,"acs":142865,"articleLive":2,"columnArticles":947,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":251418,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6157508441635995,"acs":113425,"articleLive":2,"columnArticles":950,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":184206,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.644524010699431,"acs":138068,"articleLive":2,"columnArticles":961,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":214217,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6866612200978389,"acs":137839,"articleLive":2,"columnArticles":1100,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":200738,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5889032699211214,"acs":120575,"articleLive":2,"columnArticles":1142,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":204745,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5513364600662531,"acs":113674,"articleLive":2,"columnArticles":956,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":206179,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5769044069951759,"acs":134297,"articleLive":2,"columnArticles":872,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":232789,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7200987318678567,"acs":120780,"articleLive":2,"columnArticles":830,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":167727,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6546218277907963,"acs":105038,"articleLive":2,"columnArticles":907,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":160456,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5612128394490772,"acs":77664,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138386,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792118438879739,"acs":158605,"articleLive":2,"columnArticles":1117,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":273829,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6912571767157714,"acs":169161,"articleLive":2,"columnArticles":1027,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":244715,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5703516205359599,"acs":248760,"articleLive":2,"columnArticles":1814,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":436152,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5814266240954377,"acs":63554,"articleLive":2,"columnArticles":461,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":109307,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053909190140272,"acs":222957,"articleLive":2,"columnArticles":1528,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":368286,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4861638312518438,"acs":49438,"articleLive":2,"columnArticles":513,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":101690,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41524944575875256,"acs":55817,"articleLive":2,"columnArticles":465,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":134418,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5612691578245937,"acs":109498,"articleLive":2,"columnArticles":809,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":195090,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5358447417479011,"acs":120437,"articleLive":2,"columnArticles":1446,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":224761,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889644637864946,"acs":119525,"articleLive":2,"columnArticles":999,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":173485,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4645580223663856,"acs":151956,"articleLive":2,"columnArticles":1041,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":327098,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514327006739519,"acs":88346,"articleLive":2,"columnArticles":520,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":135618,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.614742487300935,"acs":154060,"articleLive":2,"columnArticles":1058,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":250609,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48312221357299556,"acs":102405,"articleLive":2,"columnArticles":849,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":211965,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6499188188606532,"acs":175727,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":270383,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5379738453431918,"acs":190921,"articleLive":2,"columnArticles":1593,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":354889,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4471987208674382,"acs":168932,"articleLive":2,"columnArticles":1475,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":377756,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7569251756233818,"acs":163131,"articleLive":2,"columnArticles":1144,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":215518,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7899344030768821,"acs":177864,"articleLive":2,"columnArticles":1272,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":225163,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5882675086746504,"acs":137494,"articleLive":2,"columnArticles":941,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":233727,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.698198470330945,"acs":115570,"articleLive":2,"columnArticles":1033,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":165526,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8002278165811618,"acs":90625,"articleLive":2,"columnArticles":701,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":113249,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6659615688755338,"acs":134748,"articleLive":2,"columnArticles":845,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":202336,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7073234904218825,"acs":139794,"articleLive":2,"columnArticles":1860,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":197638,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44186212208089193,"acs":130234,"articleLive":2,"columnArticles":979,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":294739,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8577488253060851,"acs":206461,"articleLive":2,"columnArticles":1795,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":240701,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4443148648739745,"acs":131822,"articleLive":2,"columnArticles":1192,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":296686,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47514975312664476,"acs":94790,"articleLive":2,"columnArticles":1068,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":199495,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5615940787444745,"acs":65556,"articleLive":2,"columnArticles":592,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":116732,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4597660875774497,"acs":103663,"articleLive":2,"columnArticles":985,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":225469,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6553219510458811,"acs":110465,"articleLive":2,"columnArticles":767,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":168566,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6341106463547754,"acs":131285,"articleLive":2,"columnArticles":955,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":207038,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8567832653415502,"acs":138194,"articleLive":2,"columnArticles":1300,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":161294,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5841598671031416,"acs":71736,"articleLive":2,"columnArticles":497,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":122802,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5977806105772374,"acs":73154,"articleLive":2,"columnArticles":530,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":122376,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.286654997082604,"acs":68780,"articleLive":2,"columnArticles":557,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":239940,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6941599892144737,"acs":118423,"articleLive":2,"columnArticles":692,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":170599,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7006914130195275,"acs":117658,"articleLive":2,"columnArticles":690,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":167917,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20372285418821096,"acs":8471,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":41581,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5736842105263158,"acs":7739,"articleLive":2,"columnArticles":124,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":13490,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7832564164844952,"acs":9674,"articleLive":2,"columnArticles":149,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":12351,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6879860200961119,"acs":7874,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":11445,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7142153239714215,"acs":5798,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":8118,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6658068214388077,"acs":6969,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":10467,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.45483335846780276,"acs":6032,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":13262,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5063152576625126,"acs":6013,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":11876,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.550303848750844,"acs":4890,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":8886,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4360944830933506,"acs":5391,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12362,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5628169830459354,"acs":3884,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6901,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6599167822468793,"acs":4758,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":7210,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6561445304744887,"acs":3305,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":5037,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5053319114902692,"acs":3791,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7502,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6425711275026343,"acs":3049,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4745,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4998935264054514,"acs":4695,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9392,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5174853446533253,"acs":2560,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4947,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5315045519885002,"acs":4437,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8348,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.47520242914979755,"acs":3756,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":7904,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.70662100456621,"acs":3714,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5256,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5365712074303406,"acs":5546,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10336,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5223279058520071,"acs":6480,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":12406,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7029326850022792,"acs":4626,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6581,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7701032887649706,"acs":12153,"articleLive":2,"columnArticles":123,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":15781,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6057425131213338,"acs":3924,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6478,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6499094202898551,"acs":4305,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6624,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6102516309412861,"acs":6548,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":10730,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6261654135338346,"acs":2082,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3325,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29494345508904196,"acs":2269,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":7693,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5479194630872484,"acs":2041,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3725,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5606975184439973,"acs":2508,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4473,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6028996422519299,"acs":3202,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5311,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7975811584977721,"acs":2506,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3142,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.57575,"acs":2303,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":4000,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6838150289017341,"acs":2366,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3460,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.583029197080292,"acs":2556,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4384,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.44094611528822053,"acs":2815,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6384,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7800974251913709,"acs":3363,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4311,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5192216421452301,"acs":2188,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4214,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5707148347425057,"acs":1485,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2602,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.784579317530607,"acs":3012,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3839,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8477601886156956,"acs":2517,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2969,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6549876339653751,"acs":1589,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2426,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6470458065943793,"acs":2924,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4519,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.808634772462077,"acs":2772,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3428,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7247329498767461,"acs":2646,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3651,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6864659614863032,"acs":2531,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3687,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6791823112223613,"acs":1628,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2397,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7539882451721243,"acs":2694,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3573,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6181523500810373,"acs":1907,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":3085,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4136191677175284,"acs":1640,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3965,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7424164524421594,"acs":2888,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3890,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6364932287954383,"acs":2679,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4209,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.850609756097561,"acs":2232,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2624,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8960915157292659,"acs":1880,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":2098,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7326124354878348,"acs":2981,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":4069,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.350820633059789,"acs":1197,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3412,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5968559837728195,"acs":1177,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1972,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.625122030589001,"acs":1921,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":3073,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6725032425421531,"acs":2074,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":3084,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5415218230977211,"acs":1402,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2589,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7640131888836552,"acs":1622,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2123,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7237663074305162,"acs":1276,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1763,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6342482100238663,"acs":1063,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1676,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6239850093691443,"acs":999,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1601,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6462882096069869,"acs":1036,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1603,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.657347670250896,"acs":917,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1395,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5082184016625733,"acs":2690,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5293,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.726027397260274,"acs":2703,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3723,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6711986681465039,"acs":2419,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3604,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5025406504065041,"acs":989,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1968,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42207139265962795,"acs":3358,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":7956,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5392326304873833,"acs":1560,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2893,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5490716180371353,"acs":2277,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4147,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7092916283348666,"acs":2313,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3261,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6740728900255755,"acs":4217,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6256,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5863784792411756,"acs":3771,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6431,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6318063958513397,"acs":2924,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4628,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8534375,"acs":2731,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3200,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8074824629773967,"acs":2072,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2566,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7825983878615458,"acs":3301,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4218,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6429311237700673,"acs":2483,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3862,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.856858846918489,"acs":3017,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3521,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6792029188885771,"acs":2420,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3563,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8569797316585783,"acs":3002,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3503,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7677087455480808,"acs":1940,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2527,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.63776,"acs":1993,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3125,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7409081973658345,"acs":3769,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":5087,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6235710397387044,"acs":2291,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3674,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5192667414889637,"acs":1388,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2673,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7666941467436109,"acs":1860,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2426,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6781395348837209,"acs":1458,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2150,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5753550160329821,"acs":1256,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2183,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5941375422773394,"acs":1054,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1774,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.663514005092761,"acs":5472,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8247,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49953183520599254,"acs":1067,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2136,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.542027194066749,"acs":877,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1618,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7765869744435284,"acs":1884,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2426,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6930016402405687,"acs":2535,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3658,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7341947392708814,"acs":1591,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2167,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48414223930802497,"acs":2015,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4162,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5965153599266392,"acs":1301,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2181,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49596059113300495,"acs":2517,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":5075,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5838709677419355,"acs":1086,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1860,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6973247844351095,"acs":3154,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4523,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5511432009626955,"acs":916,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1662,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5355097365406644,"acs":935,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1746,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.567,"acs":567,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":1000,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6087990487514863,"acs":1024,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1682,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8392955421023666,"acs":1525,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1817,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6952506596306068,"acs":527,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":758,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5572559366754617,"acs":1056,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1895,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5860362836723474,"acs":1066,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1819,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.423407917383821,"acs":492,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1162,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2880228136882129,"acs":606,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2104,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6369404300317236,"acs":3614,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5674,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6295503211991434,"acs":588,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":934,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6981465136804943,"acs":791,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1133,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4601389348329474,"acs":2782,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":6046,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7198311491328737,"acs":89696,"articleLive":2,"columnArticles":1539,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":124607,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6478124543441859,"acs":57643,"articleLive":2,"columnArticles":1108,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":88981,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5792230924378553,"acs":44226,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76354,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510926459936314,"acs":40324,"articleLive":2,"columnArticles":776,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":73171,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3322029718231704,"acs":32328,"articleLive":2,"columnArticles":556,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":97314,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4718681120377412,"acs":73216,"articleLive":2,"columnArticles":1174,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":155162,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.753465027397891,"acs":65452,"articleLive":2,"columnArticles":960,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":86868,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.621398296014043,"acs":43542,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":70071,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5499740459804758,"acs":32845,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":59721,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6827213171278338,"acs":63362,"articleLive":2,"columnArticles":693,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":92808,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800131886577544,"acs":65057,"articleLive":2,"columnArticles":946,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83405,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.854840443961243,"acs":71551,"articleLive":2,"columnArticles":684,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83701,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6551008765105545,"acs":25262,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38562,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46686430263641315,"acs":36851,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78933,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4834020287780438,"acs":39172,"articleLive":2,"columnArticles":506,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":81034,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.684736722003537,"acs":48011,"articleLive":2,"columnArticles":431,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":70116,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5320635416260099,"acs":27264,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51242,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5377690802348336,"acs":10992,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20440,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6137307482379744,"acs":25862,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42139,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.386751639763688,"acs":8314,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21497,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7124420307542104,"acs":23351,"articleLive":2,"columnArticles":343,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32776,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5431658725096612,"acs":14477,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26653,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5876996892208712,"acs":10779,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18341,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5317632850241546,"acs":17612,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33120,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7900808699227853,"acs":34585,"articleLive":2,"columnArticles":421,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43774,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8062044163613753,"acs":23987,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29753,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5844567101864628,"acs":33037,"articleLive":2,"columnArticles":384,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56526,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3516223944304007,"acs":25455,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72393,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5904627506320926,"acs":20084,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":34014,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168309162112149,"acs":16657,"articleLive":2,"columnArticles":176,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23237,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47645627594103335,"acs":6658,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13974,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7170111287758346,"acs":16236,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22644,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4863079941418663,"acs":17599,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36189,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.505167889466074,"acs":9433,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18673,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6903480444922856,"acs":7696,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11148,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38675510859099177,"acs":10845,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":28041,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3864168618266979,"acs":5280,"articleLive":2,"columnArticles":137,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13664,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.527117031398668,"acs":11634,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22071,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7040197897340754,"acs":11384,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16170,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5529522024367385,"acs":3540,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6402,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36326384874349643,"acs":42730,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117628,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3609730270317969,"acs":12272,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33997,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.675830395128869,"acs":51945,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76861,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8200438630845147,"acs":20939,"articleLive":2,"columnArticles":330,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25534,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6792228514219566,"acs":21710,"articleLive":2,"columnArticles":483,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31963,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6565939344037327,"acs":23923,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36435,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.813055146086102,"acs":21511,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26457,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7186656214615451,"acs":16502,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22962,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8133710963702765,"acs":21826,"articleLive":2,"columnArticles":347,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26834,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.558931484502447,"acs":13705,"articleLive":2,"columnArticles":218,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24520,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49473607783344226,"acs":34070,"articleLive":2,"columnArticles":327,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68865,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.760766854443031,"acs":16746,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22012,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013184881336068,"acs":6844,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13652,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5339569451563301,"acs":4167,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7804,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.554873391692615,"acs":56667,"articleLive":2,"columnArticles":2374,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102126,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396357587648212,"acs":34683,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46892,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39523624518095696,"acs":13225,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33461,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5535149008983317,"acs":19409,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35065,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4547967252116717,"acs":12999,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28582,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6232157285214113,"acs":4628,"articleLive":2,"columnArticles":84,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7426,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6668396471198754,"acs":7710,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11562,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8317790648211774,"acs":25420,"articleLive":2,"columnArticles":402,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30561,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7660190161223646,"acs":14824,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19352,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44235912570321867,"acs":9593,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21686,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46027589730489205,"acs":7207,"articleLive":2,"columnArticles":157,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15658,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46422286131261536,"acs":10815,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23297,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4241143649509723,"acs":12846,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30289,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7330020920502092,"acs":19621,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26768,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3733745123537061,"acs":2297,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6152,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5480696442089327,"acs":2172,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3963,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6801627403372925,"acs":10365,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15239,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409276609890735,"acs":50402,"articleLive":2,"columnArticles":581,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114309,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43028322440087147,"acs":1975,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4590,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5492742551566081,"acs":3595,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6545,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.503051682625007,"acs":8984,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17859,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4534563606111027,"acs":14989,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":33055,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6005518725486794,"acs":34605,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57622,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3440514469453376,"acs":15194,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44162,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.611620520196572,"acs":20411,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33372,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.721669655959563,"acs":8852,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12266,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46486749331388283,"acs":9560,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20565,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5834400341442595,"acs":2734,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4686,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47164062159926873,"acs":10835,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22973,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5456032719836401,"acs":32016,"articleLive":2,"columnArticles":257,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58680,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38807434313439565,"acs":14637,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37717,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5969169422291383,"acs":12275,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20564,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6431461290543784,"acs":28137,"articleLive":2,"columnArticles":456,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":43749,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.387468211359141,"acs":5485,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14156,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4497883801462101,"acs":4676,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10396,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4117840839568921,"acs":8750,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21249,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2715815593574507,"acs":8318,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30628,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5489752980596898,"acs":14090,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25666,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5706034909314269,"acs":66885,"articleLive":2,"columnArticles":928,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117218,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6870185449358059,"acs":14448,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21030,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6318035962947266,"acs":20871,"articleLive":2,"columnArticles":292,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33034,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5526215336252386,"acs":24611,"articleLive":2,"columnArticles":271,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44535,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5970243993064157,"acs":77126,"articleLive":2,"columnArticles":760,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":129184,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4028796708947549,"acs":5876,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14585,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184647514262428,"acs":61071,"articleLive":2,"columnArticles":1138,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117792,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4450095003911926,"acs":7963,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17894,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4456125162327624,"acs":7206,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16171,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5787362086258776,"acs":8655,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14955,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5709292164287795,"acs":3920,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6866,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359014750107403,"acs":44405,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69830,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37498940228910554,"acs":8846,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23590,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37880176651945674,"acs":4546,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12001,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5241299750048067,"acs":10904,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20804,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5040051265619994,"acs":1573,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3121,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3416345488684653,"acs":3457,"articleLive":2,"columnArticles":53,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10119,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file From a08f2c7793e9cb2bd4e59560f982f934d4827f36 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Wed, 13 Oct 2021 12:12:01 +0800 Subject: [PATCH 7/8] =?UTF-8?q?=E4=BB=A3=E7=A0=81=E6=A0=BC=E5=BC=8F?= =?UTF-8?q?=E5=8C=96?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../editor/cn/TwoSumIiInputArrayIsSorted.java | 30 ++++++++++--------- 1 file changed, 16 insertions(+), 14 deletions(-) diff --git a/src/main/java/leetcode/editor/cn/TwoSumIiInputArrayIsSorted.java b/src/main/java/leetcode/editor/cn/TwoSumIiInputArrayIsSorted.java index 2bd0cde..54acee4 100644 --- a/src/main/java/leetcode/editor/cn/TwoSumIiInputArrayIsSorted.java +++ b/src/main/java/leetcode/editor/cn/TwoSumIiInputArrayIsSorted.java @@ -43,30 +43,32 @@ // 👍 533 👎 0 package leetcode.editor.cn; + //167:两数之和 II - 输入有序数组 -class TwoSumIiInputArrayIsSorted{ +class TwoSumIiInputArrayIsSorted { public static void main(String[] args) { //测试代码 Solution solution = new TwoSumIiInputArrayIsSorted().new Solution(); } + //力扣代码 //leetcode submit region begin(Prohibit modification and deletion) -class Solution { - public int[] twoSum(int[] numbers, int target) { - int start = 0; - int end = numbers.length-1; - while(starttarget){ - end--; - }else{ - start++; + class Solution { + public int[] twoSum(int[] numbers, int target) { + int start = 0; + int end = numbers.length - 1; + while (start < end) { + if (numbers[start] + numbers[end] == target) { + return new int[]{start + 1, end + 1}; + } else if (numbers[start] + numbers[end] > target) { + end--; + } else { + start++; + } } + return null; } - return null; } -} //leetcode submit region end(Prohibit modification and deletion) } \ No newline at end of file From c0df40dc061e25476dce2304d5b1b99d599e080b Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Wed, 13 Oct 2021 13:16:05 +0800 Subject: [PATCH 8/8] =?UTF-8?q?217:=E5=AD=98=E5=9C=A8=E9=87=8D=E5=A4=8D?= =?UTF-8?q?=E5=85=83=E7=B4=A0(new)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../leetcode/editor/cn/ContainsDuplicate.java | 32 +++++++++++++------ 1 file changed, 22 insertions(+), 10 deletions(-) diff --git a/src/main/java/leetcode/editor/cn/ContainsDuplicate.java b/src/main/java/leetcode/editor/cn/ContainsDuplicate.java index bef9ce7..654e9e1 100644 --- a/src/main/java/leetcode/editor/cn/ContainsDuplicate.java +++ b/src/main/java/leetcode/editor/cn/ContainsDuplicate.java @@ -26,29 +26,41 @@ package leetcode.editor.cn; +import java.util.ArrayList; +import java.util.Arrays; import java.util.HashSet; import java.util.Set; //217:存在重复元素 -class ContainsDuplicate{ +class ContainsDuplicate { public static void main(String[] args) { //测试代码 Solution solution = new ContainsDuplicate().new Solution(); } + //力扣代码 //leetcode submit region begin(Prohibit modification and deletion) -class Solution { - public boolean containsDuplicate(int[] nums) { - Set set = new HashSet<>(); - for (int num : nums) { - if (set.contains(num)) { - return true; + class Solution { + // public boolean containsDuplicate(int[] nums) { +// Set set = new HashSet<>(); +// for (int num : nums) { +// if (set.contains(num)) { +// return true; +// } +// set.add(num); +// } +// return false; +// } + public boolean containsDuplicate(int[] nums) { + Arrays.sort(nums); + for (int i = 1; i < nums.length; i++) { + if(nums[i]==nums[i-1]){ + return true; + } } - set.add(num); + return false; } - return false; } -} //leetcode submit region end(Prohibit modification and deletion) } \ No newline at end of file