From 66c2b946861774cd6def86f489a4e127b005ca73 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Tue, 19 Oct 2021 14:46:47 +0800 Subject: [PATCH] =?UTF-8?q?211:=E6=B7=BB=E5=8A=A0=E4=B8=8E=E6=90=9C?= =?UTF-8?q?=E7=B4=A2=E5=8D=95=E8=AF=8D=20-=20=E6=95=B0=E6=8D=AE=E7=BB=93?= =?UTF-8?q?=E6=9E=84=E8=AE=BE=E8=AE=A1(=E5=AE=98=E6=96=B9)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../DesignAddAndSearchWordsDataStructure.java | 136 ++++++++++++++++++ src/main/java/leetcode/editor/cn/doc/all.json | 2 +- .../DesignAddAndSearchWordsDataStructure.md | 43 ++++++ 3 files changed, 180 insertions(+), 1 deletion(-) create mode 100644 src/main/java/leetcode/editor/cn/DesignAddAndSearchWordsDataStructure.java create mode 100644 src/main/java/leetcode/editor/cn/doc/content/DesignAddAndSearchWordsDataStructure.md diff --git a/src/main/java/leetcode/editor/cn/DesignAddAndSearchWordsDataStructure.java b/src/main/java/leetcode/editor/cn/DesignAddAndSearchWordsDataStructure.java new file mode 100644 index 0000000..f5c16a4 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/DesignAddAndSearchWordsDataStructure.java @@ -0,0 +1,136 @@ +//请你设计一个数据结构，支持 添加新单词 和 查找字符串是否与任何先前添加的字符串匹配 。 +// +// 实现词典类 WordDictionary ： +// +// +// WordDictionary() 初始化词典对象 +// void addWord(word) 将 word 添加到数据结构中，之后可以对它进行匹配 +// bool search(word) 如果数据结构中存在字符串与 word 匹配，则返回 true ；否则，返回 false 。word 中可能包含一些 +//'.' ，每个 . 都可以表示任何一个字母。 +// +// +// +// +// 示例： +// +// +//输入： +//["WordDictionary","addWord","addWord","addWord","search","search","search", +//"search"] +//[[],["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]] +//输出： +//[null,null,null,null,false,true,true,true] +// +//解释： +//WordDictionary wordDictionary = new WordDictionary(); +//wordDictionary.addWord("bad"); +//wordDictionary.addWord("dad"); +//wordDictionary.addWord("mad"); +//wordDictionary.search("pad"); // return False +//wordDictionary.search("bad"); // return True +//wordDictionary.search(".ad"); // return True +//wordDictionary.search("b.."); // return True +// +// +// +// +// 提示： +// +// +// 1 <= word.length <= 500 +// addWord 中的 word 由小写英文字母组成 +// search 中的 word 由 '.' 或小写英文字母组成 +// 最多调用 50000 次 addWord 和 search +// +// Related Topics 深度优先搜索 设计 字典树 字符串 👍 328 👎 0 + +package leetcode.editor.cn; + +//211:添加与搜索单词 - 数据结构设计 +class DesignAddAndSearchWordsDataStructure { + public static void main(String[] args) { + //测试代码 +// Solution solution = new DesignAddAndSearchWordsDataStructure().new Solution(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class WordDictionary { + private Trie root; + + public WordDictionary() { + root = new Trie(); + } + + public void addWord(String word) { + root.insert(word); + } + + public boolean search(String word) { + return dfs(word, 0, root); + } + + private boolean dfs(String word, int index, Trie node) { + if (index == word.length()) { + return node.isEnd(); + } + char ch = word.charAt(index); + if (Character.isLetter(ch)) { + int childIndex = ch - 'a'; + Trie child = node.getChildren()[childIndex]; + if (child != null && dfs(word, index + 1, child)) { + return true; + } + } else { + for (int i = 0; i < 26; i++) { + Trie child = node.getChildren()[i]; + if (child != null && dfs(word, index + 1, child)) { + return true; + } + } + } + return false; + } + } + + class Trie { + private Trie[] children; + private boolean isEnd; + + public Trie() { + children = new Trie[26]; + isEnd = false; + } + + public void insert(String word) { + Trie node = this; + for (int i = 0; i < word.length(); i++) { + char ch = word.charAt(i); + int index = ch - 'a'; + if (node.children[index] == null) { + node.children[index] = new Trie(); + } + node = node.children[index]; + } + node.isEnd = true; + } + + public Trie[] getChildren() { + return children; + } + + public boolean isEnd() { + return isEnd; + } + } + + +/** + * Your WordDictionary object will be instantiated and called as such: + * WordDictionary obj = new WordDictionary(); + * obj.addWord(word); + * boolean param_2 = obj.search(word); + */ +//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 2e82be6..f9c2761 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.7124474208545495,"acs":51490,"articleLive":2,"columnArticles":711,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":72272,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.5210414021360957,"acs":2582747,"articleLive":2,"columnArticles":14476,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4956894,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4093426954635405,"acs":1027846,"articleLive":2,"columnArticles":7291,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2510967,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38122035792580705,"acs":1277076,"articleLive":2,"columnArticles":7627,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3349968,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4090893604104623,"acs":528307,"articleLive":2,"columnArticles":3930,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1291422,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3556960142143996,"acs":757916,"articleLive":2,"columnArticles":4100,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2130797,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5074960169248047,"acs":310888,"articleLive":2,"columnArticles":2523,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":612592,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.352307042572697,"acs":855058,"articleLive":2,"columnArticles":5381,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2427025,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.2172882802052596,"acs":355521,"articleLive":2,"columnArticles":2732,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1636172,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5834272595993631,"acs":787831,"articleLive":2,"columnArticles":5010,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1350350,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31601089437501606,"acs":209197,"articleLive":2,"columnArticles":1258,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":661993,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6268804564907275,"acs":549304,"articleLive":2,"columnArticles":3113,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":876250,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6646815270187351,"acs":231813,"articleLive":2,"columnArticles":1810,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":348758,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.63179038562904,"acs":478247,"articleLive":2,"columnArticles":3959,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":756971,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.41048654483768987,"acs":638832,"articleLive":2,"columnArticles":3992,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1556280,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33707669148946773,"acs":676250,"articleLive":2,"columnArticles":3197,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2006220,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4590789754756376,"acs":266488,"articleLive":2,"columnArticles":1460,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":580484,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5733523304042526,"acs":348491,"articleLive":2,"columnArticles":3139,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":607813,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39808586416828956,"acs":226897,"articleLive":2,"columnArticles":1561,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":569970,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42993590357143147,"acs":534532,"articleLive":2,"columnArticles":3996,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1243283,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4451272798248669,"acs":802755,"articleLive":2,"columnArticles":5687,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1803428,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.667648187520802,"acs":734182,"articleLive":2,"columnArticles":3559,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1099654,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7726727190117361,"acs":360526,"articleLive":2,"columnArticles":2705,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":466596,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5602091520793705,"acs":334274,"articleLive":2,"columnArticles":2159,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":596695,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7035166394386915,"acs":324267,"articleLive":2,"columnArticles":2567,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":460923,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6578427389056177,"acs":236380,"articleLive":2,"columnArticles":2242,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":359326,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5386645692781266,"acs":833487,"articleLive":2,"columnArticles":4631,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1547321,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5970418983966896,"acs":494894,"articleLive":2,"columnArticles":4172,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":828910,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4053944893170123,"acs":480778,"articleLive":2,"columnArticles":3296,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1185951,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.21979849672157364,"acs":130568,"articleLive":2,"columnArticles":1040,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":594035,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35930583234863583,"acs":81492,"articleLive":2,"columnArticles":605,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":226804,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37319206103774305,"acs":220842,"articleLive":2,"columnArticles":1785,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":591765,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35680285745526114,"acs":195792,"articleLive":2,"columnArticles":1320,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":548740,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4280430756349174,"acs":376255,"articleLive":2,"columnArticles":2485,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":879012,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42345481918338723,"acs":353838,"articleLive":2,"columnArticles":3384,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":835598,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46281248822514487,"acs":528163,"articleLive":2,"columnArticles":4046,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1141203,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6402702851987554,"acs":208650,"articleLive":2,"columnArticles":1473,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":325878,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6709227224043361,"acs":103359,"articleLive":2,"columnArticles":877,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":154055,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5958542855597992,"acs":242440,"articleLive":2,"columnArticles":2598,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":406878,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.727776699193031,"acs":344873,"articleLive":2,"columnArticles":2001,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":473872,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6217477290046327,"acs":205607,"articleLive":2,"columnArticles":1427,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":330692,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41974001178374587,"acs":168840,"articleLive":2,"columnArticles":1442,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":402249,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5826054983201127,"acs":334327,"articleLive":2,"columnArticles":2487,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":573848,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44908315311614255,"acs":173810,"articleLive":2,"columnArticles":1170,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":387033,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3283391032548471,"acs":85927,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":261702,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.430827652919346,"acs":209773,"articleLive":2,"columnArticles":1678,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":486907,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.783251694532309,"acs":433334,"articleLive":2,"columnArticles":2766,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":553250,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6384196271736905,"acs":221342,"articleLive":2,"columnArticles":1520,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":346703,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7353036867621241,"acs":228264,"articleLive":2,"columnArticles":1914,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":310435,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6656306742862236,"acs":239012,"articleLive":2,"columnArticles":1349,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":359076,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37641171586198935,"acs":221673,"articleLive":2,"columnArticles":1314,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":588911,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7389168130920808,"acs":156858,"articleLive":2,"columnArticles":1570,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":212281,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8223338586813764,"acs":75135,"articleLive":2,"columnArticles":622,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":91368,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5529161625298077,"acs":706038,"articleLive":2,"columnArticles":3878,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1276935,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4817157723091477,"acs":193498,"articleLive":2,"columnArticles":2045,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":401685,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43275805338167833,"acs":335381,"articleLive":2,"columnArticles":2576,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":774985,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.47025252877784085,"acs":309903,"articleLive":2,"columnArticles":2380,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":659014,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4116469151628856,"acs":87985,"articleLive":2,"columnArticles":941,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":213739,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37728312970099964,"acs":253057,"articleLive":2,"columnArticles":2716,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":670735,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7895312840109319,"acs":130579,"articleLive":2,"columnArticles":1604,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":165388,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5244297053261988,"acs":91245,"articleLive":2,"columnArticles":967,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173989,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4175906272110542,"acs":200669,"articleLive":2,"columnArticles":2037,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":480540,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.662605314055483,"acs":321349,"articleLive":2,"columnArticles":2476,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":484978,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39217792153914516,"acs":186230,"articleLive":2,"columnArticles":1756,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":474861,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6884073770553429,"acs":274689,"articleLive":2,"columnArticles":2121,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":399021,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2696913904456283,"acs":46727,"articleLive":2,"columnArticles":648,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":173261,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.457038757769369,"acs":357881,"articleLive":2,"columnArticles":3232,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":783043,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5426513481315131,"acs":198141,"articleLive":2,"columnArticles":1810,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":365135,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5243253646398967,"acs":38141,"articleLive":2,"columnArticles":577,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72743,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39189986380337005,"acs":395938,"articleLive":2,"columnArticles":1987,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1010304,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5304464264837867,"acs":589849,"articleLive":2,"columnArticles":3669,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1111986,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4218285573166107,"acs":95653,"articleLive":2,"columnArticles":839,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":226758,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142321715580836,"acs":180763,"articleLive":2,"columnArticles":1259,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":294291,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6047948064404401,"acs":136201,"articleLive":2,"columnArticles":999,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":225202,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46182498321450266,"acs":173334,"articleLive":2,"columnArticles":1734,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":375324,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5966320605009751,"acs":275965,"articleLive":2,"columnArticles":1897,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":462538,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4274168940264216,"acs":190498,"articleLive":2,"columnArticles":1296,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":445696,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.770086027200076,"acs":226835,"articleLive":2,"columnArticles":1330,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":294558,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015447323524475,"acs":319947,"articleLive":2,"columnArticles":2087,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":399163,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45876815142762917,"acs":229524,"articleLive":2,"columnArticles":1444,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":500305,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.616914258497368,"acs":150247,"articleLive":2,"columnArticles":1342,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":243546,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41492805105269903,"acs":126268,"articleLive":2,"columnArticles":1005,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":304313,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5308704699001858,"acs":185991,"articleLive":2,"columnArticles":1716,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":350351,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5383927740631937,"acs":324022,"articleLive":2,"columnArticles":1977,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":601832,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4335163623277573,"acs":186722,"articleLive":2,"columnArticles":1186,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":430715,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5158050068604861,"acs":99620,"articleLive":2,"columnArticles":701,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":193135,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6326317213251207,"acs":121607,"articleLive":2,"columnArticles":1121,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":192224,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4866996669133975,"acs":42082,"articleLive":2,"columnArticles":314,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86464,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5175092388968113,"acs":477941,"articleLive":2,"columnArticles":3339,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":923541,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7101545463164881,"acs":59920,"articleLive":2,"columnArticles":488,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":84376,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6336804621208044,"acs":141293,"articleLive":2,"columnArticles":1244,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":222972,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30993192373525524,"acs":166766,"articleLive":2,"columnArticles":1544,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":538073,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5490590683333586,"acs":216897,"articleLive":2,"columnArticles":2064,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":395034,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5413026361482735,"acs":157433,"articleLive":2,"columnArticles":1358,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":290841,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7557867438319565,"acs":578783,"articleLive":2,"columnArticles":2366,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":765802,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7027123679577465,"acs":102180,"articleLive":2,"columnArticles":637,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":145408,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6994476017371858,"acs":167012,"articleLive":2,"columnArticles":1318,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":238777,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4558359507039699,"acs":62842,"articleLive":2,"columnArticles":556,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":137861,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35053691163044837,"acs":356699,"articleLive":2,"columnArticles":1982,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1017579,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6113185120701777,"acs":73033,"articleLive":2,"columnArticles":600,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":119468,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6019246561765511,"acs":255074,"articleLive":2,"columnArticles":1914,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":423764,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5643019528770997,"acs":421476,"articleLive":2,"columnArticles":2311,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":746898,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420642390589749,"acs":407253,"articleLive":2,"columnArticles":2556,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":634287,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718085363301186,"acs":177578,"articleLive":2,"columnArticles":1613,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":310555,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661391050668623,"acs":526287,"articleLive":2,"columnArticles":2603,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":686934,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7047849579997175,"acs":254476,"articleLive":2,"columnArticles":1456,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":361069,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7215832600146284,"acs":136144,"articleLive":2,"columnArticles":904,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":188674,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.697790581120124,"acs":165682,"articleLive":2,"columnArticles":1326,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":237438,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7606904729506444,"acs":195661,"articleLive":2,"columnArticles":1210,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":257215,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7631244555618601,"acs":95489,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":125129,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.563874897757114,"acs":261965,"articleLive":2,"columnArticles":1498,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":464580,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4869253113125587,"acs":277433,"articleLive":2,"columnArticles":1826,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":569765,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5263801737431106,"acs":275819,"articleLive":2,"columnArticles":1730,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":523992,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6277049314955996,"acs":183443,"articleLive":2,"columnArticles":1289,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":292244,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7261423550087873,"acs":181797,"articleLive":2,"columnArticles":1363,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":250360,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5215823461630924,"acs":62919,"articleLive":2,"columnArticles":692,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":120631,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7047171887609126,"acs":163302,"articleLive":2,"columnArticles":1242,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":231727,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6152508031298738,"acs":92311,"articleLive":2,"columnArticles":785,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":150038,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7317075588599752,"acs":221433,"articleLive":2,"columnArticles":1782,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":302625,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6683464780456939,"acs":147875,"articleLive":2,"columnArticles":1226,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":221255,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6816472815290627,"acs":182205,"articleLive":2,"columnArticles":1601,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":267301,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733752662234746,"acs":576663,"articleLive":2,"columnArticles":3455,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1005734,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.689807674630006,"acs":472759,"articleLive":2,"columnArticles":2695,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":685349,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5373369654613511,"acs":133935,"articleLive":2,"columnArticles":832,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":249257,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4450635556329445,"acs":163584,"articleLive":2,"columnArticles":1109,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":367552,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4727826220694636,"acs":282811,"articleLive":2,"columnArticles":1861,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":598184,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39670690162762334,"acs":37730,"articleLive":2,"columnArticles":333,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":95108,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4688486291599744,"acs":125229,"articleLive":2,"columnArticles":664,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":267099,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5433614877954281,"acs":175302,"articleLive":2,"columnArticles":1147,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":322625,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6831006616859959,"acs":123161,"articleLive":2,"columnArticles":1133,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":180297,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4455400665040711,"acs":131711,"articleLive":2,"columnArticles":1196,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":295621,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230371649173348,"acs":136534,"articleLive":2,"columnArticles":893,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":188834,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49234899592864306,"acs":50065,"articleLive":2,"columnArticles":443,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101686,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6761797711737398,"acs":73993,"articleLive":2,"columnArticles":531,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":109428,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5756151010162246,"acs":128182,"articleLive":2,"columnArticles":990,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":222687,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4861444687915642,"acs":101611,"articleLive":2,"columnArticles":815,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":209014,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190918579935855,"acs":511869,"articleLive":2,"columnArticles":2322,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":711827,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7199739273366208,"acs":101620,"articleLive":2,"columnArticles":766,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":141144,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6618502631076223,"acs":114330,"articleLive":2,"columnArticles":867,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":172743,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5161794554744185,"acs":199125,"articleLive":2,"columnArticles":1238,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":385767,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4914620307748173,"acs":54137,"articleLive":2,"columnArticles":556,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":110155,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5125460522586862,"acs":542571,"articleLive":2,"columnArticles":2791,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1058580,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5528480817337191,"acs":304543,"articleLive":2,"columnArticles":1782,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":550862,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.621735250466478,"acs":130284,"articleLive":2,"columnArticles":1103,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":209549,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7040686696989473,"acs":423981,"articleLive":2,"columnArticles":1883,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":602187,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7508342873253951,"acs":308915,"articleLive":2,"columnArticles":1593,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":411429,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5260567286631689,"acs":239935,"articleLive":2,"columnArticles":1413,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":456101,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6818453721191265,"acs":101447,"articleLive":2,"columnArticles":795,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":148783,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6670937837401805,"acs":215015,"articleLive":2,"columnArticles":1269,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":322316,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.34269024358660777,"acs":47636,"articleLive":2,"columnArticles":521,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":139006,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5355324128987364,"acs":135449,"articleLive":2,"columnArticles":1068,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":252924,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48443937589794334,"acs":173314,"articleLive":2,"columnArticles":1454,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":357762,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42151999606033064,"acs":188309,"articleLive":2,"columnArticles":1264,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":446738,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5669341649268762,"acs":215613,"articleLive":2,"columnArticles":1521,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":380314,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5316245253311105,"acs":114799,"articleLive":2,"columnArticles":903,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":215940,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5737414582157858,"acs":292856,"articleLive":2,"columnArticles":1627,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":510432,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7250135648399348,"acs":6681,"articleLive":2,"columnArticles":118,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9215,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5341342486651411,"acs":5602,"articleLive":2,"columnArticles":83,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10488,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5921325051759835,"acs":2860,"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":4830,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5476456829045052,"acs":16155,"articleLive":2,"columnArticles":194,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29499,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6149405316328724,"acs":343309,"articleLive":2,"columnArticles":2003,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":558280,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3366064414768264,"acs":7713,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22914,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4970725161821855,"acs":164107,"articleLive":2,"columnArticles":1112,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":330147,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32655473285361697,"acs":9394,"articleLive":2,"columnArticles":145,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28767,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6097683117520211,"acs":59664,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97847,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192978065392659,"acs":87147,"articleLive":2,"columnArticles":932,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":167817,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.331261727007149,"acs":41842,"articleLive":2,"columnArticles":381,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":126311,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5865968712910651,"acs":300994,"articleLive":2,"columnArticles":1979,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":513119,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325351635058737,"acs":85459,"articleLive":2,"columnArticles":763,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":197577,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646814781915269,"acs":395088,"articleLive":2,"columnArticles":2228,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":594402,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4195096455383446,"acs":8829,"articleLive":2,"columnArticles":89,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":21046,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7180877834286925,"acs":108437,"articleLive":2,"columnArticles":923,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":151008,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4404638978124522,"acs":92138,"articleLive":2,"columnArticles":601,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":209184,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8046178545777177,"acs":76178,"articleLive":2,"columnArticles":639,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94676,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4809754883663058,"acs":38656,"articleLive":2,"columnArticles":411,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":80370,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7393182507806881,"acs":309435,"articleLive":2,"columnArticles":1483,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":418541,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35580757484389286,"acs":256074,"articleLive":2,"columnArticles":1030,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":719698,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46298273935179435,"acs":130494,"articleLive":2,"columnArticles":503,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":281855,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.603507534593569,"acs":121509,"articleLive":2,"columnArticles":679,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":201338,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096933458955758,"acs":123060,"articleLive":2,"columnArticles":976,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":300371,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48697391494958353,"acs":88863,"articleLive":2,"columnArticles":523,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":182480,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7018419954740263,"acs":166545,"articleLive":2,"columnArticles":683,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":237297,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967034871128439,"acs":183919,"articleLive":2,"columnArticles":599,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":230850,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6767782334133402,"acs":152826,"articleLive":2,"columnArticles":554,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":225814,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4773969245709103,"acs":104221,"articleLive":2,"columnArticles":683,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":218311,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49718841738219605,"acs":72149,"articleLive":2,"columnArticles":641,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":145114,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7569498825371965,"acs":7733,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10216,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.521273249596343,"acs":74577,"articleLive":2,"columnArticles":545,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":143067,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3929780688185349,"acs":91457,"articleLive":2,"columnArticles":707,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":232728,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4499683892809071,"acs":353020,"articleLive":2,"columnArticles":1762,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":784544,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.698678395730843,"acs":134068,"articleLive":2,"columnArticles":840,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":191888,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7493657845100371,"acs":193481,"articleLive":2,"columnArticles":1217,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":258193,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3563069131754508,"acs":21951,"articleLive":2,"columnArticles":178,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61607,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32531459550242664,"acs":26343,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80977,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34516300378460923,"acs":10397,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30122,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4362413663344703,"acs":35938,"articleLive":2,"columnArticles":143,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":82381,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.665445012688884,"acs":103313,"articleLive":2,"columnArticles":397,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":155254,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339558904551753,"acs":95946,"articleLive":2,"columnArticles":514,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":179689,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5162158689283781,"acs":397718,"articleLive":2,"columnArticles":2740,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":770449,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6526876727274367,"acs":144772,"articleLive":2,"columnArticles":1615,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":221809,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5580528985148105,"acs":337795,"articleLive":2,"columnArticles":2153,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":605310,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5245452176179307,"acs":50317,"articleLive":2,"columnArticles":330,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95925,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6194510420201083,"acs":173437,"articleLive":2,"columnArticles":1414,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":279985,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.516983397802644,"acs":239369,"articleLive":2,"columnArticles":1689,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":463011,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3779302104308189,"acs":170798,"articleLive":2,"columnArticles":738,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":451930,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5004031244310744,"acs":115442,"articleLive":2,"columnArticles":885,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":230698,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7234621708975759,"acs":729035,"articleLive":2,"columnArticles":7432,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1007703,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5428972172351885,"acs":145149,"articleLive":2,"columnArticles":955,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":267360,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167261974470078,"acs":146883,"articleLive":2,"columnArticles":997,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":204936,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4733853445408285,"acs":200660,"articleLive":2,"columnArticles":1418,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":423883,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5429921465502401,"acs":91473,"articleLive":2,"columnArticles":686,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":168461,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48316960298774053,"acs":29756,"articleLive":2,"columnArticles":330,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61585,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.462853298437835,"acs":62606,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":135261,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4332983740105792,"acs":170629,"articleLive":2,"columnArticles":1565,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":393791,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37183295267623634,"acs":31421,"articleLive":2,"columnArticles":309,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84503,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6463306326851014,"acs":451206,"articleLive":2,"columnArticles":2341,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":698104,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.736965850492229,"acs":102184,"articleLive":2,"columnArticles":1051,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":138655,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5575423631531078,"acs":378840,"articleLive":2,"columnArticles":1766,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":679482,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5420115118694867,"acs":31828,"articleLive":2,"columnArticles":282,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58722,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.424770393363822,"acs":112757,"articleLive":2,"columnArticles":905,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":265454,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28679883945841395,"acs":65241,"articleLive":2,"columnArticles":426,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":227480,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4772825587595194,"acs":142329,"articleLive":2,"columnArticles":1009,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":298207,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7821466804148086,"acs":119092,"articleLive":2,"columnArticles":894,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":152263,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5235489199651968,"acs":41519,"articleLive":2,"columnArticles":517,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":79303,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41785155098998744,"acs":72323,"articleLive":2,"columnArticles":662,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":173083,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6755929684597486,"acs":138202,"articleLive":2,"columnArticles":4767,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":204564,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7882776295198711,"acs":312813,"articleLive":2,"columnArticles":1890,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":396831,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4377009846380534,"acs":87928,"articleLive":2,"columnArticles":708,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":200886,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5797777088606328,"acs":57954,"articleLive":2,"columnArticles":654,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99959,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46495971883623943,"acs":37572,"articleLive":2,"columnArticles":320,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80807,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7513970550221132,"acs":159874,"articleLive":2,"columnArticles":1086,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":212769,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5043461327385063,"acs":170934,"articleLive":2,"columnArticles":1230,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":338922,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6909000905421528,"acs":163297,"articleLive":2,"columnArticles":1292,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":236354,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4770038521118072,"acs":34796,"articleLive":2,"columnArticles":418,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72947,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49749790839555924,"acs":317536,"articleLive":2,"columnArticles":2028,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":638266,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6662292868022545,"acs":173648,"articleLive":2,"columnArticles":999,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":260643,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6810910159512492,"acs":264217,"articleLive":2,"columnArticles":1418,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":387932,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8479759017853933,"acs":212256,"articleLive":2,"columnArticles":1021,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":250309,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7237331586730595,"acs":141437,"articleLive":2,"columnArticles":895,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":195427,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4969288427195211,"acs":197564,"articleLive":2,"columnArticles":1354,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":397570,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47894054732098007,"acs":172580,"articleLive":2,"columnArticles":781,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":360337,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7381372436705236,"acs":32216,"articleLive":2,"columnArticles":290,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43645,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.646026496520626,"acs":298284,"articleLive":2,"columnArticles":1727,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":461721,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6570655749689305,"acs":8988,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13679,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5510732391327796,"acs":5109,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9271,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6007667031763417,"acs":4388,"articleLive":2,"columnArticles":60,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7304,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47563936549045,"acs":5877,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12356,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5245999403637809,"acs":5278,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":10061,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4652173913043478,"acs":2675,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5750,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6384839650145773,"acs":5913,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9261,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.634836180341641,"acs":4534,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7142,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5441198061958596,"acs":3706,"articleLive":2,"columnArticles":70,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6811,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5646442842052083,"acs":12294,"articleLive":2,"columnArticles":159,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21773,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.501562691506312,"acs":32738,"articleLive":2,"columnArticles":353,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":65272,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5687039445166884,"acs":5248,"articleLive":2,"columnArticles":77,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9228,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4756581319870177,"acs":5276,"articleLive":2,"columnArticles":62,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11092,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6412616394854406,"acs":11914,"articleLive":2,"columnArticles":187,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18579,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6831827592697158,"acs":145190,"articleLive":2,"columnArticles":1075,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":212520,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6922399818723746,"acs":79429,"articleLive":2,"columnArticles":658,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114742,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5649646504320502,"acs":7192,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12730,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7234444520501061,"acs":52844,"articleLive":2,"columnArticles":450,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":73045,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.494874715261959,"acs":8690,"articleLive":2,"columnArticles":119,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17560,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4341654484382498,"acs":38906,"articleLive":2,"columnArticles":377,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":89611,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152173704919916,"acs":107632,"articleLive":2,"columnArticles":840,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":208906,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5800905650021154,"acs":101459,"articleLive":2,"columnArticles":617,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":174902,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5904697303713753,"acs":6964,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11794,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6752026893415068,"acs":6829,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10114,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4471240649987103,"acs":3467,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7754,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6260665199990259,"acs":154239,"articleLive":2,"columnArticles":1124,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":246362,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3384703196347032,"acs":6523,"articleLive":2,"columnArticles":109,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19272,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5548265124555161,"acs":9978,"articleLive":2,"columnArticles":141,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17984,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5537258130918074,"acs":2690,"articleLive":2,"columnArticles":46,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4858,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6492689246714788,"acs":3508,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5403,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3667931322744518,"acs":28520,"articleLive":2,"columnArticles":351,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":77755,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4400756819086133,"acs":54194,"articleLive":2,"columnArticles":565,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":123147,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46215423491719687,"acs":51209,"articleLive":2,"columnArticles":419,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110805,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49271177117711773,"acs":7166,"articleLive":2,"columnArticles":131,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14544,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5703580349708576,"acs":7535,"articleLive":2,"columnArticles":85,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13211,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45346376890397716,"acs":191812,"articleLive":2,"columnArticles":1095,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":422993,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6325155119003568,"acs":206837,"articleLive":2,"columnArticles":1217,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":327007,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6852700096432015,"acs":5685,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8296,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7600465928945835,"acs":2610,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3434,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.4873548922056385,"acs":18808,"articleLive":2,"columnArticles":162,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":38592,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6392034001337102,"acs":505778,"articleLive":2,"columnArticles":3437,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":791263,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7711741241225765,"acs":24939,"articleLive":2,"columnArticles":210,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32339,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6354044548651817,"acs":8130,"articleLive":2,"columnArticles":104,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12795,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5097782434084163,"acs":11678,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22908,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6590488828942502,"acs":181767,"articleLive":2,"columnArticles":1243,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":275802,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4344861178762786,"acs":3568,"articleLive":2,"columnArticles":55,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8212,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7536097141810703,"acs":53498,"articleLive":2,"columnArticles":831,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70989,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4564900049022278,"acs":83807,"articleLive":2,"columnArticles":1115,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":183590,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5318002900352186,"acs":2567,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4827,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7082924315303819,"acs":115446,"articleLive":2,"columnArticles":770,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162992,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.712082262210797,"acs":4986,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":7002,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5812995245641839,"acs":3668,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6310,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5233231682721009,"acs":64868,"articleLive":2,"columnArticles":507,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123954,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6203566121842496,"acs":2505,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4038,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5607196872563232,"acs":107144,"articleLive":2,"columnArticles":768,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":191083,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5784608273630691,"acs":5006,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8654,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5047783534830167,"acs":30688,"articleLive":2,"columnArticles":364,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60795,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5171655780563051,"acs":369129,"articleLive":2,"columnArticles":2040,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":713754,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5243024302430243,"acs":33785,"articleLive":2,"columnArticles":237,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":64438,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6566634398192965,"acs":2035,"articleLive":2,"columnArticles":39,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3099,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7268449078591541,"acs":130356,"articleLive":2,"columnArticles":799,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":179345,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5480211510041602,"acs":64153,"articleLive":2,"columnArticles":571,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":117063,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3837311337311337,"acs":4373,"articleLive":2,"columnArticles":65,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11396,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3379390546773367,"acs":17145,"articleLive":2,"columnArticles":256,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50734,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5388290189978892,"acs":24250,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":45005,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.611006711409396,"acs":2276,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3725,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6091426594700188,"acs":119741,"articleLive":2,"columnArticles":955,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":196573,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3796475484235584,"acs":22168,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":58391,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7621861152141802,"acs":3612,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4739,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6832933844678811,"acs":57014,"articleLive":2,"columnArticles":386,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":83440,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6281051040505672,"acs":41139,"articleLive":2,"columnArticles":356,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65497,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5464993549900317,"acs":4660,"articleLive":2,"columnArticles":88,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8527,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41789476276877857,"acs":50900,"articleLive":2,"columnArticles":481,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121801,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47625682755545645,"acs":68360,"articleLive":2,"columnArticles":541,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":143536,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4837637149506816,"acs":4365,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":9023,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6859167167970055,"acs":20524,"articleLive":2,"columnArticles":184,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29922,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5189717935547268,"acs":23238,"articleLive":2,"columnArticles":229,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44777,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6775436211194199,"acs":2990,"articleLive":2,"columnArticles":50,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4413,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4239487828011382,"acs":26819,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":63260,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44521030424352054,"acs":311588,"articleLive":2,"columnArticles":1843,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":699867,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6323966186885995,"acs":11072,"articleLive":2,"columnArticles":153,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17508,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784529978887068,"acs":25633,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67731,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5368127807152198,"acs":9442,"articleLive":2,"columnArticles":107,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17589,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5045456221198157,"acs":136858,"articleLive":2,"columnArticles":585,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":271250,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4208984540359314,"acs":24857,"articleLive":2,"columnArticles":206,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":59057,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.655756241707876,"acs":130485,"articleLive":2,"columnArticles":1074,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":198984,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4866353474809655,"acs":57076,"articleLive":2,"columnArticles":501,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":117287,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.533357658087513,"acs":19003,"articleLive":2,"columnArticles":150,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35629,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47988658326784617,"acs":45189,"articleLive":2,"columnArticles":508,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":94166,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4497781949426212,"acs":40252,"articleLive":2,"columnArticles":331,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":89493,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.469972613458529,"acs":4805,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10224,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4119844289900713,"acs":47096,"articleLive":2,"columnArticles":310,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":114315,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36979857676999156,"acs":3066,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8291,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40135980811195876,"acs":22255,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55449,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6078937712136501,"acs":132533,"articleLive":2,"columnArticles":938,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":218020,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7868958412300395,"acs":161929,"articleLive":2,"columnArticles":1394,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":205782,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8100042936882782,"acs":3773,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4658,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49435897435897436,"acs":12050,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24375,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7271301177235404,"acs":51451,"articleLive":2,"columnArticles":490,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70759,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5163278133829914,"acs":87895,"articleLive":2,"columnArticles":774,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":170231,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6065792242407239,"acs":112424,"articleLive":2,"columnArticles":1066,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":185341,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7695335664478662,"acs":376325,"articleLive":2,"columnArticles":1985,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":489030,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.539380557143702,"acs":109436,"articleLive":2,"columnArticles":1040,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":202892,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7059988681380871,"acs":12475,"articleLive":2,"columnArticles":135,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17670,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6222680462171554,"acs":206107,"articleLive":2,"columnArticles":1524,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":331219,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6007020091987412,"acs":4963,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8262,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7379201840604963,"acs":218096,"articleLive":2,"columnArticles":1537,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":295555,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.550553914965634,"acs":255043,"articleLive":2,"columnArticles":1427,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":463248,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5904406928305196,"acs":5386,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9122,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6796262415054888,"acs":20802,"articleLive":2,"columnArticles":343,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":30608,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4287075867327488,"acs":2249,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5246,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4541942604856512,"acs":70778,"articleLive":2,"columnArticles":547,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155832,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4082143941694503,"acs":26885,"articleLive":2,"columnArticles":440,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65860,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35303129787699716,"acs":1613,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4569,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5205290540964082,"acs":24912,"articleLive":2,"columnArticles":391,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47859,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35168990782320964,"acs":4464,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12693,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7267053053945609,"acs":4890,"articleLive":2,"columnArticles":58,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6729,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6015787287079352,"acs":2896,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4814,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.567194685743485,"acs":3330,"articleLive":2,"columnArticles":65,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5871,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6909428512481948,"acs":3349,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4847,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4894321929863484,"acs":33091,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67611,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7219417475728155,"acs":1859,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2575,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3659486783219035,"acs":34098,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":93177,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7655807365439093,"acs":4324,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5648,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.43861908265881777,"acs":78683,"articleLive":2,"columnArticles":633,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":179388,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4589431604700948,"acs":42019,"articleLive":2,"columnArticles":455,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91556,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6181892666939779,"acs":4527,"articleLive":2,"columnArticles":131,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7323,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7237654320987654,"acs":3283,"articleLive":2,"columnArticles":49,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4536,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127914542070781,"acs":81000,"articleLive":2,"columnArticles":508,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":132182,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5112688553682343,"acs":14405,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":28175,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.41574118783196523,"acs":20664,"articleLive":2,"columnArticles":211,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49704,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5157174420031914,"acs":84031,"articleLive":2,"columnArticles":574,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":162940,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.47035598293319747,"acs":14772,"articleLive":2,"columnArticles":125,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31406,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4649255172746807,"acs":77027,"articleLive":2,"columnArticles":827,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":165676,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5092905732217897,"acs":65809,"articleLive":2,"columnArticles":558,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":129217,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6391034751057935,"acs":80497,"articleLive":2,"columnArticles":566,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125953,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6390603225164244,"acs":3210,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":5023,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5033550354023906,"acs":35332,"articleLive":2,"columnArticles":221,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":70193,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44136682413168793,"acs":21209,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":48053,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.632563991664373,"acs":16088,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25433,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6029001766562571,"acs":72011,"articleLive":2,"columnArticles":788,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":119441,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5799092264514998,"acs":52897,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":91216,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41785754472825476,"acs":7427,"articleLive":2,"columnArticles":86,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17774,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7500661900979614,"acs":22664,"articleLive":2,"columnArticles":242,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30216,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5346487086460249,"acs":225911,"articleLive":2,"columnArticles":1226,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":422541,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.529098712446352,"acs":6164,"articleLive":2,"columnArticles":113,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11650,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6915706727957677,"acs":101701,"articleLive":2,"columnArticles":999,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":147058,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46654906572585914,"acs":7141,"articleLive":2,"columnArticles":97,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15306,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35906656465187453,"acs":4693,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13070,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5151804659889024,"acs":148831,"articleLive":2,"columnArticles":1596,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":288891,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39122813168320303,"acs":11159,"articleLive":2,"columnArticles":128,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28523,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5529493345263393,"acs":123598,"articleLive":2,"columnArticles":1318,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":223525,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205932777799929,"acs":52228,"articleLive":2,"columnArticles":431,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":100324,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4293606945540647,"acs":9248,"articleLive":2,"columnArticles":149,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21539,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3767023288097461,"acs":15739,"articleLive":2,"columnArticles":197,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41781,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6583873290136789,"acs":14632,"articleLive":2,"columnArticles":123,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22224,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5917688485573912,"acs":42518,"articleLive":2,"columnArticles":534,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71849,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41739279002221086,"acs":19544,"articleLive":2,"columnArticles":201,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46824,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6140094318233347,"acs":54163,"articleLive":2,"columnArticles":658,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":88212,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3271458751832076,"acs":81917,"articleLive":2,"columnArticles":593,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":250399,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45565897134735533,"acs":46166,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":101317,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5845956780063246,"acs":102230,"articleLive":2,"columnArticles":1135,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":174873,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5616789256047133,"acs":46047,"articleLive":2,"columnArticles":463,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81981,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7377223852607737,"acs":121165,"articleLive":2,"columnArticles":806,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":164242,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.483331794256164,"acs":10468,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21658,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3251611731589939,"acs":3581,"articleLive":2,"columnArticles":83,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":11013,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5561308597831387,"acs":95808,"articleLive":2,"columnArticles":1340,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":172276,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5649806889278436,"acs":39643,"articleLive":2,"columnArticles":321,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":70167,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5049614112458655,"acs":916,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1814,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7082708429804615,"acs":102479,"articleLive":2,"columnArticles":590,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":144689,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6881263400489266,"acs":72854,"articleLive":2,"columnArticles":942,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":105873,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3934906616993429,"acs":88088,"articleLive":2,"columnArticles":1147,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":223863,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5387100791744507,"acs":151391,"articleLive":2,"columnArticles":1098,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":281025,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5079399153915288,"acs":177461,"articleLive":2,"columnArticles":1007,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":349374,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4814432989690722,"acs":28020,"articleLive":2,"columnArticles":330,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":58200,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3612797374897457,"acs":2202,"articleLive":2,"columnArticles":34,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6095,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7556787040984105,"acs":12409,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16421,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20871456427178642,"acs":2783,"articleLive":2,"columnArticles":53,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13334,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6219018668059156,"acs":33347,"articleLive":2,"columnArticles":307,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53621,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42854122621564483,"acs":2027,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4730,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5686679549543546,"acs":8534,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":15007,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.531721930820118,"acs":52004,"articleLive":2,"columnArticles":456,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97803,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6173774412116381,"acs":1549,"articleLive":2,"columnArticles":32,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2509,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6694207027540361,"acs":7049,"articleLive":2,"columnArticles":115,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10530,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6137472283813747,"acs":4152,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6765,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.653986832479883,"acs":2682,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4101,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7004038601516823,"acs":59659,"articleLive":2,"columnArticles":479,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":85178,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5878472730174351,"acs":44202,"articleLive":2,"columnArticles":674,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":75193,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7333333333333333,"acs":880,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1200,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37925362976406535,"acs":6687,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17632,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.531768001867725,"acs":15944,"articleLive":2,"columnArticles":217,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29983,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3989944176317149,"acs":63326,"articleLive":2,"columnArticles":878,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":158714,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5074418700400399,"acs":98599,"articleLive":2,"columnArticles":868,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":194306,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4883021755766918,"acs":8933,"articleLive":2,"columnArticles":147,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18294,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743441698146821,"acs":125736,"articleLive":2,"columnArticles":1036,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":218921,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5189669518465576,"acs":97298,"articleLive":2,"columnArticles":854,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":187484,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5910659898477157,"acs":2911,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4925,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3804916913271113,"acs":16715,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43930,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4590086415812557,"acs":77656,"articleLive":2,"columnArticles":745,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":169182,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6973557502565317,"acs":44174,"articleLive":2,"columnArticles":445,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":63345,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4773483081741415,"acs":56698,"articleLive":2,"columnArticles":694,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118777,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2524810274372446,"acs":3460,"articleLive":2,"columnArticles":54,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13704,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885738843720497,"acs":83541,"articleLive":2,"columnArticles":941,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141938,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5510233168006385,"acs":19331,"articleLive":2,"columnArticles":173,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":35082,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6629137368071645,"acs":48929,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73809,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6488550327465279,"acs":139692,"articleLive":2,"columnArticles":1103,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":215290,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5588509205530482,"acs":15602,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27918,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48708426372076624,"acs":62169,"articleLive":2,"columnArticles":627,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":127635,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7115743299253937,"acs":82406,"articleLive":2,"columnArticles":956,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115808,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5088588627380061,"acs":98482,"articleLive":2,"columnArticles":860,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":193535,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5566315199775915,"acs":27821,"articleLive":2,"columnArticles":315,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49981,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6035682547333223,"acs":80143,"articleLive":2,"columnArticles":503,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":132782,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.576871899424891,"acs":154773,"articleLive":2,"columnArticles":1271,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":268297,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3625234749947833,"acs":57332,"articleLive":2,"columnArticles":463,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":158147,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43611710230614925,"acs":28915,"articleLive":2,"columnArticles":333,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66301,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6128368095962761,"acs":6846,"articleLive":2,"columnArticles":65,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11171,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.511112518605314,"acs":80697,"articleLive":2,"columnArticles":649,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":157885,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43755732191990215,"acs":34350,"articleLive":2,"columnArticles":405,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":78504,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8123185656009866,"acs":171253,"articleLive":2,"columnArticles":1367,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":210820,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6054306321595249,"acs":14270,"articleLive":2,"columnArticles":133,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23570,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7085361778227373,"acs":78447,"articleLive":2,"columnArticles":946,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110717,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35564800806858293,"acs":11284,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31728,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.53086014445174,"acs":1617,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3046,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37401322123098646,"acs":11655,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31162,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4416154959812291,"acs":8846,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":20031,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2516806180305242,"acs":25346,"articleLive":2,"columnArticles":299,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100707,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.434657455382844,"acs":1510,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3474,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.547075588072653,"acs":64306,"articleLive":2,"columnArticles":337,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":117545,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6182965299684543,"acs":1372,"articleLive":2,"columnArticles":25,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2219,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3983005206151637,"acs":6656,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16711,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4202460053788957,"acs":21251,"articleLive":2,"columnArticles":183,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50568,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6122244328209736,"acs":76315,"articleLive":2,"columnArticles":608,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":124652,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33486884392886657,"acs":21881,"articleLive":2,"columnArticles":244,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":65342,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.6038179511772532,"acs":39032,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64642,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4382329945269742,"acs":6726,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15348,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.420189701897019,"acs":3101,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7380,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44791273780607394,"acs":29689,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66283,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5410984848484849,"acs":5714,"articleLive":2,"columnArticles":98,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10560,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.47229536215816703,"acs":40897,"articleLive":2,"columnArticles":435,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":86592,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5905958961156962,"acs":15600,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26414,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6361674579197237,"acs":1474,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2317,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.607245532150396,"acs":123988,"articleLive":2,"columnArticles":1000,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":204181,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5864828141512757,"acs":46616,"articleLive":2,"columnArticles":404,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79484,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5785044016639257,"acs":5980,"articleLive":2,"columnArticles":115,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10337,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.38791401623162974,"acs":3537,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9118,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7207563764291997,"acs":1639,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2274,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4841747504071373,"acs":6838,"articleLive":2,"columnArticles":82,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14123,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5457498585172609,"acs":48217,"articleLive":2,"columnArticles":408,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":88350,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5522963459604425,"acs":19770,"articleLive":2,"columnArticles":185,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35796,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34593619396204867,"acs":26653,"articleLive":2,"columnArticles":269,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":77046,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49296624637339725,"acs":152752,"articleLive":2,"columnArticles":1051,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":309863,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5434036840927735,"acs":29146,"articleLive":2,"columnArticles":444,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":53636,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6874407458127041,"acs":104414,"articleLive":2,"columnArticles":1079,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":151888,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40399406287950346,"acs":2994,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7411,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.46953953379656194,"acs":44194,"articleLive":2,"columnArticles":456,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":94122,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3725270099621159,"acs":2655,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7127,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.709306577684326,"acs":31035,"articleLive":2,"columnArticles":485,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43754,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5133970221985766,"acs":66584,"articleLive":2,"columnArticles":550,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":129693,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4413642851776726,"acs":29375,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66555,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6361145855578266,"acs":104256,"articleLive":2,"columnArticles":989,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":163895,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5039340758969045,"acs":31127,"articleLive":2,"columnArticles":330,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61768,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4845202558635395,"acs":5681,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11725,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.563008808649426,"acs":21923,"articleLive":2,"columnArticles":297,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38939,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41269226513223417,"acs":29836,"articleLive":2,"columnArticles":236,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":72296,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6776908650107497,"acs":14815,"articleLive":2,"columnArticles":213,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21861,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.674133611240105,"acs":249691,"articleLive":2,"columnArticles":1511,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":370388,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6076951399116347,"acs":3301,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5432,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7322002241314904,"acs":19601,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26770,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5378129194141331,"acs":18433,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":34274,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7308557292252333,"acs":51996,"articleLive":2,"columnArticles":580,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":71144,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.49987357774968394,"acs":19770,"articleLive":2,"columnArticles":244,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39550,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6449968863688506,"acs":39359,"articleLive":2,"columnArticles":428,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":61022,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6545239750865466,"acs":87538,"articleLive":2,"columnArticles":630,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":133743,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5099351766106628,"acs":19273,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37795,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6578194399549857,"acs":109894,"articleLive":2,"columnArticles":690,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":167058,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.397504714928188,"acs":2740,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6893,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5638410522209218,"acs":40468,"articleLive":2,"columnArticles":653,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71772,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.713410388525275,"acs":25615,"articleLive":2,"columnArticles":254,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35905,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36228835839730783,"acs":6890,"articleLive":2,"columnArticles":108,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":19018,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2746613245532261,"acs":69238,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":252085,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4957036795522317,"acs":72977,"articleLive":2,"columnArticles":759,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":147219,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5359413260501036,"acs":45525,"articleLive":2,"columnArticles":519,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84944,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7350544076831579,"acs":33370,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45398,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5784908933217693,"acs":2001,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3459,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47709946575424694,"acs":31792,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66636,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6451258166763697,"acs":39892,"articleLive":2,"columnArticles":465,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61836,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6211557510666011,"acs":79639,"articleLive":2,"columnArticles":642,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":128211,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6587971738755816,"acs":3823,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5803,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37536437810362255,"acs":25625,"articleLive":2,"columnArticles":279,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68267,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5261813537675607,"acs":1648,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3132,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6750416435313714,"acs":14589,"articleLive":2,"columnArticles":140,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21612,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8423502036067481,"acs":15928,"articleLive":2,"columnArticles":104,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18909,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5390625,"acs":3105,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5760,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7122319540924192,"acs":11791,"articleLive":2,"columnArticles":175,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16555,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7017917736973964,"acs":110648,"articleLive":2,"columnArticles":845,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":157665,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5983186212694409,"acs":14234,"articleLive":2,"columnArticles":191,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23790,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5823310509080083,"acs":39121,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":67180,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6067916902831514,"acs":73869,"articleLive":2,"columnArticles":810,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":121737,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4579845021611308,"acs":70569,"articleLive":2,"columnArticles":650,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":154086,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5529763398165217,"acs":152079,"articleLive":2,"columnArticles":1245,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":275019,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.71124150710315,"acs":2303,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3238,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41904646660212974,"acs":3463,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8264,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.628537050867148,"acs":15149,"articleLive":2,"columnArticles":121,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24102,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6188952964498108,"acs":164844,"articleLive":2,"columnArticles":1158,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":266352,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3553465996063853,"acs":1625,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4573,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4820875718708536,"acs":2180,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4522,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4385063144636961,"acs":12882,"articleLive":2,"columnArticles":181,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29377,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5677415016953385,"acs":59107,"articleLive":2,"columnArticles":760,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":104109,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5776130858157049,"acs":24083,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41694,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6053938963804116,"acs":5971,"articleLive":2,"columnArticles":87,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9863,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5032202427735569,"acs":46099,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91608,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.34375,"acs":1111,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3232,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32601929317233613,"acs":14769,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45301,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7451331747543455,"acs":165085,"articleLive":2,"columnArticles":1368,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":221551,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5049061800654158,"acs":2933,"articleLive":2,"columnArticles":39,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5809,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7282359173582906,"acs":61860,"articleLive":2,"columnArticles":553,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84945,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465617425664214,"acs":153473,"articleLive":2,"columnArticles":945,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":343677,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7749175255969779,"acs":90670,"articleLive":2,"columnArticles":755,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":117006,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4667142177841179,"acs":3926,"articleLive":2,"columnArticles":64,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8412,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6064812234052437,"acs":32639,"articleLive":2,"columnArticles":328,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53817,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17987169206094628,"acs":4486,"articleLive":2,"columnArticles":77,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24940,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6104747009341844,"acs":14442,"articleLive":2,"columnArticles":141,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23657,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6878467802275753,"acs":70787,"articleLive":2,"columnArticles":659,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":102911,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43226167199113896,"acs":121370,"articleLive":2,"columnArticles":1103,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":280779,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5089134125636672,"acs":1199,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2356,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5655621636930048,"acs":9985,"articleLive":2,"columnArticles":157,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17655,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6614480417489993,"acs":13055,"articleLive":2,"columnArticles":114,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19737,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.487970563260685,"acs":6896,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14132,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4733872932214275,"acs":85507,"articleLive":2,"columnArticles":746,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":180628,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6621621621621622,"acs":1029,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1554,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6483944374209861,"acs":12822,"articleLive":2,"columnArticles":114,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19775,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6836575005589091,"acs":42812,"articleLive":2,"columnArticles":444,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62622,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46846684235226166,"acs":25954,"articleLive":2,"columnArticles":282,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55402,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7017559946815827,"acs":15306,"articleLive":2,"columnArticles":86,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21811,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4961726505012593,"acs":10047,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20249,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4108300229981183,"acs":7860,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":19132,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5237655271532697,"acs":10204,"articleLive":2,"columnArticles":82,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19482,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4051305520567973,"acs":100032,"articleLive":2,"columnArticles":866,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":246913,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4088302484964334,"acs":8769,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21449,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.619716432380029,"acs":51139,"articleLive":2,"columnArticles":495,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":82520,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744385916273911,"acs":13967,"articleLive":2,"columnArticles":62,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":18035,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.59500034913763,"acs":8521,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14321,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7456985720772996,"acs":14779,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19819,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38497150997151,"acs":2162,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5616,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4260894332099117,"acs":1496,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3511,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.745569144717619,"acs":89308,"articleLive":2,"columnArticles":568,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119785,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7615992102665351,"acs":63263,"articleLive":2,"columnArticles":467,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":83066,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3401964488099736,"acs":1801,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5294,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5228818443804034,"acs":4536,"articleLive":2,"columnArticles":111,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8675,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44272251308900523,"acs":8456,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19100,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5184135977337111,"acs":29646,"articleLive":2,"columnArticles":273,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":57186,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7969157570240727,"acs":104180,"articleLive":2,"columnArticles":239,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":130729,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4212059318867065,"acs":82283,"articleLive":2,"columnArticles":291,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":195351,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4416228715577044,"acs":10504,"articleLive":2,"columnArticles":84,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23785,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.51783171418626,"acs":16364,"articleLive":2,"columnArticles":212,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31601,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221201035067369,"acs":29257,"articleLive":2,"columnArticles":277,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":56035,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.481277423214998,"acs":19305,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40112,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5014916467780429,"acs":31939,"articleLive":2,"columnArticles":379,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63688,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6304712520969956,"acs":8268,"articleLive":2,"columnArticles":89,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":13114,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6709889079831276,"acs":12885,"articleLive":2,"columnArticles":115,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":19203,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3738048262255274,"acs":2463,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6589,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3336874249068618,"acs":110258,"articleLive":2,"columnArticles":1269,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":330423,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5690312889134861,"acs":28789,"articleLive":2,"columnArticles":315,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50593,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6601472247595508,"acs":12286,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18611,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6562738934669952,"acs":7725,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11771,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48435886085288476,"acs":6565,"articleLive":2,"columnArticles":102,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13554,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6648111083312485,"acs":10629,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15988,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319240183259765,"acs":50853,"articleLive":2,"columnArticles":397,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95602,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6699141937790489,"acs":7495,"articleLive":2,"columnArticles":65,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11188,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8171222422644651,"acs":11778,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14414,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3467153284671533,"acs":8265,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23838,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4253164556962025,"acs":5376,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12640,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46250517884270126,"acs":3349,"articleLive":2,"columnArticles":56,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7241,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7879317218730862,"acs":191703,"articleLive":2,"columnArticles":1261,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":243299,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.619960343688037,"acs":4690,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7565,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4662798247037819,"acs":11491,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24644,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7736426707926293,"acs":94003,"articleLive":2,"columnArticles":312,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":121507,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.571232379014678,"acs":78613,"articleLive":2,"columnArticles":503,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":137620,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4376390065664054,"acs":66115,"articleLive":2,"columnArticles":427,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":151072,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5458963282937365,"acs":11121,"articleLive":2,"columnArticles":192,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20372,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4205803741886216,"acs":2203,"articleLive":2,"columnArticles":50,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5238,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3433038749150238,"acs":2525,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7355,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6842593284977193,"acs":45753,"articleLive":2,"columnArticles":357,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66865,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.808051221389812,"acs":86072,"articleLive":2,"columnArticles":344,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":106518,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5246192662340196,"acs":80677,"articleLive":2,"columnArticles":769,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":153782,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4067433248879361,"acs":4174,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10262,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3680380472152189,"acs":6423,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17452,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2892299550145541,"acs":1093,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3779,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5979290314433641,"acs":18940,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31676,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3975121369416587,"acs":94654,"articleLive":2,"columnArticles":771,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":238116,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44055269922879176,"acs":1371,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3112,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5523012552301255,"acs":4092,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7409,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.552983825989961,"acs":9915,"articleLive":2,"columnArticles":113,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17930,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6901025510017883,"acs":75638,"articleLive":2,"columnArticles":656,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":109604,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5923700965290614,"acs":11537,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19476,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37687869905341576,"acs":20186,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53561,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42509553146689544,"acs":10902,"articleLive":2,"columnArticles":213,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25646,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5331429134246035,"acs":21652,"articleLive":2,"columnArticles":242,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40612,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4895132568262762,"acs":2474,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5054,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45053025839575794,"acs":64233,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":142572,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4022307424189613,"acs":1154,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2869,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43350378015497065,"acs":69094,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":159385,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5778496113291772,"acs":22524,"articleLive":2,"columnArticles":202,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38979,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6568847462580631,"acs":125867,"articleLive":2,"columnArticles":925,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":191612,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5848191267062878,"acs":21550,"articleLive":2,"columnArticles":282,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36849,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48178384707997296,"acs":29212,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60633,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.567189185467398,"acs":49426,"articleLive":2,"columnArticles":656,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":87142,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5841538461538461,"acs":3797,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6500,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5714236363008256,"acs":33082,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57894,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5986077231423232,"acs":41963,"articleLive":2,"columnArticles":397,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":70101,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8109043934531023,"acs":60890,"articleLive":2,"columnArticles":618,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":75089,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5976297968397292,"acs":9531,"articleLive":2,"columnArticles":143,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15948,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3081669691470054,"acs":849,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2755,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834156534954407,"acs":82478,"articleLive":2,"columnArticles":629,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105280,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4547496521782859,"acs":27129,"articleLive":2,"columnArticles":242,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59657,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.542035987370183,"acs":28497,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52574,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6563380281690141,"acs":699,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1065,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.561120628842084,"acs":16704,"articleLive":2,"columnArticles":214,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29769,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4094035893915407,"acs":29222,"articleLive":2,"columnArticles":278,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":71377,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46459143968871597,"acs":1791,"articleLive":2,"columnArticles":36,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3855,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6535312028852691,"acs":22107,"articleLive":2,"columnArticles":190,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33827,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2708651788443901,"acs":75310,"articleLive":2,"columnArticles":943,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":278035,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6189785258270458,"acs":2133,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3446,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6243222308288149,"acs":8060,"articleLive":2,"columnArticles":121,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12910,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5087809917355371,"acs":6895,"articleLive":2,"columnArticles":68,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13552,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6655993342740331,"acs":36793,"articleLive":2,"columnArticles":310,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":55278,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4522110599943667,"acs":19266,"articleLive":2,"columnArticles":286,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42604,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48575199797490326,"acs":53730,"articleLive":2,"columnArticles":674,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110612,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5472842977652804,"acs":3698,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6757,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43552578968412636,"acs":47927,"articleLive":2,"columnArticles":418,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":110044,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49742281736542854,"acs":93610,"articleLive":2,"columnArticles":776,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":188190,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40137174211248283,"acs":2926,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7290,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5889854601575827,"acs":7251,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12311,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.618122844473641,"acs":15055,"articleLive":2,"columnArticles":253,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24356,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38570460525736816,"acs":43828,"articleLive":2,"columnArticles":480,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113631,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5415058315693355,"acs":26093,"articleLive":2,"columnArticles":263,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":48186,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4017001822279548,"acs":87514,"articleLive":2,"columnArticles":830,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":217859,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5035570082676408,"acs":2619,"articleLive":2,"columnArticles":64,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5201,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6953164899209902,"acs":46290,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66574,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4342768514928267,"acs":2240,"articleLive":2,"columnArticles":52,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5158,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658770905405108,"acs":60439,"articleLive":2,"columnArticles":609,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90766,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43106218005012104,"acs":20125,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46687,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3563081960503428,"acs":17411,"articleLive":2,"columnArticles":197,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48865,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44150034411562283,"acs":38490,"articleLive":2,"columnArticles":274,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":87180,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5109170305676856,"acs":8073,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15801,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4886313627695467,"acs":3331,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6817,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6479175067688231,"acs":56236,"articleLive":2,"columnArticles":571,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86795,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49281453362255967,"acs":3635,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7376,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5775232991219643,"acs":68537,"articleLive":2,"columnArticles":742,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":118674,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.609557678451061,"acs":26225,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":43023,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5358166189111748,"acs":4114,"articleLive":2,"columnArticles":79,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7678,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6652495899701156,"acs":132229,"articleLive":2,"columnArticles":1309,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":198766,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6317023886844194,"acs":52521,"articleLive":2,"columnArticles":477,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":83142,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6047954483879707,"acs":66969,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110730,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4467381841254851,"acs":30275,"articleLive":2,"columnArticles":219,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67769,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47747440273037545,"acs":2798,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5860,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7608124863248487,"acs":83452,"articleLive":2,"columnArticles":528,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":109688,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7230314149848355,"acs":77240,"articleLive":2,"columnArticles":572,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":106828,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7426210153482881,"acs":4403,"articleLive":2,"columnArticles":77,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5929,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5131346438385119,"acs":60691,"articleLive":2,"columnArticles":554,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":118275,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5547458886961796,"acs":300021,"articleLive":2,"columnArticles":1486,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":540826,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6450999229532678,"acs":67820,"articleLive":2,"columnArticles":435,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":105131,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.644330179473967,"acs":58770,"articleLive":2,"columnArticles":392,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":91211,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3226185306541392,"acs":65378,"articleLive":2,"columnArticles":450,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":202648,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.340076786769049,"acs":2303,"articleLive":2,"columnArticles":53,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6772,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7586030337294392,"acs":71116,"articleLive":2,"columnArticles":511,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93746,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.35280763837884754,"acs":5284,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14977,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.559190031152648,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1284,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6728582092829227,"acs":15323,"articleLive":2,"columnArticles":173,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22773,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4154774972557629,"acs":24224,"articleLive":2,"columnArticles":224,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":58304,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7221644861409677,"acs":101454,"articleLive":2,"columnArticles":678,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":140486,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40926405607191835,"acs":2686,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6563,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4611363636363636,"acs":4058,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8800,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5116091713259108,"acs":31752,"articleLive":2,"columnArticles":382,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":62063,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5648226351351351,"acs":85600,"articleLive":2,"columnArticles":594,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":151552,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3699925662839679,"acs":8959,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24214,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4838560351811133,"acs":20905,"articleLive":2,"columnArticles":279,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":43205,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4693613998837735,"acs":29076,"articleLive":2,"columnArticles":338,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61948,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32200266853040216,"acs":5068,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15739,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7195909580193757,"acs":1337,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1858,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46343022887951274,"acs":139163,"articleLive":2,"columnArticles":870,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":300289,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6085254944836498,"acs":48979,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80488,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5525012632642748,"acs":21868,"articleLive":2,"columnArticles":398,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39580,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.410106085985483,"acs":2938,"articleLive":2,"columnArticles":50,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7164,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7603161843515541,"acs":34050,"articleLive":2,"columnArticles":311,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44784,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5146030187753099,"acs":8387,"articleLive":2,"columnArticles":94,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16298,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4908955778520996,"acs":3963,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8073,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5044104857746304,"acs":4060,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":8049,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6101815592737629,"acs":3428,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5618,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804118740960121,"acs":67416,"articleLive":2,"columnArticles":578,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":116152,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.48042376784891755,"acs":2086,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4342,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40764197152915965,"acs":21305,"articleLive":2,"columnArticles":267,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":52264,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4640213206988451,"acs":1567,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3377,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46213108924973334,"acs":3899,"articleLive":2,"columnArticles":66,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8437,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5016038782499638,"acs":41595,"articleLive":2,"columnArticles":593,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82924,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6802564305500594,"acs":214876,"articleLive":2,"columnArticles":1532,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":315875,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6294607860872921,"acs":52193,"articleLive":2,"columnArticles":606,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":82917,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36809309997250983,"acs":4017,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10913,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.493531082360366,"acs":1564,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3169,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5208625841523563,"acs":57872,"articleLive":2,"columnArticles":527,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":111108,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4588688946015424,"acs":41412,"articleLive":2,"columnArticles":367,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":90248,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3924050632911392,"acs":2883,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7347,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.589105898686229,"acs":137482,"articleLive":2,"columnArticles":1315,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":233374,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4169440380395026,"acs":45597,"articleLive":2,"columnArticles":405,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109360,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6018664752333094,"acs":12576,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20895,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.499275887038378,"acs":1379,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2762,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7214644651830582,"acs":2010,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2786,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5026949335249731,"acs":1399,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2783,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5305016156796425,"acs":70266,"articleLive":2,"columnArticles":592,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":132452,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5915365056302215,"acs":3257,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5506,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4310529128808124,"acs":8065,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18710,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49942682460833016,"acs":1307,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2617,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5647116444226766,"acs":4612,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8167,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41912391341401056,"acs":2459,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5867,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4624292670088169,"acs":3514,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7599,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6618881118881119,"acs":1893,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2860,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8394330442140893,"acs":3968,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4727,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5912408759124088,"acs":2106,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3562,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7004377736085053,"acs":17920,"articleLive":2,"columnArticles":143,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25584,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7633441108545035,"acs":82632,"articleLive":2,"columnArticles":991,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":108250,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49353093389790637,"acs":4196,"articleLive":2,"columnArticles":54,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8502,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6654912755647565,"acs":29253,"articleLive":2,"columnArticles":443,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43957,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7079811965372859,"acs":55122,"articleLive":2,"columnArticles":637,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77858,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47795506659221326,"acs":40229,"articleLive":2,"columnArticles":499,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":84169,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5065081000093642,"acs":5409,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10679,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5878124565227473,"acs":12675,"articleLive":2,"columnArticles":152,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21563,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5544738062123319,"acs":1196,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2157,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512712122977238,"acs":153451,"articleLive":2,"columnArticles":1120,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":180261,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49429115128449097,"acs":6234,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12612,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7132388713208465,"acs":23457,"articleLive":2,"columnArticles":334,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32888,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5901725039205437,"acs":1129,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1913,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4591166681658721,"acs":5104,"articleLive":2,"columnArticles":81,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11117,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5649289099526066,"acs":1788,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3165,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3238249220464257,"acs":5608,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17318,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5939377183502149,"acs":23631,"articleLive":2,"columnArticles":348,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39787,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4363310509627315,"acs":18990,"articleLive":2,"columnArticles":236,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43522,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2853432603237815,"acs":3296,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11551,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6168602003642987,"acs":43348,"articleLive":2,"columnArticles":663,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70272,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4282073067119796,"acs":1512,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3531,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5960382874628163,"acs":69929,"articleLive":2,"columnArticles":673,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117323,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6871312144694881,"acs":44601,"articleLive":2,"columnArticles":493,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64909,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5123488632503366,"acs":40722,"articleLive":2,"columnArticles":407,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":79481,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.47421203438395415,"acs":4303,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9074,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3909189447383892,"acs":42557,"articleLive":2,"columnArticles":404,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108864,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6081955900233315,"acs":18508,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30431,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6922365072545196,"acs":20945,"articleLive":2,"columnArticles":296,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30257,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44865609924190214,"acs":3906,"articleLive":2,"columnArticles":67,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8706,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948382406397674,"acs":11469,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16506,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4649322987981135,"acs":9168,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19719,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3931511104208728,"acs":5063,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12878,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3408734188902225,"acs":7384,"articleLive":2,"columnArticles":106,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21662,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5331182512509877,"acs":8097,"articleLive":2,"columnArticles":89,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15188,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5309580611357606,"acs":23814,"articleLive":2,"columnArticles":282,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44851,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.792497428772487,"acs":43921,"articleLive":2,"columnArticles":543,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":55421,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46502331778814127,"acs":1396,"articleLive":2,"columnArticles":35,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3002,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40850771345654496,"acs":5349,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13094,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7068292682926829,"acs":1449,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2050,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4194495624136343,"acs":7285,"articleLive":2,"columnArticles":88,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17368,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5763855599395258,"acs":31262,"articleLive":2,"columnArticles":334,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54238,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48194945848375453,"acs":12282,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25484,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7714855086483767,"acs":39875,"articleLive":2,"columnArticles":401,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51686,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29083969465648857,"acs":2667,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9170,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6565015029574324,"acs":13541,"articleLive":2,"columnArticles":152,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20626,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.845712836123795,"acs":16669,"articleLive":2,"columnArticles":222,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19710,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4809451219512195,"acs":4417,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9184,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4191601496089765,"acs":4931,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11764,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7333980068789134,"acs":16632,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22678,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7051196065280573,"acs":15770,"articleLive":2,"columnArticles":200,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22365,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6304034166330005,"acs":10923,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17327,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5508268673093503,"acs":7028,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12759,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6990270663474071,"acs":23063,"articleLive":2,"columnArticles":358,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32993,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4336084142394822,"acs":26797,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61800,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5115318906605922,"acs":3593,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7024,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5913561977715878,"acs":13587,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22976,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43334514110284567,"acs":3670,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8469,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4214658185777319,"acs":22065,"articleLive":2,"columnArticles":250,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52353,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5076981090427489,"acs":55201,"articleLive":2,"columnArticles":603,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108728,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6928410278985307,"acs":25182,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36346,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5024364775495997,"acs":2887,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5746,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4285092807424594,"acs":2955,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6896,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.615815917862084,"acs":16914,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27466,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3927631963523704,"acs":6719,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":17107,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3750601829561868,"acs":7790,"articleLive":2,"columnArticles":117,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20770,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3895395543528815,"acs":9213,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23651,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49195262678408747,"acs":3240,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6586,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36595230153435626,"acs":8777,"articleLive":2,"columnArticles":101,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23984,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431768832470353,"acs":52032,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95792,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4057016359807786,"acs":7514,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18521,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7958124884194923,"acs":85900,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107940,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4312894649385178,"acs":5191,"articleLive":2,"columnArticles":78,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12036,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5282277087592389,"acs":13436,"articleLive":2,"columnArticles":133,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25436,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5747675962815405,"acs":4328,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7530,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47951749217572004,"acs":37844,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78921,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3958923946074932,"acs":19411,"articleLive":2,"columnArticles":245,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49031,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5009025270758123,"acs":7215,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14404,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5748246297739673,"acs":19175,"articleLive":2,"columnArticles":270,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33358,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3600270786874801,"acs":9041,"articleLive":2,"columnArticles":114,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25112,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6581383010080764,"acs":55820,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84815,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48816004121232937,"acs":28428,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58235,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38012725057533503,"acs":2808,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7387,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5124066964637538,"acs":91027,"articleLive":2,"columnArticles":994,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":177646,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42129155725666473,"acs":37864,"articleLive":2,"columnArticles":557,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89876,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5115831242341133,"acs":8767,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17137,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6807406062806317,"acs":18751,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27545,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44919891545476953,"acs":9112,"articleLive":2,"columnArticles":98,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20285,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42708499654052906,"acs":16049,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37578,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4495782911624496,"acs":2452,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5454,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.48238031914893614,"acs":4353,"articleLive":2,"columnArticles":72,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":9024,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7156839062747287,"acs":85920,"articleLive":2,"columnArticles":745,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":120053,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3840709283266279,"acs":10310,"articleLive":2,"columnArticles":124,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26844,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3595966221201935,"acs":4386,"articleLive":2,"columnArticles":68,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12197,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40768782760629,"acs":4900,"articleLive":2,"columnArticles":58,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":12019,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6271341812764982,"acs":16419,"articleLive":2,"columnArticles":219,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26181,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4666256536450323,"acs":3034,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6502,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.556193758376412,"acs":2905,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5223,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3023596437379514,"acs":28075,"articleLive":2,"columnArticles":365,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92853,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.58712985531297,"acs":90573,"articleLive":2,"columnArticles":777,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":154264,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.808495910990335,"acs":31537,"articleLive":2,"columnArticles":441,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39007,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19262734742475862,"acs":16340,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84827,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.604210597918509,"acs":35530,"articleLive":2,"columnArticles":564,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58804,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.456732924824391,"acs":3056,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6691,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6589298626174982,"acs":9113,"articleLive":2,"columnArticles":132,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13830,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22482910957881855,"acs":7532,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33501,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.670159951471809,"acs":83963,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125288,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6247910651876615,"acs":16447,"articleLive":2,"columnArticles":237,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26324,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5513788714467543,"acs":6498,"articleLive":2,"columnArticles":97,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11785,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4299617558079799,"acs":15065,"articleLive":2,"columnArticles":192,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":35038,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3431029558760531,"acs":9611,"articleLive":2,"columnArticles":129,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":28012,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519744264761188,"acs":60676,"articleLive":2,"columnArticles":725,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":93065,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5120584409086361,"acs":15351,"articleLive":2,"columnArticles":113,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29979,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4161122244488978,"acs":20764,"articleLive":2,"columnArticles":230,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49900,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4798882622226471,"acs":45181,"articleLive":2,"columnArticles":355,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":94149,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.706392712790438,"acs":155020,"articleLive":2,"columnArticles":1674,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":219453,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7574221257942394,"acs":68424,"articleLive":2,"columnArticles":485,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90338,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2812997769990443,"acs":4415,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15695,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5544686985172982,"acs":21540,"articleLive":2,"columnArticles":181,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38848,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528929097412161,"acs":6010,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23765,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5376815222834251,"acs":47245,"articleLive":2,"columnArticles":579,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87868,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4827956989247312,"acs":1796,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3720,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6897529619359718,"acs":10945,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15868,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6619290368319773,"acs":19607,"articleLive":2,"columnArticles":255,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29621,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6928761454330475,"acs":4688,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6766,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42710220872716587,"acs":8721,"articleLive":2,"columnArticles":117,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20419,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2914100907023079,"acs":51630,"articleLive":2,"columnArticles":338,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":177173,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6405268514077834,"acs":54758,"articleLive":2,"columnArticles":458,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85489,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6763864818024263,"acs":15611,"articleLive":2,"columnArticles":149,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":23080,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7268924792913967,"acs":8863,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12193,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3305622907285533,"acs":2863,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8661,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6386448463967844,"acs":33366,"articleLive":2,"columnArticles":682,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52245,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.725139514556579,"acs":10785,"articleLive":2,"columnArticles":105,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14873,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7749706916764361,"acs":13221,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17060,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5468513472600666,"acs":7225,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13212,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867458642187423,"acs":59763,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101855,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7439386530870234,"acs":62380,"articleLive":2,"columnArticles":712,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83851,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33824907829781914,"acs":5413,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16003,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5365511971472237,"acs":4213,"articleLive":2,"columnArticles":47,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7852,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4937663090750942,"acs":3406,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6898,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5464423214031086,"acs":19161,"articleLive":2,"columnArticles":237,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":35065,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32939903609717713,"acs":3349,"articleLive":2,"columnArticles":78,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10167,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5311428055605705,"acs":2942,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5539,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45255317778874843,"acs":21084,"articleLive":2,"columnArticles":292,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":46589,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7004152066433063,"acs":58367,"articleLive":2,"columnArticles":606,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":83332,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27779175050301813,"acs":2209,"articleLive":2,"columnArticles":40,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7952,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31831359231342665,"acs":11529,"articleLive":2,"columnArticles":133,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":36219,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6985671442852383,"acs":20964,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":30010,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4596580471951392,"acs":16265,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35385,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3193281332248648,"acs":6673,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20897,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4265891618226139,"acs":4550,"articleLive":2,"columnArticles":69,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10666,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5599320158405968,"acs":233579,"articleLive":2,"columnArticles":1071,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":417156,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4,"acs":1916,"articleLive":2,"columnArticles":34,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4790,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888119853505351,"acs":49154,"articleLive":2,"columnArticles":620,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126421,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46942419282844816,"acs":9465,"articleLive":2,"columnArticles":116,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20163,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44203848010482033,"acs":6410,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14501,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5702254769705145,"acs":29589,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51890,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3583992012646643,"acs":21538,"articleLive":2,"columnArticles":230,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":60095,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6345100780612839,"acs":5446,"articleLive":2,"columnArticles":103,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8583,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48274974253347064,"acs":1875,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3884,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7383109190997144,"acs":21191,"articleLive":2,"columnArticles":315,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28702,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140107866663499,"acs":90156,"articleLive":2,"columnArticles":830,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126267,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33915010502504445,"acs":6297,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18567,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35938653791536496,"acs":6327,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17605,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3876942876184494,"acs":50610,"articleLive":2,"columnArticles":680,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130541,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5232247730912973,"acs":6860,"articleLive":2,"columnArticles":126,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13111,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3373975809598127,"acs":3459,"articleLive":2,"columnArticles":70,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10252,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4185303514376997,"acs":2227,"articleLive":2,"columnArticles":43,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5321,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6444011781738306,"acs":25816,"articleLive":2,"columnArticles":233,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":40062,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449659677860557,"acs":33868,"articleLive":2,"columnArticles":343,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62147,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6654084911251833,"acs":21331,"articleLive":2,"columnArticles":272,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":32057,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6327248735429953,"acs":8631,"articleLive":2,"columnArticles":83,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13641,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7254745890874358,"acs":36458,"articleLive":2,"columnArticles":314,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":50254,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47298049032463146,"acs":23807,"articleLive":2,"columnArticles":272,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":50334,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4749922815683853,"acs":6154,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12956,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37899322362052273,"acs":1566,"articleLive":2,"columnArticles":26,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4132,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5871221311077685,"acs":12100,"articleLive":2,"columnArticles":128,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20609,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8188494697746332,"acs":97448,"articleLive":2,"columnArticles":805,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":119006,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4536074031610843,"acs":5539,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":12211,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41992317969271875,"acs":5029,"articleLive":2,"columnArticles":66,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11976,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39269599193345095,"acs":62313,"articleLive":2,"columnArticles":617,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158680,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.73033780091923,"acs":22723,"articleLive":2,"columnArticles":214,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31113,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4684863523573201,"acs":1888,"articleLive":2,"columnArticles":43,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4030,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6896172743728989,"acs":21334,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30936,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4860936216808103,"acs":35514,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":73060,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6244818003735593,"acs":27416,"articleLive":2,"columnArticles":301,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43902,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6126679642614262,"acs":26126,"articleLive":2,"columnArticles":340,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42643,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3914339774095522,"acs":6827,"articleLive":2,"columnArticles":99,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17441,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37108359405984226,"acs":8421,"articleLive":2,"columnArticles":120,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22693,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7751688393277839,"acs":9871,"articleLive":2,"columnArticles":148,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12734,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6634672354544378,"acs":11198,"articleLive":2,"columnArticles":171,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16878,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.35221702952239825,"acs":3090,"articleLive":2,"columnArticles":60,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8773,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5532056554263111,"acs":14125,"articleLive":2,"columnArticles":170,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25533,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3010948905109489,"acs":7095,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23564,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32947272173117953,"acs":3243,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9843,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4374257639563762,"acs":4051,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9261,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.360933860022283,"acs":14254,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39492,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.536279218699968,"acs":25122,"articleLive":2,"columnArticles":233,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46845,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7427805669850138,"acs":19677,"articleLive":2,"columnArticles":305,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26491,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5551257253384912,"acs":2009,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3619,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6769942366286112,"acs":36884,"articleLive":2,"columnArticles":306,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54482,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44352545032528035,"acs":13567,"articleLive":2,"columnArticles":137,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30589,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5042548980803483,"acs":2548,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5053,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4323208493069891,"acs":1466,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3391,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839922814796567,"acs":33320,"articleLive":2,"columnArticles":394,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48714,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4042080501829587,"acs":3093,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7652,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46411225040474907,"acs":7740,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16677,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4988340842621137,"acs":25243,"articleLive":2,"columnArticles":332,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50604,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6508783726989997,"acs":15487,"articleLive":2,"columnArticles":198,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23794,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41382660687593426,"acs":11074,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26760,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44044641139118723,"acs":6867,"articleLive":2,"columnArticles":108,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15591,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41146496815286626,"acs":1292,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3140,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6414189023585528,"acs":68043,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":106082,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4661557319202149,"acs":37650,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80767,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44733829421866056,"acs":3126,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6988,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972152826354885,"acs":53787,"articleLive":2,"columnArticles":502,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":90063,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7095372652758573,"acs":177026,"articleLive":2,"columnArticles":1385,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":249495,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47332940637476273,"acs":43392,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91674,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7133154452456817,"acs":8507,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11926,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7346824058459809,"acs":14377,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19569,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5322283609576427,"acs":21386,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40182,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5452802045599829,"acs":2559,"articleLive":2,"columnArticles":30,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4693,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.634115446077094,"acs":32539,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51314,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.417638417041594,"acs":9097,"articleLive":2,"columnArticles":145,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21782,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6006045860060458,"acs":16292,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27126,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6788334413480234,"acs":26186,"articleLive":2,"columnArticles":254,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":38575,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.532700228832952,"acs":23279,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43700,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4989142524230708,"acs":9420,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18881,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4713119507516617,"acs":52827,"articleLive":2,"columnArticles":596,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":112085,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5031403174793518,"acs":33566,"articleLive":2,"columnArticles":504,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66713,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5202818736306034,"acs":8786,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16887,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45292926978307363,"acs":23719,"articleLive":2,"columnArticles":274,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52368,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5571882965512734,"acs":51151,"articleLive":2,"columnArticles":810,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91802,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5095357877887035,"acs":55705,"articleLive":2,"columnArticles":1413,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":109325,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5397203885444642,"acs":21503,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39841,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4935315478892419,"acs":4349,"articleLive":2,"columnArticles":89,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8812,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5103359708355772,"acs":36957,"articleLive":2,"columnArticles":401,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":72417,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6151202749140894,"acs":7697,"articleLive":2,"columnArticles":111,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12513,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906339764322711,"acs":30535,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44213,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.41026816410726563,"acs":3580,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8726,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2923225628279481,"acs":2117,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7242,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7355072928559516,"acs":57335,"articleLive":2,"columnArticles":605,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77953,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5771428571428572,"acs":12221,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21175,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5969456268925264,"acs":68013,"articleLive":2,"columnArticles":717,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113935,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5305825536988018,"acs":26258,"articleLive":2,"columnArticles":423,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":49489,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6273732497062197,"acs":44312,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70631,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4652375009177006,"acs":6337,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13621,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7228168781253874,"acs":17490,"articleLive":2,"columnArticles":226,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":24197,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5909224657937325,"acs":16066,"articleLive":2,"columnArticles":224,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":27188,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45268192688759823,"acs":18550,"articleLive":2,"columnArticles":247,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40978,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6262750361346273,"acs":60661,"articleLive":2,"columnArticles":583,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96860,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3346708599934931,"acs":3086,"articleLive":2,"columnArticles":66,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9221,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3969675272711957,"acs":47126,"articleLive":2,"columnArticles":924,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118715,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5510690859528069,"acs":38814,"articleLive":2,"columnArticles":459,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":70434,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3548551093035079,"acs":4886,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13769,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5824065836298933,"acs":5237,"articleLive":2,"columnArticles":81,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8992,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.560510557831705,"acs":3557,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6346,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5163826845102772,"acs":44065,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85334,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5989879078525405,"acs":20359,"articleLive":2,"columnArticles":265,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33989,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5373850459816074,"acs":9408,"articleLive":2,"columnArticles":139,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17507,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830535506717488,"acs":57935,"articleLive":2,"columnArticles":657,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73986,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7044338456103162,"acs":19939,"articleLive":2,"columnArticles":268,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28305,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5641937267914988,"acs":7141,"articleLive":2,"columnArticles":157,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12657,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5568886156300371,"acs":33513,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":60179,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095808383233533,"acs":75603,"articleLive":2,"columnArticles":651,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106546,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.671430488459474,"acs":10007,"articleLive":2,"columnArticles":170,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14904,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4344671201814059,"acs":13412,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30870,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319324712643678,"acs":20377,"articleLive":2,"columnArticles":426,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27840,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6561796007146741,"acs":16894,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25746,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105097214923805,"acs":40563,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57090,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5675769901220221,"acs":4884,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8605,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3977857476999844,"acs":2551,"articleLive":2,"columnArticles":43,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6413,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39087195879950276,"acs":11005,"articleLive":2,"columnArticles":168,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28155,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4328013843491636,"acs":4502,"articleLive":2,"columnArticles":99,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10402,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6338432122370937,"acs":35802,"articleLive":2,"columnArticles":389,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56484,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.30066018705299835,"acs":3279,"articleLive":2,"columnArticles":56,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10906,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43842743394860656,"acs":9691,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22104,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7936651301856236,"acs":25483,"articleLive":2,"columnArticles":321,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":32108,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5551219512195122,"acs":4552,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8200,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5210825652088645,"acs":2657,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5099,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.483056154756106,"acs":6942,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14371,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5303831822990938,"acs":11530,"articleLive":2,"columnArticles":153,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21739,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6907630522088354,"acs":7740,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11205,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20908333635145412,"acs":5773,"articleLive":2,"columnArticles":73,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27611,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6403331082601845,"acs":8535,"articleLive":2,"columnArticles":106,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13329,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599340725202277,"acs":66066,"articleLive":2,"columnArticles":918,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":100110,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7247856295543128,"acs":106924,"articleLive":2,"columnArticles":989,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":147525,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4567453393332721,"acs":9947,"articleLive":2,"columnArticles":138,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21778,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6454537348036739,"acs":43430,"articleLive":2,"columnArticles":404,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":67286,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7583085563263958,"acs":11477,"articleLive":2,"columnArticles":54,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15135,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7534983593900791,"acs":31231,"articleLive":2,"columnArticles":372,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41448,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5813350381163755,"acs":48195,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82904,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4581765112527844,"acs":5965,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13019,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3763115606390018,"acs":7962,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21158,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.587210748942523,"acs":4720,"articleLive":2,"columnArticles":89,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":8038,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.41030281095427673,"acs":3401,"articleLive":2,"columnArticles":66,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8289,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4661997563946407,"acs":3062,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6568,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3425287356321839,"acs":1341,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3915,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36321656050955414,"acs":2281,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6280,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5302280680584047,"acs":4394,"articleLive":2,"columnArticles":64,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8287,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6061985262245341,"acs":2797,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4614,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5435290453200436,"acs":3490,"articleLive":2,"columnArticles":49,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6421,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7066666666666667,"acs":1855,"articleLive":2,"columnArticles":40,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2625,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6507507101312052,"acs":4811,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7393,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5429393536963258,"acs":2453,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4518,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4747126436781609,"acs":2065,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4350,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42333163525216505,"acs":831,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1963,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8644012522828072,"acs":13253,"articleLive":2,"columnArticles":64,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15332,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8188389923329682,"acs":11214,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13695,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4809848854217455,"acs":7892,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16408,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866754550524768,"acs":34713,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59169,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5799198187205856,"acs":3327,"articleLive":2,"columnArticles":55,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5737,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33402346445824704,"acs":2420,"articleLive":2,"columnArticles":54,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7245,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6693525075878017,"acs":18525,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27676,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6947337962962963,"acs":9604,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13824,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4961080146069575,"acs":10325,"articleLive":2,"columnArticles":88,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20812,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7206916207486225,"acs":7586,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10526,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6220820189274447,"acs":11832,"articleLive":2,"columnArticles":187,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":19020,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7345527404343329,"acs":11365,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15472,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49100553505535055,"acs":4258,"articleLive":2,"columnArticles":93,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8672,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5705187231430325,"acs":14870,"articleLive":2,"columnArticles":151,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":26064,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7609543321657525,"acs":11514,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15131,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5286418155576569,"acs":10622,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":20093,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5372055535333576,"acs":10331,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19231,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7729304107256864,"acs":3632,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4699,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6906388107673764,"acs":5157,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7467,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5344424985405721,"acs":1831,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3426,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4510474561778538,"acs":1055,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2339,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5850123293438383,"acs":19454,"articleLive":2,"columnArticles":292,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33254,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5450637825845812,"acs":3931,"articleLive":2,"columnArticles":80,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7212,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.378778006781464,"acs":28486,"articleLive":2,"columnArticles":289,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":75205,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4899017972947934,"acs":2644,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5397,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37860798362333675,"acs":3699,"articleLive":2,"columnArticles":60,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9770,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6080558925281934,"acs":27067,"articleLive":2,"columnArticles":379,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44514,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37280247215993667,"acs":19785,"articleLive":2,"columnArticles":386,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":53071,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5482084690553746,"acs":1683,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3070,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5203442225749854,"acs":6228,"articleLive":2,"columnArticles":111,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11969,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4736707402904856,"acs":7403,"articleLive":2,"columnArticles":103,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15629,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5805684385777143,"acs":4882,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8409,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.700584954427969,"acs":5150,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7351,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6673124827013562,"acs":2411,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3613,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36970412557299626,"acs":5323,"articleLive":2,"columnArticles":68,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14398,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6365696139299222,"acs":35681,"articleLive":2,"columnArticles":1106,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":56052,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7608095920207969,"acs":28681,"articleLive":2,"columnArticles":673,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37698,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5592233009708738,"acs":5184,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9270,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5772048846675712,"acs":4254,"articleLive":2,"columnArticles":126,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7370,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4120747778118296,"acs":6723,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16315,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8394656345589613,"acs":67237,"articleLive":2,"columnArticles":686,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":80095,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5772341762211403,"acs":58804,"articleLive":2,"columnArticles":589,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101872,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6301849075462269,"acs":11349,"articleLive":2,"columnArticles":205,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":18009,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713018789676843,"acs":24178,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31347,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6453355846348671,"acs":7644,"articleLive":2,"columnArticles":87,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11845,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5409133416458853,"acs":6941,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12832,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6536457240679047,"acs":77893,"articleLive":2,"columnArticles":584,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":119167,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5614945578319335,"acs":43385,"articleLive":2,"columnArticles":480,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":77267,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5200200542375971,"acs":22819,"articleLive":2,"columnArticles":372,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43881,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5212235266003524,"acs":17449,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33477,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6428766003813675,"acs":2360,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3671,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.866846697133361,"acs":8346,"articleLive":2,"columnArticles":146,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9628,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6105625717566016,"acs":2659,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4355,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5751565762004175,"acs":1102,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1916,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068392627147079,"acs":65307,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92393,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7028541864275244,"acs":8151,"articleLive":2,"columnArticles":106,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11597,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31846108110786303,"acs":12855,"articleLive":2,"columnArticles":134,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40366,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4913806992105687,"acs":3050,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6207,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6937923250564334,"acs":6147,"articleLive":2,"columnArticles":94,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8860,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41336942940441485,"acs":3970,"articleLive":2,"columnArticles":74,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9604,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5449901193003001,"acs":37231,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68315,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3799816905706439,"acs":6226,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16385,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6292253894246053,"acs":5938,"articleLive":2,"columnArticles":104,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9437,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4556047197640118,"acs":3089,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6780,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3900616016427105,"acs":4749,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12175,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6484596897531134,"acs":2968,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4577,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7765540871267743,"acs":3173,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4086,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.536344449134656,"acs":6353,"articleLive":2,"columnArticles":73,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11845,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5694331983805668,"acs":2813,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4940,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.608451604070643,"acs":79998,"articleLive":2,"columnArticles":880,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":131478,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43288190302434915,"acs":6169,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14251,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47839943342776203,"acs":9457,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19768,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6519066372106426,"acs":6787,"articleLive":2,"columnArticles":96,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10411,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5098954633106668,"acs":10048,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19706,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3706643934146731,"acs":6957,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18769,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6371603856266433,"acs":168664,"articleLive":2,"columnArticles":1138,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":264712,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.442040449822551,"acs":10338,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23387,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46918292338139667,"acs":6638,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14148,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2874450084602369,"acs":4247,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14775,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5619203491543917,"acs":4120,"articleLive":2,"columnArticles":83,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7332,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7145071578371478,"acs":7836,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10967,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4422027451628907,"acs":5348,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12094,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6041453428863869,"acs":4722,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7816,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4867846472075385,"acs":4236,"articleLive":2,"columnArticles":62,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8702,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3877551020408163,"acs":1387,"articleLive":2,"columnArticles":33,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3577,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37109375,"acs":1710,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4608,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5690776584907139,"acs":14524,"articleLive":2,"columnArticles":225,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25522,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47849619660620246,"acs":9813,"articleLive":2,"columnArticles":127,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20508,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4309006211180124,"acs":4995,"articleLive":2,"columnArticles":86,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11592,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32075275525057184,"acs":3085,"articleLive":2,"columnArticles":47,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9618,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5501146903360925,"acs":5516,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":10027,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4879479658206861,"acs":3826,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7841,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6870017969865917,"acs":59640,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86812,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6336746302616609,"acs":10583,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16701,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4695579955298802,"acs":38446,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81877,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26762589928057556,"acs":5952,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22240,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6078660023322379,"acs":5734,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9433,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8372732270478285,"acs":7615,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9095,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48422741044377116,"acs":2717,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5611,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43454915756341417,"acs":2347,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5401,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5688793718772306,"acs":1594,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2802,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224899980948752,"acs":6771,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20996,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6167602785890811,"acs":13726,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22255,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47501366867140515,"acs":13032,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27435,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2674667809687098,"acs":2496,"articleLive":2,"columnArticles":55,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9332,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7570389707253403,"acs":8120,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10726,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6190777005685407,"acs":4900,"articleLive":2,"columnArticles":62,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7915,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4918098818474758,"acs":7326,"articleLive":2,"columnArticles":114,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14896,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45072177796240526,"acs":4340,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9629,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2657393850658858,"acs":6171,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23222,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46209825642044605,"acs":18605,"articleLive":2,"columnArticles":184,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40262,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6367656479242866,"acs":30815,"articleLive":2,"columnArticles":185,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48393,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7765404602821084,"acs":3138,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4041,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37285180572851806,"acs":1497,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4015,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3987611304684475,"acs":2060,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5166,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.599444958371878,"acs":648,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1081,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5850957136004884,"acs":13418,"articleLive":2,"columnArticles":263,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22933,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6078019908528383,"acs":11296,"articleLive":2,"columnArticles":205,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18585,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39392511128567687,"acs":7522,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19095,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4415246212121212,"acs":1865,"articleLive":2,"columnArticles":33,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4224,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6941624365482234,"acs":3282,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4728,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6457007593224507,"acs":21004,"articleLive":2,"columnArticles":328,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32529,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.65098636474662,"acs":45308,"articleLive":2,"columnArticles":616,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69599,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2674103373183414,"acs":6017,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22501,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4987792117195675,"acs":4290,"articleLive":2,"columnArticles":50,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8601,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.601271277741866,"acs":5581,"articleLive":2,"columnArticles":73,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9282,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5060722960422918,"acs":3542,"articleLive":2,"columnArticles":64,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6999,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6371895544192842,"acs":13957,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21904,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6940283602955862,"acs":3475,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":5007,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.370446421781124,"acs":4871,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13149,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.746360153256705,"acs":3896,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5220,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4377581120943953,"acs":742,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1695,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6855211396707788,"acs":17949,"articleLive":2,"columnArticles":253,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26183,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.247406257658688,"acs":6057,"articleLive":2,"columnArticles":87,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24482,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032437788621534,"acs":26917,"articleLive":2,"columnArticles":297,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53487,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6216354518473033,"acs":12148,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19542,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7262103505843072,"acs":5655,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7787,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46804283986871653,"acs":5419,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11578,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6128406385042773,"acs":6949,"articleLive":2,"columnArticles":91,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11339,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7305580914125738,"acs":60019,"articleLive":2,"columnArticles":834,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82155,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49693693317609244,"acs":47616,"articleLive":2,"columnArticles":614,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95819,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5287077189939289,"acs":12192,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":23060,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4489727180868979,"acs":2666,"articleLive":2,"columnArticles":55,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5938,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6556783031374281,"acs":7419,"articleLive":2,"columnArticles":62,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11315,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5097662179941301,"acs":5037,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9881,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7756936303243455,"acs":5955,"articleLive":2,"columnArticles":126,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7677,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6350666416369438,"acs":3383,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5327,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4118757868233319,"acs":1963,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4766,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5384057971014493,"acs":1486,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2760,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.694141516611717,"acs":21896,"articleLive":2,"columnArticles":357,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31544,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4227481919789612,"acs":8359,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19773,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6304302531513699,"acs":12103,"articleLive":2,"columnArticles":173,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19198,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5268759261754008,"acs":3911,"articleLive":2,"columnArticles":75,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7423,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439571085716802,"acs":76660,"articleLive":2,"columnArticles":1111,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90834,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6723705224731918,"acs":5894,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8766,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4746118338229123,"acs":3393,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7149,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32705752059251053,"acs":4725,"articleLive":2,"columnArticles":70,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14447,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5377841818764009,"acs":3359,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6246,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5965632984319423,"acs":11908,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19961,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6622473090049882,"acs":10090,"articleLive":2,"columnArticles":158,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15236,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5401396160558464,"acs":3095,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5730,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4193216855087359,"acs":2448,"articleLive":2,"columnArticles":45,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5838,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49550260375572036,"acs":3140,"articleLive":2,"columnArticles":63,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6337,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5649852724594993,"acs":3069,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5432,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4695524374688037,"acs":33866,"articleLive":2,"columnArticles":422,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72124,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4826534274434741,"acs":8069,"articleLive":2,"columnArticles":117,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16718,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3441154226540229,"acs":5915,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17189,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46294826466556027,"acs":6416,"articleLive":2,"columnArticles":111,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13859,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5630331753554503,"acs":1188,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2110,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.71081307627829,"acs":10176,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14316,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6600209863588667,"acs":3145,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4765,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4911138359195524,"acs":34846,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70953,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4956622325043378,"acs":2571,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5187,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5934188510875628,"acs":6384,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10758,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4720965309200603,"acs":1252,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2652,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5412767727178207,"acs":2603,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4809,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.621608040201005,"acs":2474,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3980,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5104032142344669,"acs":3557,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6969,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4808475957620212,"acs":2950,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6135,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6174581892597558,"acs":8750,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14171,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5597562531904032,"acs":35090,"articleLive":2,"columnArticles":482,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62688,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5754173141510852,"acs":22958,"articleLive":2,"columnArticles":321,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39898,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5617283950617284,"acs":2730,"articleLive":2,"columnArticles":39,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4860,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.771652789740645,"acs":8063,"articleLive":2,"columnArticles":96,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10449,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.74863523573201,"acs":18102,"articleLive":2,"columnArticles":317,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24180,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3941573033707865,"acs":5262,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13350,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5990952439173494,"acs":14700,"articleLive":2,"columnArticles":230,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24537,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6822408709457927,"acs":3008,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4409,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6678230702515178,"acs":1540,"articleLive":2,"columnArticles":37,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2306,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5636531365313653,"acs":1833,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3252,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5558558558558558,"acs":1234,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2220,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4798455225681873,"acs":1988,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4143,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6047860768672951,"acs":12510,"articleLive":2,"columnArticles":254,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20685,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7293964957819598,"acs":7868,"articleLive":2,"columnArticles":100,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10787,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5250469755727022,"acs":13133,"articleLive":2,"columnArticles":202,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":25013,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41996511471890513,"acs":3130,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7453,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.568105152960335,"acs":4884,"articleLive":2,"columnArticles":86,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8597,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9225398936170213,"acs":2775,"articleLive":2,"columnArticles":68,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":3008,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8241897320200298,"acs":29956,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36346,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.607225656877898,"acs":9429,"articleLive":2,"columnArticles":147,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15528,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5856903948229477,"acs":8055,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13753,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49150641286148544,"acs":30236,"articleLive":2,"columnArticles":321,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61517,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8013068409121216,"acs":6009,"articleLive":2,"columnArticles":85,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7499,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5073180787466501,"acs":2461,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4851,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5194471231115397,"acs":1616,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3111,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.543448275862069,"acs":1576,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2900,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6031843233312921,"acs":985,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1633,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5425890438115377,"acs":8211,"articleLive":2,"columnArticles":170,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15133,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5017226858586632,"acs":6553,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13061,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7252714113389626,"acs":19240,"articleLive":2,"columnArticles":237,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26528,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5981354268891069,"acs":3657,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6114,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6211590820692338,"acs":1597,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2571,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5057995958991245,"acs":6759,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13363,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318265007320644,"acs":45451,"articleLive":2,"columnArticles":620,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54640,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.810717988595127,"acs":12511,"articleLive":2,"columnArticles":230,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15432,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41740632632394115,"acs":7007,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16787,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6616865029121296,"acs":2613,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3949,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8108751373123398,"acs":4429,"articleLive":2,"columnArticles":61,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5462,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.645861418172014,"acs":4791,"articleLive":2,"columnArticles":94,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7418,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6032920216886135,"acs":15577,"articleLive":2,"columnArticles":218,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25820,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.562953251116483,"acs":13740,"articleLive":2,"columnArticles":170,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24407,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6265822784810127,"acs":6633,"articleLive":2,"columnArticles":99,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10586,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8085408720364969,"acs":54055,"articleLive":2,"columnArticles":703,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66855,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.518935215824693,"acs":7057,"articleLive":2,"columnArticles":157,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13599,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.47072944091683444,"acs":6079,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12914,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.36037852514987767,"acs":13405,"articleLive":2,"columnArticles":128,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37197,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6557896699608428,"acs":7034,"articleLive":2,"columnArticles":73,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10726,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8080210498089428,"acs":48213,"articleLive":2,"columnArticles":639,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59668,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4546146638557039,"acs":7763,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17076,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45902218454147237,"acs":6497,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14154,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5967631638933212,"acs":2618,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4387,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7866608229349283,"acs":30513,"articleLive":2,"columnArticles":434,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38788,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4662990668620344,"acs":24186,"articleLive":2,"columnArticles":365,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51868,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3617614269788183,"acs":3245,"articleLive":2,"columnArticles":79,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8970,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8195170115604559,"acs":19920,"articleLive":2,"columnArticles":295,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24307,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8219127547726643,"acs":8912,"articleLive":2,"columnArticles":84,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10843,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7236529989833954,"acs":21355,"articleLive":2,"columnArticles":384,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29510,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7474797636192084,"acs":15052,"articleLive":2,"columnArticles":227,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20137,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5754308932433319,"acs":17561,"articleLive":2,"columnArticles":273,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30518,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3306408185245019,"acs":1842,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5571,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7510874140592114,"acs":5353,"articleLive":2,"columnArticles":61,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7127,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7559394269133116,"acs":16673,"articleLive":2,"columnArticles":289,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22056,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.712978976901495,"acs":37102,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52038,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37825702428736646,"acs":5560,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14699,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6666251944012441,"acs":10716,"articleLive":2,"columnArticles":154,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":16075,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8320806164789567,"acs":35093,"articleLive":2,"columnArticles":546,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42175,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7401530707485533,"acs":11895,"articleLive":2,"columnArticles":194,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":16071,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8097901219052407,"acs":12887,"articleLive":2,"columnArticles":264,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15914,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44025851197982346,"acs":2793,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6344,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6149370125974805,"acs":10251,"articleLive":2,"columnArticles":194,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16670,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6548013245033113,"acs":6328,"articleLive":2,"columnArticles":114,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9664,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6167021424734926,"acs":31001,"articleLive":2,"columnArticles":513,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50269,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5891968727789624,"acs":2487,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4221,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6132466814159292,"acs":4435,"articleLive":2,"columnArticles":78,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7232,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5932165816892042,"acs":5352,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":9022,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.755139149998459,"acs":24502,"articleLive":2,"columnArticles":479,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32447,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5894204049225883,"acs":5939,"articleLive":2,"columnArticles":116,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10076,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7276975361087511,"acs":10278,"articleLive":2,"columnArticles":183,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14124,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4726319239593576,"acs":5768,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12204,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6885817457352758,"acs":5530,"articleLive":2,"columnArticles":53,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":8031,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46292134831460674,"acs":5974,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12905,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7715479331574319,"acs":7018,"articleLive":2,"columnArticles":158,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9096,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3785529715762274,"acs":1172,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3096,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5357496623142729,"acs":11899,"articleLive":2,"columnArticles":203,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22210,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6874367500361428,"acs":9510,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13834,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5440694310511089,"acs":5642,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10370,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4904683860950574,"acs":5686,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11593,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5860349127182045,"acs":3525,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6015,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42169523362291617,"acs":1796,"articleLive":2,"columnArticles":49,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4259,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7055484244210222,"acs":39026,"articleLive":2,"columnArticles":626,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55313,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6401773773491941,"acs":9095,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14207,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3988461355075573,"acs":8365,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20973,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5738562091503268,"acs":4390,"articleLive":2,"columnArticles":96,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7650,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4799326410328375,"acs":3420,"articleLive":2,"columnArticles":49,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7126,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8205233192949618,"acs":42083,"articleLive":2,"columnArticles":642,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51288,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5449832136330798,"acs":12824,"articleLive":2,"columnArticles":214,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23531,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5932685703071338,"acs":6046,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10191,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3665368672277352,"acs":5836,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15922,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4351363236587511,"acs":15832,"articleLive":2,"columnArticles":268,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36384,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7406291203616501,"acs":7864,"articleLive":2,"columnArticles":117,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10618,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.306570707542761,"acs":3280,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10699,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5067567567567568,"acs":3150,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6216,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8484483278095812,"acs":8448,"articleLive":2,"columnArticles":86,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9957,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7546525740871852,"acs":29845,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39548,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.445095168374817,"acs":6688,"articleLive":2,"columnArticles":73,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15026,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28531385999852477,"acs":11604,"articleLive":2,"columnArticles":156,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40671,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2813165537270087,"acs":2906,"articleLive":2,"columnArticles":72,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10330,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.660927378111149,"acs":3877,"articleLive":2,"columnArticles":59,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5866,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.73165718655896,"acs":45921,"articleLive":2,"columnArticles":509,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62763,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5315700764942305,"acs":4100,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7713,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4959059233449477,"acs":5693,"articleLive":2,"columnArticles":112,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11480,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5500484027105518,"acs":2841,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5165,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5056133544936225,"acs":8602,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":17013,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4014532243415077,"acs":7514,"articleLive":2,"columnArticles":202,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18717,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5246240047183721,"acs":5337,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10173,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36450381679389315,"acs":4966,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13624,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6744557619332934,"acs":3377,"articleLive":2,"columnArticles":65,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":5007,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8249842881314963,"acs":85324,"articleLive":2,"columnArticles":1090,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103425,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5383859755176061,"acs":7125,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13234,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41801461532145495,"acs":15273,"articleLive":2,"columnArticles":223,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36537,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5253348864298194,"acs":3608,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6868,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6063288338127905,"acs":2740,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4519,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7901352060908375,"acs":48154,"articleLive":2,"columnArticles":580,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60944,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5801095935225321,"acs":21279,"articleLive":2,"columnArticles":267,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36681,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5134223998002247,"acs":8224,"articleLive":2,"columnArticles":163,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16018,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4050585126462816,"acs":7511,"articleLive":2,"columnArticles":168,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18543,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7397302001740644,"acs":16999,"articleLive":2,"columnArticles":227,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22980,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5747521480502313,"acs":8696,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15130,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5035342758068818,"acs":7551,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14996,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32435353145503665,"acs":4202,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12955,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8615604186489058,"acs":7244,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8408,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8374016380279429,"acs":10429,"articleLive":2,"columnArticles":164,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12454,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.728202672702738,"acs":16729,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22973,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7317762753534112,"acs":11906,"articleLive":2,"columnArticles":158,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16270,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6932473910374463,"acs":11293,"articleLive":2,"columnArticles":176,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16290,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.323185341789993,"acs":4586,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14190,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5446575342465754,"acs":1988,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3650,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7008257680668821,"acs":13664,"articleLive":2,"columnArticles":204,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19497,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31261136408631957,"acs":6316,"articleLive":2,"columnArticles":131,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20204,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6955877162019061,"acs":9853,"articleLive":2,"columnArticles":172,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14165,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5425231243576567,"acs":4223,"articleLive":2,"columnArticles":54,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7784,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8312606825013261,"acs":28208,"articleLive":2,"columnArticles":482,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33934,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35435435435435436,"acs":6372,"articleLive":2,"columnArticles":116,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17982,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3999162979791941,"acs":6689,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16726,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.405308831036243,"acs":7940,"articleLive":2,"columnArticles":145,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19590,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8558295027162558,"acs":4096,"articleLive":2,"columnArticles":62,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4786,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6654928214852366,"acs":17197,"articleLive":2,"columnArticles":277,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25841,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7484144871324493,"acs":14279,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19079,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4129121421520237,"acs":10457,"articleLive":2,"columnArticles":145,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":25325,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3740430185927816,"acs":1026,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2743,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7616733206040618,"acs":4388,"articleLive":2,"columnArticles":67,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5761,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6713261903072447,"acs":9461,"articleLive":2,"columnArticles":153,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14093,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6054299598563279,"acs":5731,"articleLive":2,"columnArticles":98,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9466,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4174272978136277,"acs":3933,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9422,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7532892175943947,"acs":9676,"articleLive":2,"columnArticles":178,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12845,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912589441113904,"acs":21447,"articleLive":2,"columnArticles":363,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":31026,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49291166848418755,"acs":7232,"articleLive":2,"columnArticles":154,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14672,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5086191416771413,"acs":5665,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11138,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5684971435233764,"acs":4876,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8577,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6668935783980032,"acs":5878,"articleLive":2,"columnArticles":67,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8814,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.61459380425843,"acs":13451,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21886,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8068780439320147,"acs":8118,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10061,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47517685297304185,"acs":7456,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15691,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5506293310705699,"acs":7787,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14142,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5524177949709864,"acs":2856,"articleLive":2,"columnArticles":68,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5170,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6937741465577301,"acs":10954,"articleLive":2,"columnArticles":226,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15789,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.604002277719027,"acs":7425,"articleLive":2,"columnArticles":149,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12293,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6843410852713179,"acs":6621,"articleLive":2,"columnArticles":181,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9675,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4086566299942096,"acs":2823,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6908,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5192978237345196,"acs":12957,"articleLive":2,"columnArticles":184,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24951,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327345140242353,"acs":25941,"articleLive":2,"columnArticles":416,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35403,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4190138984304814,"acs":7929,"articleLive":2,"columnArticles":154,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18923,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5993159052040068,"acs":2453,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4093,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7487220877051386,"acs":2783,"articleLive":2,"columnArticles":35,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3717,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5406991579484562,"acs":10595,"articleLive":2,"columnArticles":196,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19595,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541537052535174,"acs":35094,"articleLive":2,"columnArticles":511,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63329,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39847984916332785,"acs":6763,"articleLive":2,"columnArticles":147,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16972,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4398854961832061,"acs":3227,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7336,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7094918504314478,"acs":1480,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2086,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6564132327336042,"acs":1131,"articleLive":2,"columnArticles":45,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1723,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5958721704394141,"acs":895,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1502,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5057276198557489,"acs":1192,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2357,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5836768342951361,"acs":708,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1213,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462531743640511,"acs":78644,"articleLive":2,"columnArticles":1033,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92932,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39414218668520773,"acs":4535,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11506,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6411970709964979,"acs":6042,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9423,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4662297469506645,"acs":2561,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5493,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6184601664684899,"acs":4161,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6728,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8216790448434709,"acs":43701,"articleLive":2,"columnArticles":648,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":53185,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5861089450818759,"acs":10523,"articleLive":2,"columnArticles":177,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17954,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4832256933282679,"acs":33071,"articleLive":2,"columnArticles":466,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68438,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5628291948833709,"acs":3740,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6645,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6989835809225958,"acs":2682,"articleLive":2,"columnArticles":37,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3837,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.647971831997988,"acs":18035,"articleLive":2,"columnArticles":379,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27833,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7915602189781021,"acs":34702,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43840,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4105079572705472,"acs":5649,"articleLive":2,"columnArticles":141,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13761,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5269568690095847,"acs":2639,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5008,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8574185248713551,"acs":3999,"articleLive":2,"columnArticles":53,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4664,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729964610491421,"acs":12791,"articleLive":2,"columnArticles":218,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22323,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6177175612298071,"acs":5927,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9595,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.711683053788317,"acs":9844,"articleLive":2,"columnArticles":159,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13832,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276195185030237,"acs":16502,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26293,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.802679254063757,"acs":24147,"articleLive":2,"columnArticles":343,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30083,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5232268768145998,"acs":10092,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19288,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4989547621038548,"acs":5967,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11959,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3647111309391033,"acs":1635,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4483,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.396630451897339,"acs":5038,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12702,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6330984434160707,"acs":12039,"articleLive":2,"columnArticles":206,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":19016,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5237508186616328,"acs":13595,"articleLive":2,"columnArticles":211,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25957,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6319829086880836,"acs":7987,"articleLive":2,"columnArticles":140,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12638,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4423485027116246,"acs":5628,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12723,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5969799531372039,"acs":2293,"articleLive":2,"columnArticles":48,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3841,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7448095629869815,"acs":15390,"articleLive":2,"columnArticles":312,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20663,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.501693193362682,"acs":5926,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11812,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4275505342680188,"acs":6282,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14693,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5918367346938775,"acs":2697,"articleLive":2,"columnArticles":65,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4557,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7675896374248828,"acs":26696,"articleLive":2,"columnArticles":372,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34779,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30991095625241966,"acs":6404,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20664,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48321741759903236,"acs":6392,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13228,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6186755952380952,"acs":1663,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2688,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7005623242736645,"acs":2990,"articleLive":2,"columnArticles":51,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4268,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7957066189624329,"acs":2224,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2795,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8427994912299985,"acs":53672,"articleLive":2,"columnArticles":730,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63683,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5447733783883053,"acs":7416,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13613,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6181763193709361,"acs":8176,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13226,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.674350959451246,"acs":15533,"articleLive":2,"columnArticles":166,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23034,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7175908923980904,"acs":1954,"articleLive":2,"columnArticles":63,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2723,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7216603053435114,"acs":15126,"articleLive":2,"columnArticles":233,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20960,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8652782519631274,"acs":12672,"articleLive":2,"columnArticles":118,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14645,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.291358024691358,"acs":4956,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":17010,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5807433166702891,"acs":2672,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4601,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5678233438485805,"acs":1980,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3487,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8691967749553015,"acs":128828,"articleLive":2,"columnArticles":1290,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":148215,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5145528044466903,"acs":10183,"articleLive":2,"columnArticles":147,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19790,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5866265400169284,"acs":31188,"articleLive":2,"columnArticles":405,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53165,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3003653212153613,"acs":3371,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11223,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8087044534412956,"acs":799,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":988,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6596776988390227,"acs":3807,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5771,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8582584032345664,"acs":71111,"articleLive":2,"columnArticles":685,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82855,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3112957610789981,"acs":7755,"articleLive":2,"columnArticles":107,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24912,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23700394898685828,"acs":7322,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30894,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.691019968910678,"acs":11558,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16726,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8550106609808102,"acs":1203,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1407,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.671563025210084,"acs":19979,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29750,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.660929599377674,"acs":6797,"articleLive":2,"columnArticles":80,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10284,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.567155510381879,"acs":7812,"articleLive":2,"columnArticles":148,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13774,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3714987714987715,"acs":2268,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6105,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5422161794697484,"acs":3988,"articleLive":2,"columnArticles":38,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7355,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5367815531614099,"acs":11011,"articleLive":2,"columnArticles":167,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20513,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3913448115402513,"acs":8410,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21490,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3343110374290633,"acs":5243,"articleLive":2,"columnArticles":67,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15683,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3745008949469916,"acs":2720,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7263,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.302960399846213,"acs":788,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2601,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5907468227902327,"acs":4137,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":7003,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7165223746345851,"acs":25491,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35576,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5130980861244019,"acs":8579,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16720,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5950881109959333,"acs":7463,"articleLive":2,"columnArticles":135,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12541,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3614694948611415,"acs":3306,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9146,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.84,"acs":588,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":700,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5900609866553952,"acs":9772,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16561,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.552579185520362,"acs":6106,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11050,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5477941176470589,"acs":5215,"articleLive":2,"columnArticles":78,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9520,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5771059782608695,"acs":5097,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8832,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6779606324620845,"acs":4202,"articleLive":2,"columnArticles":60,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6198,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488756184459157,"acs":58850,"articleLive":2,"columnArticles":749,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69327,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3800232765112617,"acs":11102,"articleLive":2,"columnArticles":151,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29214,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.32499694513461774,"acs":7979,"articleLive":2,"columnArticles":140,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24551,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34291938997821353,"acs":3148,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9180,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7331353415358507,"acs":3456,"articleLive":2,"columnArticles":36,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4714,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6743194755442846,"acs":24995,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":37067,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2978287807768978,"acs":5528,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18561,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33306857294148795,"acs":2516,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7554,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39682777195870117,"acs":2652,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6683,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7128060263653484,"acs":757,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1062,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5776757532281205,"acs":10066,"articleLive":2,"columnArticles":173,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17425,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42981345488309275,"acs":5092,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11847,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.661798709991481,"acs":5438,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8217,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6170254023657165,"acs":3182,"articleLive":2,"columnArticles":51,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5157,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5016662038322688,"acs":3613,"articleLive":2,"columnArticles":37,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7202,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7852154123832692,"acs":30018,"articleLive":2,"columnArticles":361,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38229,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6910921766072812,"acs":8922,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12910,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5677222186097926,"acs":8731,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15379,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3295272078501338,"acs":1847,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5605,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6147727272727272,"acs":2705,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4400,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6205450733752621,"acs":296,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":477,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7887124090264109,"acs":17231,"articleLive":2,"columnArticles":161,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21847,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4533821466452253,"acs":13251,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29227,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4403168825607537,"acs":4113,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9341,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36703044227455484,"acs":4473,"articleLive":2,"columnArticles":89,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12187,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.602803738317757,"acs":129,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":214,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5388471177944862,"acs":16555,"articleLive":2,"columnArticles":248,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30723,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31751206154648587,"acs":4870,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15338,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.46140836408364083,"acs":6002,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":13008,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.385771235817234,"acs":2516,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6522,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5516601743646818,"acs":2974,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5391,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5468999284810475,"acs":19882,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36354,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5541537553489745,"acs":7511,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13554,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41460099152406843,"acs":5185,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12506,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5369100975481149,"acs":4073,"articleLive":2,"columnArticles":71,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7586,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7134387351778656,"acs":361,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":506,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6638023630504833,"acs":2472,"articleLive":2,"columnArticles":48,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3724,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6588398642394323,"acs":21353,"articleLive":2,"columnArticles":290,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32410,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8166545454545454,"acs":11229,"articleLive":2,"columnArticles":153,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13750,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.510390551005627,"acs":9161,"articleLive":2,"columnArticles":124,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17949,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29573973072962356,"acs":7754,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26219,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7068062827225131,"acs":540,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":764,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4379666858127513,"acs":3050,"articleLive":2,"columnArticles":58,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6964,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5786882642528188,"acs":10932,"articleLive":2,"columnArticles":168,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18891,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7687324760707726,"acs":7951,"articleLive":2,"columnArticles":109,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10343,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6220527045769764,"acs":4485,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7210,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36732993020106264,"acs":3526,"articleLive":2,"columnArticles":64,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9599,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5723697213255156,"acs":8688,"articleLive":2,"columnArticles":91,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15179,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7793549246967879,"acs":11695,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15006,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3094701649829203,"acs":4258,"articleLive":2,"columnArticles":87,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13759,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3791036254638881,"acs":3984,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10509,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5456039441248973,"acs":664,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1217,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7236668135742618,"acs":3284,"articleLive":2,"columnArticles":41,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4538,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44628423888639424,"acs":7951,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17816,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39996950754688215,"acs":13117,"articleLive":2,"columnArticles":209,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":32795,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45573192239858906,"acs":2584,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5670,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4739249771271729,"acs":2072,"articleLive":2,"columnArticles":46,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4372,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8947922146238821,"acs":1701,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1901,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7577831750938397,"acs":3432,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4529,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049190666386378,"acs":19145,"articleLive":2,"columnArticles":322,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23785,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2951338520374522,"acs":4476,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15166,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3268654684095861,"acs":4801,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14688,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5965575146935348,"acs":4263,"articleLive":2,"columnArticles":68,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7146,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4764660799704009,"acs":18029,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37839,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3256167945709393,"acs":5134,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15767,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5826133333333333,"acs":10924,"articleLive":2,"columnArticles":204,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18750,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6191409251575226,"acs":16115,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26028,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.636568848758465,"acs":282,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":443,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8047608148317693,"acs":3516,"articleLive":2,"columnArticles":48,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4369,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6708585077982296,"acs":9549,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14234,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6854229330203213,"acs":18686,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27262,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6632712530089954,"acs":26176,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39465,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299891735835438,"acs":2383,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5542,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6258064516129033,"acs":388,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":620,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8246691871455577,"acs":3490,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4232,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8389137684611719,"acs":44022,"articleLive":2,"columnArticles":700,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52475,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2938676381299332,"acs":3872,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13176,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2687049830956931,"acs":3656,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13606,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5762100926879505,"acs":1119,"articleLive":2,"columnArticles":33,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1942,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4454628780934922,"acs":7776,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17456,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5321389900580766,"acs":5406,"articleLive":2,"columnArticles":89,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10159,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3137284208952993,"acs":4198,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13381,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4649791103465225,"acs":1892,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4069,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7471089470480827,"acs":2455,"articleLive":2,"columnArticles":43,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3286,"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.6720845921450151,"acs":11123,"articleLive":2,"columnArticles":150,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16550,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41940379403794037,"acs":3869,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9225,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6787550200803213,"acs":16901,"articleLive":2,"columnArticles":207,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24900,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.49023569023569025,"acs":2184,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4455,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7829977628635347,"acs":700,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":894,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8444447727239153,"acs":57163,"articleLive":2,"columnArticles":457,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67693,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4155858430424269,"acs":3781,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9098,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7364025695931478,"acs":3439,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4670,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.340563086548488,"acs":1633,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4795,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.545042492917847,"acs":2886,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5295,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6398242099140439,"acs":9900,"articleLive":2,"columnArticles":162,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15473,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5116706747771962,"acs":7234,"articleLive":2,"columnArticles":126,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14138,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2706784120809976,"acs":2366,"articleLive":2,"columnArticles":39,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8741,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6105783202557397,"acs":2101,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3441,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7308319738988581,"acs":448,"articleLive":2,"columnArticles":21,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":613,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.721465076660988,"acs":1694,"articleLive":2,"columnArticles":36,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2348,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.821683722726395,"acs":17022,"articleLive":2,"columnArticles":288,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20716,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4965785093397448,"acs":5370,"articleLive":2,"columnArticles":64,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10814,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27560735390676294,"acs":5037,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18276,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6216121084125308,"acs":1766,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2841,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5933456561922366,"acs":321,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":541,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6745158650786435,"acs":7419,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10999,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3715953307392996,"acs":2483,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6682,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.441503833786792,"acs":1785,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4043,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15,"acs":2499,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16660,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7823622761278621,"acs":3451,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4411,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6257928118393234,"acs":11544,"articleLive":2,"columnArticles":199,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18447,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.543205317577548,"acs":2942,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5416,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3866287618860896,"acs":3944,"articleLive":2,"columnArticles":85,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10201,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3818463925523662,"acs":2461,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6445,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8394308943089431,"acs":413,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":492,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5247797012686707,"acs":8397,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":16001,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7683808343659645,"acs":7441,"articleLive":2,"columnArticles":116,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9684,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4935845410628019,"acs":25543,"articleLive":2,"columnArticles":301,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51750,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31934227607096494,"acs":1476,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4622,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.657465194431109,"acs":2739,"articleLive":2,"columnArticles":26,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4166,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5261904761904762,"acs":442,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":840,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5454965357967667,"acs":1181,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2165,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7055645596974608,"acs":9142,"articleLive":2,"columnArticles":179,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12957,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.806848903574647,"acs":5372,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6658,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7119879366675044,"acs":2833,"articleLive":2,"columnArticles":48,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3979,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4020715630885122,"acs":1281,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3186,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6591496844936382,"acs":12744,"articleLive":2,"columnArticles":218,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19334,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7712069184789521,"acs":12128,"articleLive":2,"columnArticles":279,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15726,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4510700186993559,"acs":6513,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14439,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45108587368001596,"acs":2264,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5019,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.546882436934793,"acs":1149,"articleLive":2,"columnArticles":26,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2101,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.40828701364325415,"acs":808,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1979,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5364726760908145,"acs":35066,"articleLive":2,"columnArticles":358,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65364,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5155218429554713,"acs":7340,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14238,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2777910400254635,"acs":3491,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12567,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4739776951672863,"acs":2550,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5380,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7946859903381642,"acs":1316,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1656,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6842105263157895,"acs":767,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1121,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6566383257030739,"acs":7028,"articleLive":2,"columnArticles":178,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10703,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5055797495917257,"acs":3715,"articleLive":2,"columnArticles":87,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7348,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2736349453978159,"acs":3508,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12820,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38385938385938384,"acs":2031,"articleLive":2,"columnArticles":33,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5291,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.781747995644858,"acs":7898,"articleLive":2,"columnArticles":93,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10103,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46472573839662445,"acs":5507,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11850,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.3000100505879594,"acs":8955,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29849,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4128834355828221,"acs":1346,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3260,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7381818181818182,"acs":406,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":550,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7258558307820763,"acs":2608,"articleLive":2,"columnArticles":54,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3593,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8123682361208714,"acs":20808,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25614,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5722453222453222,"acs":7707,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13468,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.545555108608206,"acs":5425,"articleLive":2,"columnArticles":107,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9944,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.662547770700637,"acs":5201,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7850,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.603057603057603,"acs":2209,"articleLive":2,"columnArticles":33,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3663,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4442083574785912,"acs":6899,"articleLive":2,"columnArticles":130,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15531,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7579855444159478,"acs":13004,"articleLive":2,"columnArticles":237,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":17156,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5265271355560964,"acs":4327,"articleLive":2,"columnArticles":77,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8218,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46830265848670755,"acs":2061,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4401,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8508893432711123,"acs":38701,"articleLive":2,"columnArticles":444,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45483,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.355392728800112,"acs":7615,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21427,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3644104488382162,"acs":2525,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6929,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43510568031704094,"acs":2635,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6056,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7663636363636364,"acs":843,"articleLive":2,"columnArticles":22,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1100,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3891540958564063,"acs":2038,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5237,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8299696797422778,"acs":17519,"articleLive":2,"columnArticles":283,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21108,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49743223965763195,"acs":6974,"articleLive":2,"columnArticles":113,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14020,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46489352604122125,"acs":5436,"articleLive":2,"columnArticles":72,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11693,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3839458413926499,"acs":2382,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6204,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5236593059936908,"acs":332,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":634,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8961204696273609,"acs":3511,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3918,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8283842794759826,"acs":17073,"articleLive":2,"columnArticles":357,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20610,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5995820607619354,"acs":3730,"articleLive":2,"columnArticles":86,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6221,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47177848775292863,"acs":2658,"articleLive":2,"columnArticles":49,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5634,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4028416213957376,"acs":964,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2393,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.804766121890347,"acs":19992,"articleLive":2,"columnArticles":268,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24842,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8669994128009395,"acs":14765,"articleLive":2,"columnArticles":196,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17030,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5182076140931662,"acs":4383,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8458,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4886634844868735,"acs":2457,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5028,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.657243816254417,"acs":186,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":283,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8000697836706211,"acs":2293,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2866,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6349283854166666,"acs":7802,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12288,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.46273041051626645,"acs":6301,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13617,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39759493670886076,"acs":6282,"articleLive":2,"columnArticles":115,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15800,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5268998793727382,"acs":2184,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4145,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5215469613259669,"acs":472,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":905,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7969991173874669,"acs":1806,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2266,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.709745022703458,"acs":8128,"articleLive":2,"columnArticles":182,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11452,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6098054474708171,"acs":3918,"articleLive":2,"columnArticles":80,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6425,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.478512795750845,"acs":2973,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6213,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3840190816935003,"acs":1288,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3354,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7813679697997312,"acs":12212,"articleLive":2,"columnArticles":187,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15629,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3472171918387058,"acs":5752,"articleLive":2,"columnArticles":121,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16566,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5857587653986733,"acs":4327,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7387,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.503013543217755,"acs":14188,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28206,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7004437869822485,"acs":947,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1352,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7027938342967245,"acs":1459,"articleLive":2,"columnArticles":37,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2076,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6948910325116113,"acs":11670,"articleLive":2,"columnArticles":186,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16794,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35917365026762194,"acs":30130,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83887,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2623921085080148,"acs":6384,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24330,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4960417986067131,"acs":15665,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31580,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6323907455012854,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":389,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.731462086300796,"acs":1746,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2387,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6727272727272727,"acs":8362,"articleLive":2,"columnArticles":194,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12430,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4331959976456739,"acs":2208,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5097,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48947759346372866,"acs":1977,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4039,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3700234192037471,"acs":632,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1708,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8690556177678238,"acs":46564,"articleLive":2,"columnArticles":490,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53580,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6458111780692426,"acs":10931,"articleLive":2,"columnArticles":168,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16926,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.515824842835465,"acs":4759,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9226,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5062353350134701,"acs":23301,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":46028,"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.7877991827203736,"acs":10796,"articleLive":2,"columnArticles":148,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13704,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4807725619262082,"acs":5551,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11546,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5756463719766473,"acs":3451,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5995,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35822336659156745,"acs":1113,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3107,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6212207644038791,"acs":2178,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3506,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5385906040268457,"acs":642,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1192,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46889226100151743,"acs":1854,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3954,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7911421604165294,"acs":12004,"articleLive":2,"columnArticles":207,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15173,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45950590762620835,"acs":2139,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4655,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7233047343394666,"acs":27989,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38696,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48914069877242683,"acs":1036,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2118,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44917183452390297,"acs":28610,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63695,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31645569620253167,"acs":3750,"articleLive":2,"columnArticles":105,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11850,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6538549846167976,"acs":28478,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43554,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4709980839574987,"acs":2704,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5741,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7028985507246377,"acs":582,"articleLive":2,"columnArticles":20,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":828,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.842529198550141,"acs":2092,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2483,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7088269647922576,"acs":8496,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11986,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6965761511216056,"acs":22420,"articleLive":2,"columnArticles":328,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32186,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3628574721770424,"acs":28333,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78083,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48492605233219566,"acs":3410,"articleLive":2,"columnArticles":72,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7032,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5914473684210526,"acs":899,"articleLive":2,"columnArticles":38,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1520,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7042105263157895,"acs":1338,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1900,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7480497157212747,"acs":11315,"articleLive":2,"columnArticles":225,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":15126,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5311114289801173,"acs":3713,"articleLive":2,"columnArticles":86,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6991,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45611350674641815,"acs":3279,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7189,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.47041230506302073,"acs":2202,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4681,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6798229962172578,"acs":9525,"articleLive":2,"columnArticles":112,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14011,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6300783289817232,"acs":6033,"articleLive":2,"columnArticles":129,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9575,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4219872306464485,"acs":4230,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10024,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.41171770972037286,"acs":3092,"articleLive":2,"columnArticles":52,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7510,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7962577962577962,"acs":383,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":481,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.920346062052506,"acs":3085,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3352,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6389550789868502,"acs":7240,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11331,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4309545875810936,"acs":4650,"articleLive":2,"columnArticles":97,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10790,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5397172236503857,"acs":4199,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7780,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.431440329218107,"acs":2621,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6075,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6964980544747081,"acs":716,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":1028,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6105896157230859,"acs":4163,"articleLive":2,"columnArticles":82,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6818,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47469635627530365,"acs":2345,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4940,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5517449765825654,"acs":3652,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6619,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37623234745536904,"acs":1412,"articleLive":2,"columnArticles":27,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3753,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.791320406278855,"acs":857,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1083,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7638244264686381,"acs":11520,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":15082,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8563489390367127,"acs":10170,"articleLive":2,"columnArticles":173,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11876,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3706256153226528,"acs":4141,"articleLive":2,"columnArticles":104,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11173,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36576971214017523,"acs":2338,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6392,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5176991150442478,"acs":351,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":678,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8426825446568473,"acs":16134,"articleLive":2,"columnArticles":199,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19146,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5507884121745508,"acs":6008,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10908,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4742655180030926,"acs":4294,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9054,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46296774193548385,"acs":1794,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3875,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.78258378688055,"acs":5464,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6982,"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.6484905218815821,"acs":5542,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8546,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6655425749729014,"acs":5526,"articleLive":2,"columnArticles":113,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8303,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.519803229061554,"acs":4121,"articleLive":2,"columnArticles":61,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7928,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29200968523002424,"acs":1206,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4130,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7990837696335078,"acs":1221,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1528,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42159566375047547,"acs":8867,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":21032,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35045300731361206,"acs":6421,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18322,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3421,"acs":3421,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10000,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6540894462323826,"acs":11788,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18022,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7155963302752294,"acs":234,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":327,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7107400722021661,"acs":1575,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2216,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.643716381418093,"acs":13164,"articleLive":2,"columnArticles":144,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20450,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8080032012805122,"acs":10096,"articleLive":2,"columnArticles":139,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12495,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5137129982130371,"acs":6612,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12871,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4150164142751244,"acs":3919,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9443,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5805369127516778,"acs":173,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":298,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7853598014888338,"acs":1899,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2418,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4887009768187782,"acs":6704,"articleLive":2,"columnArticles":122,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13718,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5739667338709677,"acs":4555,"articleLive":2,"columnArticles":72,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7936,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5217611336032388,"acs":3093,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5928,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5185185185185185,"acs":2366,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4563,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6825341752827702,"acs":9836,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14411,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37962539972590226,"acs":4155,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10945,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26258342169275867,"acs":4210,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16033,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.409404990403071,"acs":2133,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5210,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5717791411042945,"acs":466,"articleLive":2,"columnArticles":29,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":815,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48735750407131223,"acs":11372,"articleLive":2,"columnArticles":150,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23334,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6626659856996936,"acs":5190,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7832,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5864500306560393,"acs":5739,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9786,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2679158448389218,"acs":2445,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9126,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.625179856115108,"acs":1738,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2780,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6241610738255033,"acs":186,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":298,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6643783371472158,"acs":871,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1311,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7940371456500489,"acs":8123,"articleLive":2,"columnArticles":192,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10230,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5121649876449345,"acs":5389,"articleLive":2,"columnArticles":74,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10522,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.345946466397073,"acs":3593,"articleLive":2,"columnArticles":80,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10386,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.3019366197183099,"acs":1715,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5680,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7521926671459381,"acs":10463,"articleLive":2,"columnArticles":156,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13910,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6990110529377546,"acs":6008,"articleLive":2,"columnArticles":98,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8595,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3732456585026723,"acs":25770,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":69043,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3686884725309622,"acs":2322,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6298,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5095238095238095,"acs":107,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":210,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9007220216606499,"acs":2495,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2770,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8092222042923995,"acs":20059,"articleLive":2,"columnArticles":201,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24788,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7161484453360081,"acs":8568,"articleLive":2,"columnArticles":105,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11964,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6550707547169812,"acs":7777,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11872,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2857451403887689,"acs":2646,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9260,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4296998420221169,"acs":272,"articleLive":2,"columnArticles":22,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":633,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7934594103559336,"acs":9608,"articleLive":2,"columnArticles":140,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":12109,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8670526667408974,"acs":7787,"articleLive":2,"columnArticles":102,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8981,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6822845417236663,"acs":3990,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5848,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4861816130851664,"acs":862,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1773,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7390243902439024,"acs":909,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1230,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8242550073277968,"acs":13498,"articleLive":2,"columnArticles":216,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16376,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.684250920197353,"acs":43686,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63845,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3547126436781609,"acs":6172,"articleLive":2,"columnArticles":131,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17400,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5101811543322567,"acs":3633,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7121,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7075630252100841,"acs":421,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":595,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7953483648182003,"acs":7831,"articleLive":2,"columnArticles":89,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9846,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42921800352024136,"acs":29019,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67609,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5728444873256732,"acs":6531,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11401,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38919558359621453,"acs":1974,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5072,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.515019115237575,"acs":943,"articleLive":2,"columnArticles":30,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1831,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6557377049180327,"acs":120,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":183,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5117924528301887,"acs":651,"articleLive":2,"columnArticles":23,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1272,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8001840561371218,"acs":6956,"articleLive":2,"columnArticles":115,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8693,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5340484316593531,"acs":6572,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12306,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335469349319002,"acs":27584,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43539,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.35954022988505746,"acs":2346,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6525,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6832983193277311,"acs":7806,"articleLive":2,"columnArticles":100,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11424,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3282630316503832,"acs":5611,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17093,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6105720122574055,"acs":2391,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3916,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40068081698037644,"acs":2001,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4994,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6968641114982579,"acs":200,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":287,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6452004860267315,"acs":1062,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1646,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7871729845168179,"acs":11795,"articleLive":2,"columnArticles":123,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14984,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6796279550445679,"acs":10522,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15482,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3564553337045581,"acs":4481,"articleLive":2,"columnArticles":84,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12571,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4522332506203474,"acs":2187,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4836,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6358595194085028,"acs":344,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":541,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7662809917355372,"acs":6954,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":9075,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7718363463368221,"acs":4056,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5255,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6191618977293705,"acs":3354,"articleLive":2,"columnArticles":69,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5417,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31334622823984526,"acs":2268,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7238,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9036016949152542,"acs":12795,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14160,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3881659926147354,"acs":4415,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11374,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5127809395196296,"acs":5316,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10367,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5973154362416108,"acs":2225,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3725,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7402597402597403,"acs":513,"articleLive":2,"columnArticles":15,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":693,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.549079754601227,"acs":179,"articleLive":2,"columnArticles":12,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":326,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7875986193293886,"acs":12778,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16224,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4552482183838628,"acs":7538,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16558,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27643887378461823,"acs":5999,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21701,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6224924012158055,"acs":2048,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3290,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8132369722327881,"acs":2138,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2629,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8942857142857142,"acs":313,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":350,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7451669595782073,"acs":424,"articleLive":2,"columnArticles":19,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":569,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7287492590397154,"acs":6147,"articleLive":2,"columnArticles":95,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8435,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8203630623520126,"acs":31182,"articleLive":2,"columnArticles":401,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":38010,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42965627498001596,"acs":2150,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5004,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4112231477422183,"acs":1876,"articleLive":2,"columnArticles":39,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4562,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7705440707600535,"acs":7492,"articleLive":2,"columnArticles":101,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9723,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.353970940071191,"acs":6066,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17137,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2786724124896046,"acs":3686,"articleLive":2,"columnArticles":111,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13227,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3759430911834447,"acs":1744,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4639,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6892556179775281,"acs":1963,"articleLive":2,"columnArticles":38,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2848,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5234215885947047,"acs":257,"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":491,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5716851558372953,"acs":5411,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9465,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6458072590738423,"acs":5160,"articleLive":2,"columnArticles":64,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7990,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3175691112634224,"acs":2780,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8754,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2712772744672706,"acs":2126,"articleLive":2,"columnArticles":42,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7837,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7085755813953488,"acs":975,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1376,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.46614173228346456,"acs":296,"articleLive":2,"columnArticles":11,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":635,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3383458646616541,"acs":495,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1463,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5910865077875774,"acs":31499,"articleLive":2,"columnArticles":412,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53290,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45783399092886906,"acs":37248,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81357,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5336059289547662,"acs":2088,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3913,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5065320665083135,"acs":853,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1684,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5311217223758063,"acs":6340,"articleLive":2,"columnArticles":80,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11937,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.31011218920557915,"acs":4091,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13192,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6300908784920902,"acs":3744,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5942,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43648321218414676,"acs":1261,"articleLive":2,"columnArticles":36,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2889,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6514285714285715,"acs":798,"articleLive":2,"columnArticles":30,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1225,"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.643240523314324,"acs":7670,"articleLive":2,"columnArticles":103,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11924,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.284423137378183,"acs":3619,"articleLive":2,"columnArticles":73,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12724,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.572567213894837,"acs":4813,"articleLive":2,"columnArticles":96,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8406,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42501692620176035,"acs":2511,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5908,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5831381733021077,"acs":498,"articleLive":2,"columnArticles":18,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":854,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6692913385826772,"acs":170,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":254,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.325144111995608,"acs":4738,"articleLive":2,"columnArticles":73,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14572,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.67467686146004,"acs":3706,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5493,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5687228496959166,"acs":3273,"articleLive":2,"columnArticles":70,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5755,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.26884872170656243,"acs":1651,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6141,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8364811635188365,"acs":8282,"articleLive":2,"columnArticles":88,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9901,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44195823162462705,"acs":3259,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7374,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39156626506024095,"acs":2860,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7304,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5523854069223574,"acs":1181,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2138,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2712962962962963,"acs":293,"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":1080,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.498220640569395,"acs":140,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子数组和·","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":281,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.39158878504672895,"acs":419,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1070,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9127999331159602,"acs":10918,"articleLive":2,"columnArticles":97,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11961,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3443531316149919,"acs":5531,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16062,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3615366669258885,"acs":4649,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12859,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.237989182309895,"acs":1496,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6286,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38235294117647056,"acs":65,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":170,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6911535739561218,"acs":4883,"articleLive":2,"columnArticles":61,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":7065,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3446162549500283,"acs":3655,"articleLive":2,"columnArticles":63,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10606,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4153179849555505,"acs":1822,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4387,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3989537925021796,"acs":2288,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5735,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.912013291916492,"acs":12625,"articleLive":2,"columnArticles":109,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13843,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4810498143831477,"acs":5572,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11583,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5610687022900763,"acs":2058,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3668,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32884500299222025,"acs":1099,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3342,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5435582822085889,"acs":443,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":815,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7306733167082294,"acs":293,"articleLive":2,"columnArticles":11,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":401,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7394519356241844,"acs":6800,"articleLive":2,"columnArticles":95,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9196,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4501756627275631,"acs":5638,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12524,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2431023911710607,"acs":3172,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13048,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34575757575757576,"acs":1141,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3300,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6201657458563536,"acs":449,"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":724,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7966804979253111,"acs":384,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":482,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7733904218204884,"acs":4877,"articleLive":2,"columnArticles":85,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6306,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39335217332795047,"acs":2923,"articleLive":2,"columnArticles":69,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7431,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40874973193223246,"acs":1906,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4663,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5776558891454965,"acs":2001,"articleLive":2,"columnArticles":55,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3464,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6643511527232457,"acs":6599,"articleLive":2,"columnArticles":78,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9933,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3042539898903845,"acs":5357,"articleLive":2,"columnArticles":82,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17607,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5428571428571428,"acs":4047,"articleLive":2,"columnArticles":90,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7455,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5153764581124072,"acs":972,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1886,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5309168443496801,"acs":249,"articleLive":2,"columnArticles":13,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":469,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5533596837944664,"acs":140,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":253,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6687898089171974,"acs":315,"articleLive":2,"columnArticles":13,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":471,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5458369031856064,"acs":7008,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12839,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3262876764593666,"acs":4276,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13105,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48088878655307393,"acs":4177,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8686,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4966685703407577,"acs":2609,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5253,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.459214501510574,"acs":152,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":331,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6050599201065247,"acs":4544,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7510,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42451874366767983,"acs":2514,"articleLive":2,"columnArticles":44,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5922,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41396648044692735,"acs":1482,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3580,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27893569844789357,"acs":629,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2255,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5347544727826418,"acs":7024,"articleLive":2,"columnArticles":65,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13135,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.431900330692917,"acs":5616,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13003,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6147676991150443,"acs":4446,"articleLive":2,"columnArticles":55,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7232,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3858450274557657,"acs":3162,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8195,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7372549019607844,"acs":376,"articleLive":2,"columnArticles":14,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":510,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7288135593220338,"acs":43,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":59,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7784842319430315,"acs":6122,"articleLive":2,"columnArticles":58,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7864,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35892706171700867,"acs":4670,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13011,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27912087912087913,"acs":2921,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10465,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47886108714408976,"acs":2220,"articleLive":2,"columnArticles":50,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4636,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5459236326109391,"acs":529,"articleLive":2,"columnArticles":20,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":969,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4572127139364303,"acs":187,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":409,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5655737704918032,"acs":69,"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":122,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7386888273314867,"acs":4000,"articleLive":2,"columnArticles":56,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5415,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3815944495352795,"acs":2915,"articleLive":2,"columnArticles":46,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7639,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2891077636152955,"acs":1996,"articleLive":2,"columnArticles":38,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6904,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24817760106030484,"acs":749,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3018,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5294117647058824,"acs":279,"articleLive":2,"columnArticles":11,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":527,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.810410900574835,"acs":7613,"articleLive":2,"columnArticles":88,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9394,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5826881080007941,"acs":5870,"articleLive":2,"columnArticles":94,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10074,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2985635213494992,"acs":4531,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15176,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4588170259812051,"acs":830,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1809,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6582278481012658,"acs":52,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":79,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5810891681627768,"acs":5826,"articleLive":2,"columnArticles":65,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":10026,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4125027038719446,"acs":5721,"articleLive":2,"columnArticles":81,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13869,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.27633692907964197,"acs":3612,"articleLive":2,"columnArticles":75,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13071,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4618134546636334,"acs":1421,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3077,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6711409395973155,"acs":200,"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":298,"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.5982142857142857,"acs":201,"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":336,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6598984771573604,"acs":4290,"articleLive":2,"columnArticles":58,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6501,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5944266238973537,"acs":2965,"articleLive":2,"columnArticles":57,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4988,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38546536336591586,"acs":1814,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4706,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3637454981992797,"acs":1212,"articleLive":2,"columnArticles":36,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3332,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5529180971064247,"acs":5637,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10195,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2479321859748266,"acs":4826,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19465,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.33995157384987895,"acs":2106,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6195,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4205920205920206,"acs":1634,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3885,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6483516483516484,"acs":59,"articleLive":2,"columnArticles":6,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":91,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7745822439468001,"acs":6814,"articleLive":2,"columnArticles":88,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8797,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.35914920237722864,"acs":5741,"articleLive":2,"columnArticles":125,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15985,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5729267505646983,"acs":3551,"articleLive":2,"columnArticles":87,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6198,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39175471307230164,"acs":1891,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4827,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.39759036144578314,"acs":99,"articleLive":2,"columnArticles":5,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":249,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6818181818181818,"acs":30,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":44,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8789736603088102,"acs":3871,"articleLive":2,"columnArticles":52,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4404,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.29948309282791297,"acs":2781,"articleLive":2,"columnArticles":51,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":9286,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4185309839635716,"acs":2114,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":5051,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41585709808837357,"acs":1327,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3191,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6320754716981132,"acs":67,"articleLive":2,"columnArticles":4,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":106,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"},{"acceptance":0.9038461538461539,"acs":6627,"articleLive":2,"columnArticles":57,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":7332,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3571490131862449,"acs":4144,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11603,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3292274575460416,"acs":2753,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8362,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5202828433196874,"acs":1398,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2687,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.7843137254901961,"acs":40,"articleLive":2,"columnArticles":3,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":51,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5521540800810948,"acs":5447,"articleLive":2,"columnArticles":71,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9865,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34831460674157305,"acs":3534,"articleLive":2,"columnArticles":94,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":10146,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41032203028364256,"acs":1924,"articleLive":2,"columnArticles":49,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4689,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34575707154742097,"acs":1039,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3005,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7878787878787878,"acs":130,"articleLive":2,"columnArticles":7,"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":165,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.7777777777777778,"acs":49,"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":63,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6569938789390161,"acs":2898,"articleLive":2,"columnArticles":36,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4411,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7543417366946779,"acs":2693,"articleLive":2,"columnArticles":36,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3570,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4780412823891085,"acs":2177,"articleLive":2,"columnArticles":55,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4554,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.25984077841662984,"acs":1175,"articleLive":2,"columnArticles":39,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4522,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9014084507042254,"acs":192,"articleLive":2,"columnArticles":9,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":213,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5509727626459144,"acs":4248,"articleLive":2,"columnArticles":44,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7710,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4236042557858945,"acs":3862,"articleLive":2,"columnArticles":55,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9117,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.22264109103004767,"acs":2008,"articleLive":2,"columnArticles":67,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9019,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.34235046588518186,"acs":1139,"articleLive":2,"columnArticles":39,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3327,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.6333333333333333,"acs":19,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":30,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6606264250570023,"acs":5505,"articleLive":2,"columnArticles":89,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":8333,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3847609561752988,"acs":3863,"articleLive":2,"columnArticles":77,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":10040,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.30328658601862757,"acs":2833,"articleLive":2,"columnArticles":60,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":9341,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.30914645789574186,"acs":1619,"articleLive":2,"columnArticles":41,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":5237,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.45454545454545453,"acs":20,"articleLive":2,"columnArticles":4,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"lock","submitted":44,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8286526839672947,"acs":2331,"articleLive":2,"columnArticles":27,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":2813,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.4726872246696035,"acs":2146,"articleLive":2,"columnArticles":43,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":4540,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.327683615819209,"acs":1276,"articleLive":2,"columnArticles":31,"formTitle":"[2039]网络空闲的时刻","frequency":0.0,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":3894,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.27166064981949456,"acs":602,"articleLive":2,"columnArticles":16,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":2216,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.51,"acs":51,"articleLive":2,"columnArticles":3,"formTitle":"[2041]Accepted Candidates From the Interviews","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"lock","submitted":100,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.712991452991453,"acs":4171,"articleLive":2,"columnArticles":50,"formTitle":"[2042]检查句子中的数字是否递增","frequency":0.0,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":5850,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5924888815681106,"acs":3597,"articleLive":2,"columnArticles":35,"formTitle":"[2043]简易银行系统","frequency":0.0,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":6071,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7491901897269783,"acs":3238,"articleLive":2,"columnArticles":63,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.0,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":4322,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.30778219210095814,"acs":1317,"articleLive":2,"columnArticles":39,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.0,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":4279,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.8452331477017704,"acs":81352,"articleLive":2,"columnArticles":628,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96248,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6910876132930514,"acs":13725,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19860,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21990921897010487,"acs":11240,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":51112,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3778775155639207,"acs":2610,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6907,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19955654101995565,"acs":2070,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10373,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8398889845918269,"acs":43880,"articleLive":2,"columnArticles":660,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52245,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7691343026217815,"acs":39252,"articleLive":2,"columnArticles":474,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":51034,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28893036936478306,"acs":5108,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17679,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2757007393792556,"acs":6600,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23939,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5888637099384915,"acs":1819,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3089,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6899131996408261,"acs":6915,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10023,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41164068489649885,"acs":6443,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15652,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6120773259197,"acs":9467,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15467,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21116092131705055,"acs":2732,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12938,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5762032085561497,"acs":862,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1496,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.31097560975609756,"acs":612,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1968,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7991120976692564,"acs":23760,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29733,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28690225293665966,"acs":17561,"articleLive":2,"columnArticles":230,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":61209,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162415122040741,"acs":19691,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38143,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.31228192602930915,"acs":1790,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5732,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33553719008264465,"acs":812,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2420,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33377911512314723,"acs":8985,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26919,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33898087536901556,"acs":2641,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7791,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28224068944290553,"acs":917,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3249,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33304843304843307,"acs":1169,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3510,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3355342136854742,"acs":559,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1666,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3285302593659942,"acs":1254,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3817,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2828056156098629,"acs":10334,"articleLive":2,"columnArticles":175,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36541,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18702276131672207,"acs":5119,"articleLive":2,"columnArticles":124,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27371,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3499690018598884,"acs":5645,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16130,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2528870048238562,"acs":1730,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6841,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40589135424636574,"acs":1061,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2614,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21804940739682993,"acs":4581,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":21009,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.48476794111633614,"acs":2371,"articleLive":2,"columnArticles":61,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4891,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3957909029192125,"acs":1166,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2946,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2644326476443265,"acs":797,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3014,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19507952286282307,"acs":785,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4024,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5638297872340425,"acs":477,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":846,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5047453548990777,"acs":3776,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7481,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23206232062320623,"acs":2830,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12195,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.41736876215165264,"acs":1288,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3086,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.20023396373562097,"acs":1027,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5129,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3995943204868154,"acs":394,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":986,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8460111317254174,"acs":2280,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2695,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18673932788374206,"acs":1028,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5505,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.36982758620689654,"acs":858,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2320,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3548680618744313,"acs":780,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2198,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.1527231892195396,"acs":272,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1781,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.2255456750202102,"acs":279,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1237,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5448134376202077,"acs":4249,"articleLive":2,"columnArticles":97,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7799,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6960607878424315,"acs":3481,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":5001,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4125030171373401,"acs":1709,"articleLive":2,"columnArticles":55,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4143,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678407831825649,"acs":405945,"articleLive":2,"columnArticles":2810,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":598379,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40335832595122634,"acs":265004,"articleLive":2,"columnArticles":2111,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":656994,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7607953137027228,"acs":291571,"articleLive":2,"columnArticles":1963,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":383245,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7512297704591306,"acs":307573,"articleLive":2,"columnArticles":2114,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":409426,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6981480128579778,"acs":191125,"articleLive":2,"columnArticles":1455,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":273760,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7150769411019127,"acs":268545,"articleLive":2,"columnArticles":1705,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":375547,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600618923100832,"acs":266444,"articleLive":2,"columnArticles":1867,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":739995,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44400244866657546,"acs":198006,"articleLive":2,"columnArticles":1325,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":445957,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49295842684938834,"acs":265326,"articleLive":2,"columnArticles":1646,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":538232,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4522169912598124,"acs":172708,"articleLive":2,"columnArticles":1153,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":381914,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5268041813404886,"acs":179056,"articleLive":2,"columnArticles":1723,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":339891,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.569276753479104,"acs":159414,"articleLive":2,"columnArticles":1325,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":280029,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3120121325661269,"acs":83940,"articleLive":2,"columnArticles":494,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":269028,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7473287123929162,"acs":201080,"articleLive":2,"columnArticles":1261,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":269065,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3400437114609715,"acs":125402,"articleLive":2,"columnArticles":764,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":368782,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773180760199739,"acs":151619,"articleLive":2,"columnArticles":1135,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":195054,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5968425623100398,"acs":191069,"articleLive":2,"columnArticles":1475,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":320133,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37666061787306493,"acs":67252,"articleLive":2,"columnArticles":450,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":178548,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24233613078339,"acs":77676,"articleLive":2,"columnArticles":864,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":320530,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.643235443619132,"acs":196145,"articleLive":2,"columnArticles":1648,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":304935,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7981612506884718,"acs":263746,"articleLive":2,"columnArticles":2463,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":330442,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7426478867600658,"acs":296797,"articleLive":2,"columnArticles":1856,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":399647,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7282665278500781,"acs":187466,"articleLive":2,"columnArticles":1200,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":257414,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46550815388062855,"acs":147493,"articleLive":2,"columnArticles":1193,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":316843,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.791877074309788,"acs":193979,"articleLive":2,"columnArticles":1419,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":244961,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5799410006983746,"acs":151966,"articleLive":2,"columnArticles":1094,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":262037,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4400960477720754,"acs":146809,"articleLive":2,"columnArticles":1491,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":333584,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5676758490107452,"acs":144809,"articleLive":2,"columnArticles":962,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":255091,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6160861325140522,"acs":114101,"articleLive":2,"columnArticles":957,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":185203,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6441375868236077,"acs":139383,"articleLive":2,"columnArticles":965,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":216387,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6865233024477942,"acs":138999,"articleLive":2,"columnArticles":1103,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":202468,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5886218886465522,"acs":121717,"articleLive":2,"columnArticles":1150,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":206783,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5514481615503593,"acs":114447,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":207539,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5770718916287293,"acs":135126,"articleLive":2,"columnArticles":876,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":234158,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7200872075894172,"acs":122206,"articleLive":2,"columnArticles":840,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":169710,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6545948589077809,"acs":105757,"articleLive":2,"columnArticles":911,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":161561,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5614221966316395,"acs":78004,"articleLive":2,"columnArticles":562,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138940,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5793715156430127,"acs":159315,"articleLive":2,"columnArticles":1121,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":274979,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6911688248387463,"acs":170163,"articleLive":2,"columnArticles":1030,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":246196,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5702150748453166,"acs":250118,"articleLive":2,"columnArticles":1825,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":438638,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5816131168960793,"acs":64099,"articleLive":2,"columnArticles":467,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":110209,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053984714683086,"acs":224173,"articleLive":2,"columnArticles":1531,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":370290,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4862192196602536,"acs":49660,"articleLive":2,"columnArticles":514,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":102135,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4154833646741786,"acs":56121,"articleLive":2,"columnArticles":468,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":135074,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5612319117011266,"acs":110341,"articleLive":2,"columnArticles":817,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":196605,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5355687152515577,"acs":121279,"articleLive":2,"columnArticles":1452,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":226449,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889040124445258,"acs":120459,"articleLive":2,"columnArticles":1005,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":174856,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4646268085803972,"acs":153049,"articleLive":2,"columnArticles":1047,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":329402,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513063366859221,"acs":88846,"articleLive":2,"columnArticles":520,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":136412,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6149420515071353,"acs":155517,"articleLive":2,"columnArticles":1065,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":252897,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48327106177307527,"acs":103088,"articleLive":2,"columnArticles":854,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":213313,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6502471212126788,"acs":176691,"articleLive":2,"columnArticles":1054,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":271729,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5378976382570522,"acs":192612,"articleLive":2,"columnArticles":1606,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":358083,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4473170514422863,"acs":170719,"articleLive":2,"columnArticles":1486,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":381651,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7569996033173738,"acs":164116,"articleLive":2,"columnArticles":1153,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":216798,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7900457084814627,"acs":178894,"articleLive":2,"columnArticles":1277,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":226435,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5883656533260739,"acs":138323,"articleLive":2,"columnArticles":943,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":235097,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6973845904842974,"acs":116337,"articleLive":2,"columnArticles":1041,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":166819,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8005247731540798,"acs":91223,"articleLive":2,"columnArticles":705,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":113954,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6662278073079908,"acs":135616,"articleLive":2,"columnArticles":850,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":203558,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7074071836997664,"acs":140542,"articleLive":2,"columnArticles":1864,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":198672,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44199586021831616,"acs":131111,"articleLive":2,"columnArticles":983,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":296634,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.857848621966269,"acs":208543,"articleLive":2,"columnArticles":1809,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":243100,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44423232421514586,"acs":132403,"articleLive":2,"columnArticles":1197,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":298049,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.475117928056406,"acs":95283,"articleLive":2,"columnArticles":1072,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":200546,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5614691567435794,"acs":65871,"articleLive":2,"columnArticles":596,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":117319,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45971933128853254,"acs":104468,"articleLive":2,"columnArticles":992,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":227243,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6552540112474257,"acs":111040,"articleLive":2,"columnArticles":772,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":169461,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6340846608489075,"acs":132388,"articleLive":2,"columnArticles":958,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":208786,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568019828840605,"acs":138963,"articleLive":2,"columnArticles":1303,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":162188,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5844653909947813,"acs":72237,"articleLive":2,"columnArticles":500,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":123595,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.597773832396981,"acs":73736,"articleLive":2,"columnArticles":532,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":123351,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.286781399665247,"acs":69221,"articleLive":2,"columnArticles":561,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":241372,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6942438081036371,"acs":119185,"articleLive":2,"columnArticles":693,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":171676,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7006739126576063,"acs":118423,"articleLive":2,"columnArticles":694,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":169013,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20511882161890166,"acs":8968,"articleLive":2,"columnArticles":114,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":43721,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5714688667935971,"acs":8104,"articleLive":2,"columnArticles":130,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":14181,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7820502960855187,"acs":10169,"articleLive":2,"columnArticles":152,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":13003,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6874948068134608,"acs":8274,"articleLive":2,"columnArticles":98,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":12035,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7153514395617204,"acs":6137,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":8579,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6643186128420482,"acs":7356,"articleLive":2,"columnArticles":100,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":11073,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.45410455744954,"acs":6367,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":14021,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5068035330627835,"acs":6369,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":12567,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5506443710725317,"acs":5170,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":9389,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4366066599706405,"acs":5651,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12943,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5636289555887546,"acs":4150,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":7363,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6610834859984297,"acs":5052,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":7642,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6532409142000749,"acs":3487,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":5338,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.50368703912011,"acs":4030,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":8001,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6430293290478104,"acs":3201,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4978,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4997473471450227,"acs":4945,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9895,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5202509982886481,"acs":2736,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":5259,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5280026990553306,"acs":4695,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8892,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4737093690248566,"acs":3964,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":8368,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7079820627802691,"acs":3947,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5575,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.537354477953983,"acs":5862,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10909,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5243574990410433,"acs":6835,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":13035,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.703884892086331,"acs":4892,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6950,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7708821937578928,"acs":12819,"articleLive":2,"columnArticles":127,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":16629,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6052555168408827,"acs":4169,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6888,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6543174282831195,"acs":4539,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6937,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6137486763148605,"acs":6955,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":11332,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6281905842314237,"acs":2215,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3526,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2947948560930802,"acs":2407,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":8165,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.549078980570275,"acs":2176,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3963,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5573944409081265,"acs":2627,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4713,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6008928571428571,"acs":3365,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5600,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7901706886403767,"acs":2685,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3398,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5746907706945766,"acs":2416,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":4204,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.683723462166576,"acs":2512,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3674,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.584562753902074,"acs":2734,"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":4677,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4411289137145377,"acs":3001,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6803,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7826182136602452,"acs":3575,"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":4568,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5162646603230804,"acs":2333,"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":4519,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5779748706577975,"acs":1564,"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":2706,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7802493277927157,"acs":3192,"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":4091,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8432243732148524,"acs":2657,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":3151,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.657623232709209,"acs":1721,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2617,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.648125,"acs":3111,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4800,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8102269619907028,"acs":2963,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3657,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7296526697770865,"acs":2815,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3858,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.684945417618685,"acs":2698,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3939,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6880626223091977,"acs":1758,"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":2555,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7531479538300105,"acs":2871,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3812,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6172653184424992,"acs":2045,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":3313,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41514860977948226,"acs":1732,"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":4172,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7451403887688985,"acs":3105,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":4167,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6381593714927049,"acs":2843,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4455,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8513998564249821,"acs":2372,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2786,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8931909212283045,"acs":2007,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":2247,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7257155735857561,"acs":3220,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":4437,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3506458557588805,"acs":1303,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3716,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6051015588096362,"acs":1281,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":2117,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6242095754290876,"acs":2073,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":3321,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6705917874396136,"acs":2221,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":3312,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5333809353802214,"acs":1494,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2801,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7662395050817499,"acs":1734,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2263,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7274666666666667,"acs":1364,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1875,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6380638063806381,"acs":1160,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1818,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.63572267920094,"acs":1082,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1702,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6458940011648223,"acs":1109,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1717,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6644340254521098,"acs":992,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1493,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.508585590369977,"acs":2873,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5649,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7237289862455425,"acs":35517,"articleLive":2,"columnArticles":378,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":49075,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6603590490053373,"acs":2722,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":4122,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.4970306075833714,"acs":1088,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":2189,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42203429101019463,"acs":3643,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":8632,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5411542100283823,"acs":1716,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":3171,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.553929295203783,"acs":2460,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4441,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7106628242074928,"acs":2466,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3470,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.675553547220967,"acs":4485,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6639,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.58729216152019,"acs":3956,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6736,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6345023312385972,"acs":3130,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4933,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8588509769612132,"acs":2945,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3429,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8040540540540541,"acs":2261,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2812,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7815013404825737,"acs":3498,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4476,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6449963476990505,"acs":2649,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":4107,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8542727029199035,"acs":3189,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3733,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6743022643496577,"acs":2561,"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":3798,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8561515879370163,"acs":3208,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3747,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7683109118086696,"acs":2056,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2676,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6366666666666667,"acs":2101,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3300,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7398585783401563,"acs":3976,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":5374,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6217171717171717,"acs":2462,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3960,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5163511187607573,"acs":1500,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2905,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7667560321715817,"acs":2002,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2611,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6847311827956989,"acs":1592,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2325,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5773987206823028,"acs":1354,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2345,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.594105480868666,"acs":1149,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1934,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6616818129529507,"acs":5752,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8693,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49381663113006397,"acs":1158,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2345,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5463442717328728,"acs":949,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1737,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7756211180124224,"acs":1998,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2576,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6913324708926262,"acs":2672,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3865,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7409691629955947,"acs":1682,"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":2270,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48710340104998856,"acs":2134,"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":4381,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5922454196847039,"acs":1390,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2347,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49545032497678737,"acs":2668,"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":5385,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.590030518819939,"acs":1160,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1966,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.7009783071033603,"acs":3296,"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":4702,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5570953436807096,"acs":1005,"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":1804,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5455026455026455,"acs":1031,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1890,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5860805860805861,"acs":640,"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":1092,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6046637744034707,"acs":1115,"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":1844,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8392036753445635,"acs":1644,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1959,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6959134615384616,"acs":579,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":832,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5620620620620621,"acs":1123,"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":1998,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5833333333333334,"acs":1141,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1956,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.43029814665592264,"acs":534,"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":1241,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2999554962171785,"acs":674,"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":2247,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6360394021739131,"acs":3745,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5888,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6274131274131274,"acs":650,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":1036,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.707196029776675,"acs":855,"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":1209,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.46186844613918016,"acs":2907,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":6294,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7196023451440224,"acs":90336,"articleLive":2,"columnArticles":1549,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":125536,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.647754295475098,"acs":58020,"articleLive":2,"columnArticles":1111,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":89571,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5792972459639126,"acs":44530,"articleLive":2,"columnArticles":494,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76869,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.551284315190372,"acs":40585,"articleLive":2,"columnArticles":779,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":73619,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3320821688664042,"acs":32558,"articleLive":2,"columnArticles":558,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":98042,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47189008635888624,"acs":73604,"articleLive":2,"columnArticles":1175,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":155977,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7529452172419715,"acs":65766,"articleLive":2,"columnArticles":962,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":87345,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6216005334165614,"acs":43816,"articleLive":2,"columnArticles":492,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":70489,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.549755708445508,"acs":33081,"articleLive":2,"columnArticles":418,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":60174,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6823914209115282,"acs":63633,"articleLive":2,"columnArticles":693,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":93250,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7797636103151863,"acs":65313,"articleLive":2,"columnArticles":949,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83760,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.854939006957019,"acs":71767,"articleLive":2,"columnArticles":683,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83944,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6544134682214843,"acs":25422,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38847,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46642162107727747,"acs":37053,"articleLive":2,"columnArticles":524,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":79441,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48337379533583463,"acs":39423,"articleLive":2,"columnArticles":508,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":81558,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6851056035393741,"acs":48624,"articleLive":2,"columnArticles":435,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":70973,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5320527745440434,"acs":27422,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51540,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5372201221285258,"acs":11085,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20634,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6138831193353474,"acs":26009,"articleLive":2,"columnArticles":299,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42368,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38719189126929277,"acs":8404,"articleLive":2,"columnArticles":127,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21705,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7126586891818016,"acs":23465,"articleLive":2,"columnArticles":343,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32926,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5433381755875889,"acs":14587,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26847,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5879296346414074,"acs":10862,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18475,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5316486017126774,"acs":17756,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33398,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7902018340273511,"acs":34727,"articleLive":2,"columnArticles":423,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43947,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8063932448733414,"acs":24066,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29844,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5846956951131334,"acs":33154,"articleLive":2,"columnArticles":385,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56703,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35179484360398,"acs":25598,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72764,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5904196172528823,"acs":20177,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":34174,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168592212237912,"acs":16753,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23370,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4762345898952469,"acs":6683,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":14033,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7165181510908213,"acs":16323,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22781,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4864188706218728,"acs":17693,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36374,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5049499680647221,"acs":9487,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18788,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.69003920171062,"acs":7745,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11224,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3867526668320516,"acs":10913,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":28217,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.386018457960904,"acs":5312,"articleLive":2,"columnArticles":138,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13761,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5273039082949724,"acs":11684,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22158,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.704177690272565,"acs":11445,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16253,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.553435706530169,"acs":3568,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6447,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36324080893245636,"acs":42910,"articleLive":2,"columnArticles":475,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":118131,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3609770367120082,"acs":12340,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":34185,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6757763813876194,"acs":52051,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":77024,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8198958171357488,"acs":21091,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25724,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6792886185170242,"acs":21886,"articleLive":2,"columnArticles":489,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":32219,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6564452325740008,"acs":24062,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36655,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8134277748474117,"acs":21590,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26542,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.718388062291242,"acs":16561,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":23053,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8135561814408538,"acs":21953,"articleLive":2,"columnArticles":352,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26984,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5584005185755379,"acs":13783,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24683,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49475605516282306,"acs":34154,"articleLive":2,"columnArticles":328,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":69032,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.761100801158738,"acs":16815,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22093,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013838310269483,"acs":6884,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13730,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5338432122370937,"acs":4188,"articleLive":2,"columnArticles":75,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7845,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5550045393754209,"acs":56853,"articleLive":2,"columnArticles":2374,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102437,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7397172783786086,"acs":34746,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46972,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39488821680602504,"acs":13318,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33726,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5537438927394615,"acs":19494,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35204,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45498207635819443,"acs":13073,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28733,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6233940042826552,"acs":4658,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7472,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6674972076638886,"acs":7769,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11639,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.831823809213527,"acs":25532,"articleLive":2,"columnArticles":407,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30694,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7661315220747145,"acs":14889,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19434,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44206502717141016,"acs":9599,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21714,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46006613251939465,"acs":7235,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15726,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46418497307462175,"acs":10861,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23398,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4243399448312098,"acs":12922,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30452,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329515877147319,"acs":19712,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26894,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3734842360549717,"acs":2310,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6185,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5481685900652283,"acs":2185,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3986,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6804076566276867,"acs":10415,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15307,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44108555561376855,"acs":50514,"articleLive":2,"columnArticles":584,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114522,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4297145328719723,"acs":1987,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4624,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5498631802979629,"acs":3617,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6578,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5033699103213948,"acs":9037,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17953,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4538364249578415,"acs":15071,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":33208,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.600390773593388,"acs":34723,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57834,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34405755786330006,"acs":15207,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44199,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6114526139890188,"acs":20491,"articleLive":2,"columnArticles":363,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33512,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7219785575048733,"acs":8889,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12312,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4647477831080099,"acs":9591,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20637,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5842385516506923,"acs":2743,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4695,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47224390667013616,"acs":10889,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":23058,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5458315700380871,"acs":32245,"articleLive":2,"columnArticles":259,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":59075,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3880734670215289,"acs":14727,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37949,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5971073380738161,"acs":12344,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20673,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6420060707651882,"acs":28342,"articleLive":2,"columnArticles":458,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":44146,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3877020379479972,"acs":5517,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14230,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44991868363149334,"acs":4703,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10453,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41201294134196087,"acs":8787,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21327,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2718503361590178,"acs":8370,"articleLive":2,"columnArticles":123,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30789,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5487932437144075,"acs":14166,"articleLive":2,"columnArticles":148,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25813,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5705254368700423,"acs":66962,"articleLive":2,"columnArticles":929,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117369,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6870741862225587,"acs":14522,"articleLive":2,"columnArticles":264,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21136,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.632403550081507,"acs":20949,"articleLive":2,"columnArticles":293,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33126,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5526351169669266,"acs":24663,"articleLive":2,"columnArticles":272,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44628,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.596942749828396,"acs":77399,"articleLive":2,"columnArticles":761,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":129659,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4030278232405892,"acs":5910,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14664,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5185674595107407,"acs":61220,"articleLive":2,"columnArticles":1141,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":118056,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44503230118066384,"acs":7991,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17956,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4454137740369847,"acs":7250,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16277,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.578849351513136,"acs":8703,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":15035,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5714078584891982,"acs":3941,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6897,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359058722552035,"acs":44453,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69905,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3753529734058246,"acs":8906,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23727,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37824433790709205,"acs":4576,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12098,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.525054777555492,"acs":11023,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20994,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5026975563313234,"acs":1584,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3151,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3429743990619504,"acs":3510,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10234,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.498966660167674,"acs":38388,"articleLive":2,"columnArticles":438,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":76935,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.5210740258400598,"acs":2586328,"articleLive":2,"columnArticles":14491,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4963456,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40936693182229494,"acs":1029198,"articleLive":2,"columnArticles":7301,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2514121,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38125491121946103,"acs":1278944,"articleLive":2,"columnArticles":7642,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3354564,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4090981848944056,"acs":529047,"articleLive":2,"columnArticles":3933,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1293203,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35578062956242446,"acs":758995,"articleLive":2,"columnArticles":4111,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2133323,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5075037131356146,"acs":311284,"articleLive":2,"columnArticles":2528,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":613363,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.352260368810552,"acs":856079,"articleLive":2,"columnArticles":5387,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2430245,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21730140435102183,"acs":355951,"articleLive":2,"columnArticles":2737,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1638052,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.583381036270503,"acs":788800,"articleLive":2,"columnArticles":5014,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1352118,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3159573104046461,"acs":209456,"articleLive":2,"columnArticles":1258,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":662925,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6267369893855079,"acs":550067,"articleLive":2,"columnArticles":3115,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":877668,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6646420389461627,"acs":232093,"articleLive":2,"columnArticles":1811,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":349200,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6317531192602445,"acs":478788,"articleLive":2,"columnArticles":3959,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":757872,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4104890652797281,"acs":639606,"articleLive":2,"columnArticles":3994,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1558156,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33711681711502517,"acs":677266,"articleLive":2,"columnArticles":3201,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2008995,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4590074807132485,"acs":266788,"articleLive":2,"columnArticles":1462,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":581228,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5733327638435305,"acs":349006,"articleLive":2,"columnArticles":3143,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":608732,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3979475324857273,"acs":227236,"articleLive":2,"columnArticles":1562,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":571020,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4299434923932685,"acs":535569,"articleLive":2,"columnArticles":4001,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1245673,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4451703684916722,"acs":803898,"articleLive":2,"columnArticles":5696,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1805821,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6676688083624199,"acs":735309,"articleLive":2,"columnArticles":3564,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1101308,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.772679321508738,"acs":361097,"articleLive":2,"columnArticles":2708,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":467331,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5602203399473246,"acs":334800,"articleLive":2,"columnArticles":2161,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":597622,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7034869866248413,"acs":324731,"articleLive":2,"columnArticles":2569,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":461602,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6578982474278378,"acs":236721,"articleLive":2,"columnArticles":2246,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":359814,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5385737503008156,"acs":834764,"articleLive":2,"columnArticles":4637,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1549953,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5969606203051664,"acs":495657,"articleLive":2,"columnArticles":4183,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":830301,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40536626235153944,"acs":481415,"articleLive":2,"columnArticles":3301,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1187605,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2197316503620417,"acs":130701,"articleLive":2,"columnArticles":1041,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":594821,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3593399770128103,"acs":81600,"articleLive":2,"columnArticles":605,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":227083,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3731943108771575,"acs":221196,"articleLive":2,"columnArticles":1789,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":592710,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35682671869085403,"acs":196072,"articleLive":2,"columnArticles":1323,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":549488,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42800398573407156,"acs":376703,"articleLive":2,"columnArticles":2489,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":880139,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42342779259655666,"acs":354473,"articleLive":2,"columnArticles":3388,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":837151,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4626890719576951,"acs":529351,"articleLive":2,"columnArticles":4059,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1144075,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.640259589116613,"acs":209055,"articleLive":2,"columnArticles":1476,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":326516,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707652839771704,"acs":103540,"articleLive":2,"columnArticles":878,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":154361,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5959046513283373,"acs":242765,"articleLive":2,"columnArticles":2600,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":407389,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.727757748413864,"acs":345380,"articleLive":2,"columnArticles":2002,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":474581,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6216961167012338,"acs":205930,"articleLive":2,"columnArticles":1428,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":331239,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4197607199261003,"acs":169041,"articleLive":2,"columnArticles":1443,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":402708,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5826893891928769,"acs":334804,"articleLive":2,"columnArticles":2489,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":574584,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4490858316815329,"acs":174001,"articleLive":2,"columnArticles":1171,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":387456,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3282997549375129,"acs":86006,"articleLive":2,"columnArticles":560,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":261974,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4309264274453285,"acs":210196,"articleLive":2,"columnArticles":1682,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":487777,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7832294269964001,"acs":434054,"articleLive":2,"columnArticles":2772,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":554185,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6384582591613234,"acs":221651,"articleLive":2,"columnArticles":1523,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":347166,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352783200769332,"acs":228612,"articleLive":2,"columnArticles":1915,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":310919,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6657403930404306,"acs":239337,"articleLive":2,"columnArticles":1349,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":359505,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37639807178888735,"acs":221910,"articleLive":2,"columnArticles":1317,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":589562,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7388812557640548,"acs":157030,"articleLive":2,"columnArticles":1571,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":212524,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.822328419579196,"acs":75197,"articleLive":2,"columnArticles":622,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":91444,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.552959354257342,"acs":707522,"articleLive":2,"columnArticles":3880,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1279519,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4817397532473023,"acs":193709,"articleLive":2,"columnArticles":2046,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":402103,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4328385892645303,"acs":336039,"articleLive":2,"columnArticles":2580,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":776361,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.47029714225088476,"acs":310295,"articleLive":2,"columnArticles":2384,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":659785,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41170147133055396,"acs":88086,"articleLive":2,"columnArticles":942,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":213956,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3773951154690717,"acs":253331,"articleLive":2,"columnArticles":2722,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":671262,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7893317405154938,"acs":130827,"articleLive":2,"columnArticles":1608,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":165744,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5243970384666196,"acs":91297,"articleLive":2,"columnArticles":967,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":174099,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4176638863710073,"acs":200898,"articleLive":2,"columnArticles":2038,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":481004,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6625979508829738,"acs":321741,"articleLive":2,"columnArticles":2480,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":485575,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3922099886826904,"acs":186448,"articleLive":2,"columnArticles":1756,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":475378,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883595764387814,"acs":274979,"articleLive":2,"columnArticles":2122,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":399470,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.269679190968196,"acs":46747,"articleLive":2,"columnArticles":648,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":173343,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4570049134691285,"acs":358370,"articleLive":2,"columnArticles":3238,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":784171,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5425904700420995,"acs":198351,"articleLive":2,"columnArticles":1811,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":365563,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5241875669587671,"acs":38164,"articleLive":2,"columnArticles":578,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72806,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3918816729716291,"acs":396442,"articleLive":2,"columnArticles":1992,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1011637,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5304999838344069,"acs":590699,"articleLive":2,"columnArticles":3670,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1113476,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4218665327323914,"acs":95754,"articleLive":2,"columnArticles":841,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":226977,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142481375260916,"acs":180979,"articleLive":2,"columnArticles":1264,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":294635,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6048727076065129,"acs":136449,"articleLive":2,"columnArticles":1001,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":225583,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46188078229300855,"acs":173536,"articleLive":2,"columnArticles":1737,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":375716,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5966807648878727,"acs":276370,"articleLive":2,"columnArticles":1899,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":463179,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4274374410481719,"acs":190782,"articleLive":2,"columnArticles":1297,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":446339,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700918941439077,"acs":227355,"articleLive":2,"columnArticles":1334,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":295231,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015060233431117,"acs":320491,"articleLive":2,"columnArticles":2088,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":399861,"title":"子集","titleSlug":"subsets"},{"acceptance":0.458683731987696,"acs":229790,"articleLive":2,"columnArticles":1445,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":500977,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6168676379480825,"acs":150351,"articleLive":2,"columnArticles":1343,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":243733,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41488086834614335,"acs":126364,"articleLive":2,"columnArticles":1006,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":304579,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5309215908151602,"acs":186268,"articleLive":2,"columnArticles":1718,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":350839,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5383644020828287,"acs":324441,"articleLive":2,"columnArticles":1979,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":602642,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.433524134668015,"acs":186920,"articleLive":2,"columnArticles":1186,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":431164,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5157179357214527,"acs":99712,"articleLive":2,"columnArticles":702,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":193346,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6326620761335585,"acs":121740,"articleLive":2,"columnArticles":1121,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":192425,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4866895539295581,"acs":42104,"articleLive":2,"columnArticles":314,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86511,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5175480509372365,"acs":478763,"articleLive":2,"columnArticles":3343,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":925060,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.710259901722811,"acs":59985,"articleLive":2,"columnArticles":488,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":84455,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6336005015000223,"acs":141502,"articleLive":2,"columnArticles":1246,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":223330,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30999634295982637,"acs":166991,"articleLive":2,"columnArticles":1545,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":538687,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5491140955886814,"acs":217190,"articleLive":2,"columnArticles":2065,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":395528,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.541376207907804,"acs":157652,"articleLive":2,"columnArticles":1359,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":291206,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7558243044395699,"acs":579913,"articleLive":2,"columnArticles":2372,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":767259,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7027843996674934,"acs":102298,"articleLive":2,"columnArticles":637,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":145561,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6994756253606643,"acs":167274,"articleLive":2,"columnArticles":1322,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":239142,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4558859759720592,"acs":62915,"articleLive":2,"columnArticles":557,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":138006,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3506070665629131,"acs":357297,"articleLive":2,"columnArticles":1984,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1019081,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6114063675106542,"acs":73167,"articleLive":2,"columnArticles":600,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":119670,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.601950945895307,"acs":255412,"articleLive":2,"columnArticles":1914,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":424307,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5643740557018893,"acs":422101,"articleLive":2,"columnArticles":2314,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":747910,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420489510819697,"acs":407938,"articleLive":2,"columnArticles":2559,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":635369,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718646466595902,"acs":177787,"articleLive":2,"columnArticles":1615,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":310890,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.766141142778226,"acs":527017,"articleLive":2,"columnArticles":2604,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":687885,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7048300734578281,"acs":254844,"articleLive":2,"columnArticles":1458,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":361568,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.721564206782675,"acs":136341,"articleLive":2,"columnArticles":904,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":188952,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6978733610489287,"acs":165851,"articleLive":2,"columnArticles":1326,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":237652,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7607792429678641,"acs":195925,"articleLive":2,"columnArticles":1211,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":257532,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7630984408803877,"acs":95588,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":125263,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5638696252219562,"acs":262302,"articleLive":2,"columnArticles":1498,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":465182,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4869417831389499,"acs":277811,"articleLive":2,"columnArticles":1833,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":570522,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5264104601466052,"acs":276266,"articleLive":2,"columnArticles":1732,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":524811,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6277067963354668,"acs":183694,"articleLive":2,"columnArticles":1294,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":292643,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7260226443387159,"acs":182048,"articleLive":2,"columnArticles":1364,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":250747,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5217229394240318,"acs":63045,"articleLive":2,"columnArticles":693,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":120840,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7047515696457639,"acs":163656,"articleLive":2,"columnArticles":1246,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":232218,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6153922965290445,"acs":92443,"articleLive":2,"columnArticles":787,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":150218,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7318711704012644,"acs":221806,"articleLive":2,"columnArticles":1783,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":303067,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6684673707013268,"acs":148119,"articleLive":2,"columnArticles":1228,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":221580,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6817356205852674,"acs":182412,"articleLive":2,"columnArticles":1602,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":267570,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733746781725263,"acs":577468,"articleLive":2,"columnArticles":3461,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1007139,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6898419331713032,"acs":473433,"articleLive":2,"columnArticles":2696,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":686292,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5373782147108213,"acs":134085,"articleLive":2,"columnArticles":833,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":249517,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4451402057038538,"acs":163857,"articleLive":2,"columnArticles":1111,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":368102,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47274093368062514,"acs":283134,"articleLive":2,"columnArticles":1862,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":598920,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3967698547800685,"acs":37759,"articleLive":2,"columnArticles":333,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":95166,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46891376801565066,"acs":125358,"articleLive":2,"columnArticles":664,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":267337,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5434000105230904,"acs":175572,"articleLive":2,"columnArticles":1150,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":323099,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.683201560223174,"acs":123309,"articleLive":2,"columnArticles":1134,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":180487,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4455935266989881,"acs":131889,"articleLive":2,"columnArticles":1197,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":295985,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7229362163305226,"acs":136747,"articleLive":2,"columnArticles":894,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":189155,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49238069973767207,"acs":50115,"articleLive":2,"columnArticles":444,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101781,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6762042969534344,"acs":74089,"articleLive":2,"columnArticles":531,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":109566,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.575473474658345,"acs":128349,"articleLive":2,"columnArticles":991,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":223032,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4861882148351281,"acs":101766,"articleLive":2,"columnArticles":816,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":209314,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190933064018403,"acs":512656,"articleLive":2,"columnArticles":2324,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":712920,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7199410894208779,"acs":101678,"articleLive":2,"columnArticles":766,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":141231,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6618152170141901,"acs":114453,"articleLive":2,"columnArticles":867,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":172938,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5162070170443516,"acs":199434,"articleLive":2,"columnArticles":1246,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":386345,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4915491041052393,"acs":54181,"articleLive":2,"columnArticles":556,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":110225,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5125811944846715,"acs":543313,"articleLive":2,"columnArticles":2799,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1059955,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5528698770324633,"acs":304968,"articleLive":2,"columnArticles":1786,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":551609,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6218296367604869,"acs":130481,"articleLive":2,"columnArticles":1103,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":209834,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7041420608841834,"acs":424723,"articleLive":2,"columnArticles":1887,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":603178,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7508789382377561,"acs":309471,"articleLive":2,"columnArticles":1596,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":412145,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5259630794020544,"acs":240241,"articleLive":2,"columnArticles":1413,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":456764,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6818743535669671,"acs":101527,"articleLive":2,"columnArticles":795,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":148894,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671386127264334,"acs":215337,"articleLive":2,"columnArticles":1271,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":322777,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.34294687517967,"acs":47719,"articleLive":2,"columnArticles":521,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":139144,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5354777075092573,"acs":135644,"articleLive":2,"columnArticles":1069,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":253314,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4844103153653405,"acs":173602,"articleLive":2,"columnArticles":1457,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":358378,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4215338540793635,"acs":188609,"articleLive":2,"columnArticles":1268,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":447435,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.566942244259092,"acs":215878,"articleLive":2,"columnArticles":1523,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":380776,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5316584542068614,"acs":114910,"articleLive":2,"columnArticles":904,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":216135,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5737421968258938,"acs":293188,"articleLive":2,"columnArticles":1632,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":511010,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7250650477016479,"acs":6688,"articleLive":2,"columnArticles":119,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9224,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5340129573170732,"acs":5605,"articleLive":2,"columnArticles":83,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10496,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5921325051759835,"acs":2860,"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":4830,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5473249636222125,"acs":16174,"articleLive":2,"columnArticles":194,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29551,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6150333370314832,"acs":343704,"articleLive":2,"columnArticles":2005,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":558838,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3366185513060922,"acs":7719,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22931,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49703121833476,"acs":164322,"articleLive":2,"columnArticles":1116,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":330607,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3264909173005453,"acs":9400,"articleLive":2,"columnArticles":145,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28791,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6096831183685141,"acs":59702,"articleLive":2,"columnArticles":492,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97923,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192228710201604,"acs":87231,"articleLive":2,"columnArticles":932,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":168003,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33134621010270315,"acs":41909,"articleLive":2,"columnArticles":382,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":126481,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5866645919240644,"acs":301616,"articleLive":2,"columnArticles":1985,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":514120,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4327046569247105,"acs":85576,"articleLive":2,"columnArticles":763,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":197770,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646544511238277,"acs":395601,"articleLive":2,"columnArticles":2230,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":595198,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.419740777666999,"acs":8841,"articleLive":2,"columnArticles":89,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":21063,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7180177557851841,"acs":108537,"articleLive":2,"columnArticles":923,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":151162,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.44056491992508506,"acs":92212,"articleLive":2,"columnArticles":602,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":209304,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8046993751055564,"acs":76234,"articleLive":2,"columnArticles":640,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94736,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.48097174045478847,"acs":38686,"articleLive":2,"columnArticles":411,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":80433,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7393506440810657,"acs":309765,"articleLive":2,"columnArticles":1484,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":418969,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35579210655621657,"acs":256329,"articleLive":2,"columnArticles":1031,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":720446,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46303259255584184,"acs":130659,"articleLive":2,"columnArticles":503,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":282181,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6035626237022119,"acs":121674,"articleLive":2,"columnArticles":680,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":201593,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096730199913515,"acs":123160,"articleLive":2,"columnArticles":977,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":300630,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4868477202350341,"acs":88987,"articleLive":2,"columnArticles":523,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":182782,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7019175729822553,"acs":166770,"articleLive":2,"columnArticles":684,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":237592,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967221060922779,"acs":184093,"articleLive":2,"columnArticles":600,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":231063,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6768325591683256,"acs":152998,"articleLive":2,"columnArticles":555,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":226050,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47747809576098643,"acs":104360,"articleLive":2,"columnArticles":685,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":218565,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4973214900502651,"acs":72226,"articleLive":2,"columnArticles":641,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":145230,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.757258774073712,"acs":7746,"articleLive":2,"columnArticles":119,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10229,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5214324092358577,"acs":74727,"articleLive":2,"columnArticles":545,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":143311,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3930957492486046,"acs":91552,"articleLive":2,"columnArticles":709,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":232900,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4498058106736729,"acs":353703,"articleLive":2,"columnArticles":1767,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":786346,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6987118742905937,"acs":134196,"articleLive":2,"columnArticles":841,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":192062,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7494061390137652,"acs":193705,"articleLive":2,"columnArticles":1219,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":258478,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35633880490495035,"acs":21969,"articleLive":2,"columnArticles":178,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61652,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3252992718746143,"acs":26359,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":81030,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.345151233749005,"acs":10407,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30152,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4363164343511543,"acs":35966,"articleLive":2,"columnArticles":143,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":82431,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6654936373345,"acs":103443,"articleLive":2,"columnArticles":400,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":155438,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339599150724219,"acs":96069,"articleLive":2,"columnArticles":515,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":179918,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5162831748302864,"acs":398361,"articleLive":2,"columnArticles":2747,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":771594,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6526314841822863,"acs":144986,"articleLive":2,"columnArticles":1616,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":222156,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.558225929109088,"acs":338396,"articleLive":2,"columnArticles":2156,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":606199,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.524570011771937,"acs":50354,"articleLive":2,"columnArticles":330,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95991,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6195648296771892,"acs":173695,"articleLive":2,"columnArticles":1415,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":280350,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5170994354814364,"acs":239809,"articleLive":2,"columnArticles":1691,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":463758,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3778998293047485,"acs":170912,"articleLive":2,"columnArticles":738,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":452268,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5003117153000259,"acs":115562,"articleLive":2,"columnArticles":885,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":230980,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7235226927119606,"acs":730339,"articleLive":2,"columnArticles":7440,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1009421,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5428758169934641,"acs":145355,"articleLive":2,"columnArticles":955,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":267750,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.717155445141005,"acs":147800,"articleLive":2,"columnArticles":1001,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":206092,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47345754738083856,"acs":201076,"articleLive":2,"columnArticles":1421,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":424697,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5430482424932404,"acs":91584,"articleLive":2,"columnArticles":686,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":168648,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4627436785769688,"acs":62643,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":135373,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4332601497812099,"acs":170896,"articleLive":2,"columnArticles":1567,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":394442,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3720270126429577,"acs":31456,"articleLive":2,"columnArticles":309,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84553,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6463182078936112,"acs":451790,"articleLive":2,"columnArticles":2344,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":699021,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.737022502250225,"acs":102354,"articleLive":2,"columnArticles":1053,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":138875,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5575391146202591,"acs":379833,"articleLive":2,"columnArticles":1773,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":681267,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5418318558472716,"acs":31844,"articleLive":2,"columnArticles":282,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58771,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4247845857012295,"acs":112943,"articleLive":2,"columnArticles":908,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":265883,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28687987978751917,"acs":65293,"articleLive":2,"columnArticles":426,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":227597,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4774096536850178,"acs":142555,"articleLive":2,"columnArticles":1009,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":298601,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7822249037597634,"acs":119276,"articleLive":2,"columnArticles":894,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":152483,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5235171761739679,"acs":41528,"articleLive":2,"columnArticles":517,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":79325,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4178882245665874,"acs":72410,"articleLive":2,"columnArticles":664,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":173276,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6756338461388236,"acs":138384,"articleLive":2,"columnArticles":4769,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":204821,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.788267764278472,"acs":313312,"articleLive":2,"columnArticles":1892,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":397469,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4376180440963041,"acs":88047,"articleLive":2,"columnArticles":708,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":201196,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5798415061908522,"acs":58023,"articleLive":2,"columnArticles":655,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":100067,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4650688487305629,"acs":37625,"articleLive":2,"columnArticles":321,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80902,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7515384220618355,"acs":161087,"articleLive":2,"columnArticles":1099,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":214343,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5043482360984638,"acs":171142,"articleLive":2,"columnArticles":1232,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":339333,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6907927794785179,"acs":163597,"articleLive":2,"columnArticles":1295,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":236825,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47700865943220433,"acs":34814,"articleLive":2,"columnArticles":418,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72984,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49755931895686906,"acs":317921,"articleLive":2,"columnArticles":2029,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":638961,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6662923931787699,"acs":173869,"articleLive":2,"columnArticles":1000,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":260950,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6812194136167168,"acs":264619,"articleLive":2,"columnArticles":1421,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":388449,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8479624825384154,"acs":212457,"articleLive":2,"columnArticles":1021,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":250550,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7238173128530171,"acs":141604,"articleLive":2,"columnArticles":897,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":195635,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4969242898247975,"acs":197916,"articleLive":2,"columnArticles":1354,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":398282,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4790354592628731,"acs":172813,"articleLive":2,"columnArticles":781,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":360752,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7379726854711413,"acs":32259,"articleLive":2,"columnArticles":290,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43713,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6460355313596572,"acs":298805,"articleLive":2,"columnArticles":1727,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":462521,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6574472743194921,"acs":9009,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13703,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5514792899408284,"acs":5126,"articleLive":2,"columnArticles":61,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9295,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.600929978118162,"acs":4394,"articleLive":2,"columnArticles":60,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7312,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47590556274256146,"acs":5886,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12368,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5249205718824463,"acs":5287,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":10072,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46531038080333853,"acs":2676,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5751,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6385503181965269,"acs":5920,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9271,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6349006437167646,"acs":4537,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7146,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5439238653001464,"acs":3715,"articleLive":2,"columnArticles":70,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6830,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5646848334709607,"acs":12309,"articleLive":2,"columnArticles":159,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21798,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5017821358094567,"acs":32802,"articleLive":2,"columnArticles":353,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":65371,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5689692507579038,"acs":5255,"articleLive":2,"columnArticles":77,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9236,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47531252810504543,"acs":5285,"articleLive":2,"columnArticles":62,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11119,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6413937731892241,"acs":11928,"articleLive":2,"columnArticles":188,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18597,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6832746735335442,"acs":145407,"articleLive":2,"columnArticles":1075,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":212809,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6922273115170936,"acs":79494,"articleLive":2,"columnArticles":658,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114838,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5646274509803921,"acs":7199,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12750,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.723488060395525,"acs":52900,"articleLive":2,"columnArticles":451,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":73118,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49484946787320017,"acs":8695,"articleLive":2,"columnArticles":120,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17571,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4341666759549259,"acs":38953,"articleLive":2,"columnArticles":377,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":89719,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.515225160145243,"acs":107697,"articleLive":2,"columnArticles":840,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":209029,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5800762957717522,"acs":101576,"articleLive":2,"columnArticles":617,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":175108,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5905585219086363,"acs":6968,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11799,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6752297203833614,"acs":6834,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10121,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4470800567229599,"acs":3468,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7757,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6261274048600072,"acs":154393,"articleLive":2,"columnArticles":1126,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":246584,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33875058226799853,"acs":6545,"articleLive":2,"columnArticles":109,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19321,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5546363131593559,"acs":9989,"articleLive":2,"columnArticles":141,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":18010,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5540512820512821,"acs":2701,"articleLive":2,"columnArticles":46,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4875,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6493987049028677,"acs":3510,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5405,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3666306972920199,"acs":28540,"articleLive":2,"columnArticles":351,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":77844,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4401187887442796,"acs":54242,"articleLive":2,"columnArticles":565,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":123244,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4622294372294372,"acs":51252,"articleLive":2,"columnArticles":419,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110880,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4927486425183861,"acs":7169,"articleLive":2,"columnArticles":131,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14549,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5704134855242271,"acs":7546,"articleLive":2,"columnArticles":85,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13229,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45343301793239255,"acs":192500,"articleLive":2,"columnArticles":1104,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":424539,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6326318135604088,"acs":207204,"articleLive":2,"columnArticles":1218,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":327527,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6852052485855302,"acs":5692,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8307,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7599535018889858,"acs":2615,"articleLive":2,"columnArticles":66,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3441,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.48567415730337077,"acs":19019,"articleLive":2,"columnArticles":162,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":39160,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6392135991999284,"acs":506851,"articleLive":2,"columnArticles":3445,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":792929,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7710951248880793,"acs":24975,"articleLive":2,"columnArticles":210,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32389,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6357326678624347,"acs":8152,"articleLive":2,"columnArticles":104,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12823,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5098936541143654,"acs":11699,"articleLive":2,"columnArticles":151,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22944,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6589843056717629,"acs":181937,"articleLive":2,"columnArticles":1243,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":276087,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4345498783454988,"acs":3572,"articleLive":2,"columnArticles":55,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8220,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.753622168091128,"acs":53523,"articleLive":2,"columnArticles":831,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":71021,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45646389177599894,"acs":83883,"articleLive":2,"columnArticles":1116,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":183767,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.531897265948633,"acs":2568,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4828,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7082150716926076,"acs":115529,"articleLive":2,"columnArticles":772,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":163127,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7119634963638957,"acs":4993,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":7013,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5814984951686996,"acs":3671,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6313,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5231832906251511,"acs":64926,"articleLive":2,"columnArticles":507,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":124098,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6203909923286315,"acs":2507,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4041,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5608153321762406,"acs":107275,"articleLive":2,"columnArticles":769,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":191284,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5783895864531736,"acs":5021,"articleLive":2,"columnArticles":83,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8681,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5047076028196322,"acs":30716,"articleLive":2,"columnArticles":364,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60859,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.517210014371415,"acs":369605,"articleLive":2,"columnArticles":2043,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":714613,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.524654649073902,"acs":33878,"articleLive":2,"columnArticles":237,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":64572,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6568848758465011,"acs":2037,"articleLive":2,"columnArticles":39,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3101,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7268674349657832,"acs":130432,"articleLive":2,"columnArticles":800,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":179444,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5481356916037833,"acs":64213,"articleLive":2,"columnArticles":571,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":117148,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3836180464301358,"acs":4379,"articleLive":2,"columnArticles":65,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11415,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3380600689315608,"acs":17165,"articleLive":2,"columnArticles":257,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50775,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5388116701452107,"acs":24267,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":45038,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.611006711409396,"acs":2276,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3725,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.609323639836816,"acs":119935,"articleLive":2,"columnArticles":959,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":196833,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3795998632010944,"acs":22199,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":58480,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.761854583772392,"acs":3615,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4745,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6833792360196383,"acs":57069,"articleLive":2,"columnArticles":387,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":83510,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6280684089279448,"acs":41168,"articleLive":2,"columnArticles":356,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65547,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5465620241302566,"acs":4666,"articleLive":2,"columnArticles":88,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8537,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4177988907485806,"acs":50923,"articleLive":2,"columnArticles":481,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121884,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4762445013642185,"acs":68423,"articleLive":2,"columnArticles":541,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":143672,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4840989399293286,"acs":4384,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":9056,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6858734819164554,"acs":20557,"articleLive":2,"columnArticles":184,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29972,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5190565448297407,"acs":23261,"articleLive":2,"columnArticles":230,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44814,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6773097826086957,"acs":2991,"articleLive":2,"columnArticles":50,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4416,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42390016586367585,"acs":26835,"articleLive":2,"columnArticles":233,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":63305,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44526138077779887,"acs":312004,"articleLive":2,"columnArticles":1844,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":700721,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6326029898436608,"acs":11087,"articleLive":2,"columnArticles":153,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17526,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784977908689249,"acs":25700,"articleLive":2,"columnArticles":170,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67900,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5366573911068204,"acs":9450,"articleLive":2,"columnArticles":107,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17609,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044620331254857,"acs":136968,"articleLive":2,"columnArticles":586,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":271513,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4207694650289311,"acs":24870,"articleLive":2,"columnArticles":206,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":59106,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6558099829265843,"acs":130598,"articleLive":2,"columnArticles":1074,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":199140,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4866943796105423,"acs":57135,"articleLive":2,"columnArticles":501,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":117394,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.533346426867933,"acs":19009,"articleLive":2,"columnArticles":150,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35641,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4798357141341031,"acs":45213,"articleLive":2,"columnArticles":508,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":94226,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44967318803399736,"acs":40315,"articleLive":2,"columnArticles":331,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":89654,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4697265625,"acs":4810,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10240,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41197795190300235,"acs":47162,"articleLive":2,"columnArticles":313,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":114477,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36970134874759153,"acs":3070,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8304,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4012290059828444,"acs":22265,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55492,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6078612865089766,"acs":132656,"articleLive":2,"columnArticles":940,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":218234,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7868898606574484,"acs":162130,"articleLive":2,"columnArticles":1395,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":206039,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8100858369098712,"acs":3775,"articleLive":2,"columnArticles":59,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4660,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49402911827253393,"acs":12080,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24452,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7269390923847837,"acs":51500,"articleLive":2,"columnArticles":490,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70845,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5163409436476672,"acs":87953,"articleLive":2,"columnArticles":774,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":170339,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6065729217175799,"acs":112586,"articleLive":2,"columnArticles":1066,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":185610,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.769597077073808,"acs":377041,"articleLive":2,"columnArticles":1991,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":489920,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5393148883997814,"acs":109530,"articleLive":2,"columnArticles":1042,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":203091,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.705948816451048,"acs":12496,"articleLive":2,"columnArticles":135,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17701,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223228361884723,"acs":206450,"articleLive":2,"columnArticles":1525,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":331741,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6006035003017501,"acs":4976,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8285,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7379566927537408,"acs":218385,"articleLive":2,"columnArticles":1540,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":295932,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5506467537336749,"acs":255548,"articleLive":2,"columnArticles":1430,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":464087,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5904855858818371,"acs":5387,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9123,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6796721953767794,"acs":20817,"articleLive":2,"columnArticles":343,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":30628,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4290341017336636,"acs":2252,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5249,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4542598481739844,"acs":70850,"articleLive":2,"columnArticles":548,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155968,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40823663253697384,"acs":26913,"articleLive":2,"columnArticles":440,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65925,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35303129787699716,"acs":1613,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4569,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5205613917837973,"acs":24925,"articleLive":2,"columnArticles":391,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47881,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3518431001890359,"acs":4467,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12696,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7266923990498813,"acs":4895,"articleLive":2,"columnArticles":58,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6736,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6019095060190951,"acs":2900,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4818,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5672504676075497,"acs":3336,"articleLive":2,"columnArticles":65,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5881,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6909915481344053,"acs":3352,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4851,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48940637244030455,"acs":33101,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67635,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7219417475728155,"acs":1859,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2575,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36603081280576777,"acs":34117,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":93208,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7657466383581033,"acs":4328,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5652,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4385504084767268,"acs":78804,"articleLive":2,"columnArticles":634,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":179692,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45899134534580416,"acs":42056,"articleLive":2,"columnArticles":455,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91627,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6184497816593887,"acs":4532,"articleLive":2,"columnArticles":131,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7328,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7238871749669458,"acs":3285,"articleLive":2,"columnArticles":49,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4538,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6128488240187552,"acs":81037,"articleLive":2,"columnArticles":508,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":132230,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5114349537283268,"acs":14424,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":28203,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.41570123481578153,"acs":20704,"articleLive":2,"columnArticles":211,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49805,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5157579770926839,"acs":84116,"articleLive":2,"columnArticles":575,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":163092,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.47050771924240015,"acs":14781,"articleLive":2,"columnArticles":125,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31415,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4648798799703541,"acs":77151,"articleLive":2,"columnArticles":827,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":165959,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5093220994048079,"acs":65891,"articleLive":2,"columnArticles":559,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":129370,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390854006725462,"acs":80581,"articleLive":2,"columnArticles":566,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":126088,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6388888888888888,"acs":3220,"articleLive":2,"columnArticles":70,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":5040,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5036282405167752,"acs":35396,"articleLive":2,"columnArticles":221,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":70282,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4413655370405043,"acs":21216,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":48069,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6327195634250716,"acs":16116,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25471,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6029354093135414,"acs":72260,"articleLive":2,"columnArticles":791,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":119847,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5800056889044483,"acs":53016,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":91406,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41817057401472985,"acs":7438,"articleLive":2,"columnArticles":86,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17787,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7503633240850839,"acs":22718,"articleLive":2,"columnArticles":243,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30276,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5348062381852552,"acs":226330,"articleLive":2,"columnArticles":1227,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":423200,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5287267745526159,"acs":6175,"articleLive":2,"columnArticles":113,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11679,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6915965301977407,"acs":101812,"articleLive":2,"columnArticles":999,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":147213,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4662928673881862,"acs":7152,"articleLive":2,"columnArticles":97,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15338,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.359252193819153,"acs":4708,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13105,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5151737302202058,"acs":148980,"articleLive":2,"columnArticles":1598,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":289184,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39128760023812026,"acs":11174,"articleLive":2,"columnArticles":128,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28557,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5529604689922654,"acs":123752,"articleLive":2,"columnArticles":1318,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":223799,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.520592834589986,"acs":52267,"articleLive":2,"columnArticles":431,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":100399,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42959836749837677,"acs":9263,"articleLive":2,"columnArticles":150,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21562,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37672149961744456,"acs":15756,"articleLive":2,"columnArticles":198,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41824,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.658482845451684,"acs":14644,"articleLive":2,"columnArticles":123,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22239,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5918015462484009,"acs":42560,"articleLive":2,"columnArticles":534,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71916,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.417541837431694,"acs":19561,"articleLive":2,"columnArticles":201,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46848,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6140617211220374,"acs":54202,"articleLive":2,"columnArticles":658,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":88268,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32710772483395495,"acs":82001,"articleLive":2,"columnArticles":593,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":250685,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45562813277025693,"acs":46177,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":101348,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5847962230328771,"acs":102437,"articleLive":2,"columnArticles":1136,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":175167,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5617309519748545,"acs":46108,"articleLive":2,"columnArticles":465,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":82082,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.73777502022543,"acs":121288,"articleLive":2,"columnArticles":806,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":164397,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48334563572614875,"acs":10477,"articleLive":2,"columnArticles":131,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21676,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32505888747961587,"acs":3588,"articleLive":2,"columnArticles":83,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":11038,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5560831376641447,"acs":95916,"articleLive":2,"columnArticles":1343,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":172485,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5650477695670126,"acs":39685,"articleLive":2,"columnArticles":322,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":70233,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5049614112458655,"acs":916,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1814,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7083764861841833,"acs":102597,"articleLive":2,"columnArticles":592,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":144834,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6881448884784637,"acs":73028,"articleLive":2,"columnArticles":945,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":106123,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39354677517221687,"acs":88208,"articleLive":2,"columnArticles":1149,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":224136,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5387565625077755,"acs":151570,"articleLive":2,"columnArticles":1098,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":281333,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5079369162350951,"acs":177719,"articleLive":2,"columnArticles":1010,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":349884,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48167215815486,"acs":28068,"articleLive":2,"columnArticles":330,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":58272,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3611612268328686,"acs":2202,"articleLive":2,"columnArticles":34,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6097,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7556569343065693,"acs":12423,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16440,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20866112234959167,"acs":2785,"articleLive":2,"columnArticles":53,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13347,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6218821073039782,"acs":33359,"articleLive":2,"columnArticles":307,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53642,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4286921614198183,"acs":2029,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4733,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.568481299081592,"acs":8542,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":15026,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5317701149425287,"acs":52047,"articleLive":2,"columnArticles":456,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97875,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6175298804780877,"acs":1550,"articleLive":2,"columnArticles":32,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2510,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6696682464454976,"acs":7065,"articleLive":2,"columnArticles":115,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10550,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6138277441276407,"acs":4155,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6769,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6540711847879084,"acs":2683,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4102,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7003986399343417,"acs":59737,"articleLive":2,"columnArticles":479,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":85290,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5878311940258842,"acs":44239,"articleLive":2,"columnArticles":675,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":75258,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7333333333333333,"acs":880,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1200,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37922431390337946,"acs":6688,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17636,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5318581711543588,"acs":15960,"articleLive":2,"columnArticles":217,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":30008,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3989781729178071,"acs":63410,"articleLive":2,"columnArticles":879,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":158931,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5074575469758644,"acs":98735,"articleLive":2,"columnArticles":869,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":194568,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48814984709480125,"acs":8939,"articleLive":2,"columnArticles":147,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18312,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.574319268533051,"acs":125877,"articleLive":2,"columnArticles":1036,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":219176,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5190727496392074,"acs":97472,"articleLive":2,"columnArticles":854,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":187781,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5910659898477157,"acs":2911,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4925,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3806296060413065,"acs":16734,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43964,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45900893985379737,"acs":77735,"articleLive":2,"columnArticles":746,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":169354,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6973588716039254,"acs":44200,"articleLive":2,"columnArticles":447,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":63382,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4774586025848142,"acs":56745,"articleLive":2,"columnArticles":694,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118848,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2524257678558401,"acs":3460,"articleLive":2,"columnArticles":54,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13707,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5886328119500486,"acs":83620,"articleLive":2,"columnArticles":942,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":142058,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5509273768483433,"acs":19337,"articleLive":2,"columnArticles":173,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":35099,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6628826876185315,"acs":48934,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73820,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6488781501303182,"acs":139915,"articleLive":2,"columnArticles":1106,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":215626,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.559058217339965,"acs":15624,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27947,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48719973727011134,"acs":62307,"articleLive":2,"columnArticles":627,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":127888,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7115188846903739,"acs":82475,"articleLive":2,"columnArticles":956,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115914,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5088639213885003,"acs":98599,"articleLive":2,"columnArticles":860,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":193763,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5565540378624491,"acs":27870,"articleLive":2,"columnArticles":315,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":50076,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.603745205685493,"acs":80280,"articleLive":2,"columnArticles":506,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":132970,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5768781308383389,"acs":155006,"articleLive":2,"columnArticles":1271,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":268698,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36255790877432487,"acs":57365,"articleLive":2,"columnArticles":463,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":158223,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4361572210412049,"acs":28929,"articleLive":2,"columnArticles":334,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66327,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6130590339892665,"acs":6854,"articleLive":2,"columnArticles":65,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11180,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5111196852585106,"acs":80807,"articleLive":2,"columnArticles":649,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":158098,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4374061728709193,"acs":34381,"articleLive":2,"columnArticles":405,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":78602,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8123258326856363,"acs":171404,"articleLive":2,"columnArticles":1369,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":211004,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.605454005683023,"acs":14276,"articleLive":2,"columnArticles":133,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23579,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7085344182144565,"acs":78546,"articleLive":2,"columnArticles":946,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110857,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3556668556668557,"acs":11291,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31746,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.531014112241549,"acs":1618,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3047,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37403330873150853,"acs":11656,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31163,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4414755732801595,"acs":8856,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":20060,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25168124739629827,"acs":25374,"articleLive":2,"columnArticles":300,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100818,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.434657455382844,"acs":1510,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3474,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470620239390642,"acs":64352,"articleLive":2,"columnArticles":337,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":117632,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6180026869682043,"acs":1380,"articleLive":2,"columnArticles":25,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2233,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39826503140891417,"acs":6657,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16715,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4203791469194313,"acs":21288,"articleLive":2,"columnArticles":184,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50640,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6122610954335557,"acs":76371,"articleLive":2,"columnArticles":608,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":124736,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33472790569840594,"acs":21922,"articleLive":2,"columnArticles":245,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":65492,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.714342534404582,"acs":62860,"articleLive":2,"columnArticles":849,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":87997,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6035734140465748,"acs":39085,"articleLive":2,"columnArticles":330,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64756,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43826358201195736,"acs":6744,"articleLive":2,"columnArticles":50,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15388,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4203545811341183,"acs":3106,"articleLive":2,"columnArticles":26,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7389,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4478584028102338,"acs":29706,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66329,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5409929078014184,"acs":5721,"articleLive":2,"columnArticles":99,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10575,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4722949666016774,"acs":40939,"articleLive":2,"columnArticles":435,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":86681,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5906286665909694,"acs":15605,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":26421,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6361674579197237,"acs":1474,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2317,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6071975460242756,"acs":124113,"articleLive":2,"columnArticles":1002,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":204403,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.586445279603816,"acs":46657,"articleLive":2,"columnArticles":404,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79559,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5779471348639784,"acs":5991,"articleLive":2,"columnArticles":115,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10366,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3881824161368121,"acs":3541,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9122,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7212971078001753,"acs":1646,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2282,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48408319185059423,"acs":6843,"articleLive":2,"columnArticles":82,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14136,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5454535188363899,"acs":48301,"articleLive":2,"columnArticles":410,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":88552,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5523129289660175,"acs":19796,"articleLive":2,"columnArticles":185,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35842,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34612541339731534,"acs":26688,"articleLive":2,"columnArticles":269,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":77105,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4929747632748139,"acs":153010,"articleLive":2,"columnArticles":1054,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":310381,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5434932335585712,"acs":29197,"articleLive":2,"columnArticles":444,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":53721,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6874396230506871,"acs":104607,"articleLive":2,"columnArticles":1080,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":152169,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4041924213920989,"acs":3008,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7442,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4697814155440195,"acs":44252,"articleLive":2,"columnArticles":457,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":94197,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3726177130044843,"acs":2659,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7136,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7093004678762981,"acs":31078,"articleLive":2,"columnArticles":486,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43815,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5134490138416296,"acs":66696,"articleLive":2,"columnArticles":550,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":129898,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44138013909542906,"acs":29384,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66573,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6361430652840517,"acs":104351,"articleLive":2,"columnArticles":989,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":164037,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5039849976558838,"acs":31175,"articleLive":2,"columnArticles":331,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61857,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4846678023850085,"acs":5690,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11740,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5632275267934977,"acs":21967,"articleLive":2,"columnArticles":299,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":39002,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4128466991887895,"acs":29874,"articleLive":2,"columnArticles":237,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":72361,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6776493168212768,"acs":14829,"articleLive":2,"columnArticles":214,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21883,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6740273764545256,"acs":250294,"articleLive":2,"columnArticles":1514,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":371341,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6080161794447508,"acs":3307,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5439,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7322966774807025,"acs":19638,"articleLive":2,"columnArticles":110,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26817,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5378589317956782,"acs":18469,"articleLive":2,"columnArticles":153,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":34338,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7310313876188607,"acs":52124,"articleLive":2,"columnArticles":581,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":71302,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.49974725774655004,"acs":19773,"articleLive":2,"columnArticles":244,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39566,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.644842697364118,"acs":39436,"articleLive":2,"columnArticles":428,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":61156,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6545924387948676,"acs":87646,"articleLive":2,"columnArticles":631,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":133894,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5097261867004969,"acs":19286,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37836,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6578689367400375,"acs":110047,"articleLive":2,"columnArticles":692,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":167278,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3972761518400464,"acs":2742,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6902,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5637677325945623,"acs":40496,"articleLive":2,"columnArticles":653,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71831,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.713514566348535,"acs":25643,"articleLive":2,"columnArticles":254,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35939,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3621848739495798,"acs":6896,"articleLive":2,"columnArticles":108,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":19040,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2746546446527414,"acs":69269,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":252204,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4955722186407899,"acs":73030,"articleLive":2,"columnArticles":759,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":147365,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5359722385601694,"acs":45563,"articleLive":2,"columnArticles":520,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":85010,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.735100504172079,"acs":33389,"articleLive":2,"columnArticles":382,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45421,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5786127167630057,"acs":2002,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3460,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47723113844307785,"acs":31817,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66670,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6451284372524613,"acs":39907,"articleLive":2,"columnArticles":465,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61859,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6212402206776174,"acs":79725,"articleLive":2,"columnArticles":642,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":128332,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6588053021174041,"acs":3827,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5809,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37545935024815896,"acs":25645,"articleLive":2,"columnArticles":279,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68303,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5259636827014973,"acs":1651,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3139,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6752310536044362,"acs":14612,"articleLive":2,"columnArticles":140,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21640,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8422916336345859,"acs":15937,"articleLive":2,"columnArticles":104,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18921,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5385679695607056,"acs":3114,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5782,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7122593106778535,"acs":11800,"articleLive":2,"columnArticles":175,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16567,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7018932241835946,"acs":110777,"articleLive":2,"columnArticles":850,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":157826,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5983114210106272,"acs":14244,"articleLive":2,"columnArticles":191,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23807,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5821592057547114,"acs":39170,"articleLive":2,"columnArticles":412,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":67284,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6068446864697296,"acs":73995,"articleLive":2,"columnArticles":810,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":121934,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4579485253163737,"acs":70710,"articleLive":2,"columnArticles":650,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":154406,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5530464283379222,"acs":152257,"articleLive":2,"columnArticles":1246,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":275306,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.71124150710315,"acs":2303,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3238,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4192963365977512,"acs":3468,"articleLive":2,"columnArticles":80,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8271,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6286295005807201,"acs":15155,"articleLive":2,"columnArticles":121,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24108,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6188365360094805,"acs":165014,"articleLive":2,"columnArticles":1159,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":266652,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3554875382597289,"acs":1626,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4574,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48220994475138124,"acs":2182,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4525,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.438631654040833,"acs":12912,"articleLive":2,"columnArticles":181,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29437,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.567668739921677,"acs":59142,"articleLive":2,"columnArticles":760,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":104184,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5776664108958374,"acs":24091,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41704,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6055138860733833,"acs":5974,"articleLive":2,"columnArticles":87,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9866,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5032950007637419,"acs":46129,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91654,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3439529848437983,"acs":1112,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3233,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32603760276841015,"acs":14792,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45369,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7451836236447256,"acs":165433,"articleLive":2,"columnArticles":1372,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":222003,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5051546391752577,"acs":2940,"articleLive":2,"columnArticles":39,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5820,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7282457832459008,"acs":61914,"articleLive":2,"columnArticles":553,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":85018,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465087636741784,"acs":153716,"articleLive":2,"columnArticles":949,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":344262,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.774959649527323,"acs":90747,"articleLive":2,"columnArticles":756,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":117099,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46680128281268557,"acs":3930,"articleLive":2,"columnArticles":64,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8419,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6067250919083516,"acs":32677,"articleLive":2,"columnArticles":328,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53858,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17977798260730174,"acs":4486,"articleLive":2,"columnArticles":77,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24953,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6104164906648644,"acs":14451,"articleLive":2,"columnArticles":141,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23674,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6877532817559576,"acs":70939,"articleLive":2,"columnArticles":659,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":103146,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43225093535813647,"acs":121654,"articleLive":2,"columnArticles":1106,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":281443,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5082592121982211,"acs":1200,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2361,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5656302996042962,"acs":10006,"articleLive":2,"columnArticles":157,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17690,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6614591233126043,"acs":13083,"articleLive":2,"columnArticles":114,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19779,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.487434702809544,"acs":6905,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14166,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47334807851810895,"acs":85605,"articleLive":2,"columnArticles":747,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":180850,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6621621621621622,"acs":1029,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1554,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6480743021553682,"acs":12839,"articleLive":2,"columnArticles":114,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19811,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6836178018822778,"acs":42856,"articleLive":2,"columnArticles":446,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62690,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46851053855723634,"acs":25985,"articleLive":2,"columnArticles":282,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55463,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7016789423120912,"acs":15338,"articleLive":2,"columnArticles":87,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21859,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49598344093440444,"acs":10064,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20291,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.410451653280484,"acs":7870,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":19174,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5238314883148831,"acs":10221,"articleLive":2,"columnArticles":82,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19512,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40517363428594544,"acs":100165,"articleLive":2,"columnArticles":868,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":247215,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4091205515185392,"acs":8783,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21468,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6198669086509377,"acs":51232,"articleLive":2,"columnArticles":496,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":82650,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7743720261148611,"acs":13996,"articleLive":2,"columnArticles":63,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":18074,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5951168468782699,"acs":8531,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14335,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7453785322117564,"acs":14798,"articleLive":2,"columnArticles":89,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19853,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38497150997151,"acs":2162,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5616,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42670825063793594,"acs":1505,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3527,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7455455455455455,"acs":89376,"articleLive":2,"columnArticles":569,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119880,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.761661833888802,"acs":63304,"articleLive":2,"columnArticles":468,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":83113,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3401964488099736,"acs":1801,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5294,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5230308613542146,"acs":4542,"articleLive":2,"columnArticles":111,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8684,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4427113321120126,"acs":8458,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19105,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5184958781612408,"acs":29687,"articleLive":2,"columnArticles":274,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":57256,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7970224766330142,"acs":104288,"articleLive":2,"columnArticles":241,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":130847,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4212614731674891,"acs":82384,"articleLive":2,"columnArticles":293,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":195565,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4417373771318155,"acs":10516,"articleLive":2,"columnArticles":85,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23806,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.517868992321547,"acs":16389,"articleLive":2,"columnArticles":212,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31647,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221786414690676,"acs":29289,"articleLive":2,"columnArticles":277,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":56090,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4812792900588294,"acs":19307,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40116,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5016860893705789,"acs":31986,"articleLive":2,"columnArticles":379,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63757,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6306484797683457,"acs":8276,"articleLive":2,"columnArticles":89,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":13123,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6709123992721602,"acs":12905,"articleLive":2,"columnArticles":116,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":19235,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37371134020618557,"acs":2465,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6596,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33363769395430964,"acs":110350,"articleLive":2,"columnArticles":1271,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":330748,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5690697215089867,"acs":28812,"articleLive":2,"columnArticles":316,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50630,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.660441152793431,"acs":12306,"articleLive":2,"columnArticles":87,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18633,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6563719667402003,"acs":7736,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11786,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48470778981501955,"acs":6577,"articleLive":2,"columnArticles":102,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13569,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6648756716231413,"acs":10642,"articleLive":2,"columnArticles":74,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":16006,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319466945388033,"acs":50894,"articleLive":2,"columnArticles":399,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95675,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6700883691868249,"acs":7507,"articleLive":2,"columnArticles":65,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11203,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8169911995010741,"acs":11790,"articleLive":2,"columnArticles":82,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14431,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3466175485599464,"acs":8280,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23888,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42478504378007415,"acs":5385,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12677,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46240860808387363,"acs":3352,"articleLive":2,"columnArticles":56,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7249,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7878734420257153,"acs":192041,"articleLive":2,"columnArticles":1262,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":243746,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6197517824135199,"acs":4694,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7574,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4664829375050661,"acs":11510,"articleLive":2,"columnArticles":81,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24674,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7736151531593746,"acs":94101,"articleLive":2,"columnArticles":313,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":121638,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5712501996312267,"acs":78692,"articleLive":2,"columnArticles":503,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":137754,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43779289193815973,"acs":66235,"articleLive":2,"columnArticles":428,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":151293,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5459183673469388,"acs":11128,"articleLive":2,"columnArticles":192,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20384,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4205803741886216,"acs":2203,"articleLive":2,"columnArticles":50,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5238,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3433038749150238,"acs":2525,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7355,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6842914737942363,"acs":45827,"articleLive":2,"columnArticles":358,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66970,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8080905663208839,"acs":86157,"articleLive":2,"columnArticles":344,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":106618,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5245311698181842,"acs":80750,"articleLive":2,"columnArticles":769,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":153947,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4068011302737991,"acs":4175,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10263,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3679812260317097,"acs":6429,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17471,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28877146631439893,"acs":1093,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3785,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5979111447683958,"acs":18949,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31692,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3975134690589282,"acs":94737,"articleLive":2,"columnArticles":772,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":238324,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44055269922879176,"acs":1371,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3112,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.55284443246158,"acs":4101,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7418,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5531903037057676,"acs":9927,"articleLive":2,"columnArticles":113,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17945,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900144823251874,"acs":75756,"articleLive":2,"columnArticles":658,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":109789,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.592057391749936,"acs":11554,"articleLive":2,"columnArticles":120,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19515,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37689033269855493,"acs":20187,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53562,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4250574981483647,"acs":10904,"articleLive":2,"columnArticles":213,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25653,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5331005311823727,"acs":21678,"articleLive":2,"columnArticles":242,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40664,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4896183508008701,"acs":2476,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5057,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45027703644552786,"acs":64282,"articleLive":2,"columnArticles":577,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":142761,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4024390243902439,"acs":1155,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2870,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43344361316841484,"acs":69175,"articleLive":2,"columnArticles":698,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":159594,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5780028201512627,"acs":22545,"articleLive":2,"columnArticles":202,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":39005,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6569453783483714,"acs":126033,"articleLive":2,"columnArticles":929,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":191847,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5849317295188556,"acs":21591,"articleLive":2,"columnArticles":282,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36912,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4818484568715379,"acs":29227,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60656,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5671922481509087,"acs":49462,"articleLive":2,"columnArticles":656,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":87205,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5842178126442086,"acs":3798,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6501,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5715813624523453,"acs":33134,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57969,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5986473980209297,"acs":42046,"articleLive":2,"columnArticles":400,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":70235,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8109203497488505,"acs":61025,"articleLive":2,"columnArticles":619,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":75254,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5970476011759555,"acs":9545,"articleLive":2,"columnArticles":143,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15987,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3079710144927536,"acs":850,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2760,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834099194895944,"acs":82515,"articleLive":2,"columnArticles":632,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105328,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45476306054468457,"acs":27168,"articleLive":2,"columnArticles":242,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59741,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419890868300473,"acs":28507,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52597,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6566604127579737,"acs":700,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1066,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5612032498489223,"acs":16716,"articleLive":2,"columnArticles":214,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29786,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4092968618895788,"acs":29268,"articleLive":2,"columnArticles":280,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":71508,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4646098003629764,"acs":1792,"articleLive":2,"columnArticles":36,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3857,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.653514216468641,"acs":22111,"articleLive":2,"columnArticles":190,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33834,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2708581248449594,"acs":75340,"articleLive":2,"columnArticles":944,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":278153,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6191304347826087,"acs":2136,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3450,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6241195138942642,"acs":8063,"articleLive":2,"columnArticles":121,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12919,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5094533951298462,"acs":6925,"articleLive":2,"columnArticles":68,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13593,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6653725306078226,"acs":36847,"articleLive":2,"columnArticles":310,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":55378,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4523843015895344,"acs":19296,"articleLive":2,"columnArticles":287,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42654,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4857942996521975,"acs":53775,"articleLive":2,"columnArticles":674,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110695,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5471614429331756,"acs":3701,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6764,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43560760815288935,"acs":47980,"articleLive":2,"columnArticles":418,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":110145,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4975368412111946,"acs":93724,"articleLive":2,"columnArticles":777,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":188376,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4010416666666667,"acs":2926,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7296,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5893088903309539,"acs":7265,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12328,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6182056856873283,"acs":15070,"articleLive":2,"columnArticles":253,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24377,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38576439868827095,"acs":43878,"articleLive":2,"columnArticles":480,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113743,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5416182572614108,"acs":26106,"articleLive":2,"columnArticles":263,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":48200,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40170822616804436,"acs":87621,"articleLive":2,"columnArticles":831,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":218121,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.503457548981944,"acs":2621,"articleLive":2,"columnArticles":64,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5206,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6950410991780165,"acs":46337,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66668,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4343277799302596,"acs":2242,"articleLive":2,"columnArticles":52,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5162,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6657681050986951,"acs":60509,"articleLive":2,"columnArticles":611,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90886,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4311665525504964,"acs":20151,"articleLive":2,"columnArticles":254,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46736,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35649738305528295,"acs":17437,"articleLive":2,"columnArticles":197,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48912,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4417229923244358,"acs":38558,"articleLive":2,"columnArticles":274,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":87290,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108372827804107,"acs":8084,"articleLive":2,"columnArticles":107,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15825,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4887813462384514,"acs":3333,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6819,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6478764567690819,"acs":56259,"articleLive":2,"columnArticles":571,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86836,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49322676781360064,"acs":3641,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7382,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5773240989304138,"acs":68604,"articleLive":2,"columnArticles":742,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":118831,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.609653603268945,"acs":26259,"articleLive":2,"columnArticles":286,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":43072,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.535959569781003,"acs":4136,"articleLive":2,"columnArticles":79,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7717,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6653584011724201,"acs":132570,"articleLive":2,"columnArticles":1312,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":199246,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6316978501988776,"acs":52568,"articleLive":2,"columnArticles":477,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":83217,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6047766419142658,"acs":67028,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110831,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44691980138207427,"acs":30332,"articleLive":2,"columnArticles":219,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67869,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47765267826680313,"acs":2800,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5862,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7608861796014922,"acs":83629,"articleLive":2,"columnArticles":531,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":109910,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.72297802362087,"acs":77376,"articleLive":2,"columnArticles":575,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":107024,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.742664418212479,"acs":4404,"articleLive":2,"columnArticles":77,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5930,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5131700144502565,"acs":60727,"articleLive":2,"columnArticles":554,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":118337,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5545678248882361,"acs":301315,"articleLive":2,"columnArticles":1493,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":543333,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6450383855275159,"acs":67889,"articleLive":2,"columnArticles":435,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":105248,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6441848754214652,"acs":58845,"articleLive":2,"columnArticles":393,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":91348,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3226727724844277,"acs":65530,"articleLive":2,"columnArticles":452,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":203085,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33965035992360804,"acs":2312,"articleLive":2,"columnArticles":53,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6807,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7586379676122856,"acs":71161,"articleLive":2,"columnArticles":513,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93801,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3530235349023268,"acs":5295,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14999,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.559190031152648,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1284,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.672911547911548,"acs":15337,"articleLive":2,"columnArticles":173,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22792,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41593858464274114,"acs":24327,"articleLive":2,"columnArticles":224,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":58487,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7221732453645774,"acs":101578,"articleLive":2,"columnArticles":680,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":140656,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40894568690095845,"acs":2688,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6573,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4611451942740286,"acs":4059,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8802,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115706072757138,"acs":31767,"articleLive":2,"columnArticles":382,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":62097,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5648294585903316,"acs":85714,"articleLive":2,"columnArticles":596,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":151752,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37043449583642507,"acs":8986,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24258,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4840459918729221,"acs":20965,"articleLive":2,"columnArticles":280,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":43312,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46944569916758083,"acs":29100,"articleLive":2,"columnArticles":338,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61988,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3220543423057389,"acs":5073,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15752,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7195909580193757,"acs":1337,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1858,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4636357285661536,"acs":139374,"articleLive":2,"columnArticles":871,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":300611,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6085282868921671,"acs":49006,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80532,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524720973688197,"acs":21879,"articleLive":2,"columnArticles":398,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39602,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.410106085985483,"acs":2938,"articleLive":2,"columnArticles":50,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7164,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7604124815856435,"acs":34068,"articleLive":2,"columnArticles":311,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44802,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5146653603576021,"acs":8405,"articleLive":2,"columnArticles":95,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16331,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49114770335520613,"acs":3967,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8077,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5048387096774194,"acs":4069,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":8060,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6106666666666667,"acs":3435,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5625,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5802932239180072,"acs":67603,"articleLive":2,"columnArticles":579,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":116498,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.48045078196872126,"acs":2089,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4348,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4075643080680864,"acs":21358,"articleLive":2,"columnArticles":267,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":52404,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4645390070921986,"acs":1572,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3384,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4622037914691943,"acs":3901,"articleLive":2,"columnArticles":66,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8440,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.501608569397419,"acs":41630,"articleLive":2,"columnArticles":594,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82993,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6803988495938813,"acs":215285,"articleLive":2,"columnArticles":1535,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":316410,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6292892967537856,"acs":52321,"articleLive":2,"columnArticles":607,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":83143,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3680498305395255,"acs":4018,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10917,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4927672955974843,"acs":1567,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3180,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5210500292174226,"acs":57959,"articleLive":2,"columnArticles":527,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":111235,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4588799220661331,"acs":41452,"articleLive":2,"columnArticles":367,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":90333,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3939148073022312,"acs":2913,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7395,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5891906921036872,"acs":137741,"articleLive":2,"columnArticles":1318,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":233780,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41697359642468723,"acs":45624,"articleLive":2,"columnArticles":406,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109417,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.601923629055412,"acs":12579,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20898,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.4981949458483754,"acs":1380,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2770,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7207303974221267,"acs":2013,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2793,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5026949335249731,"acs":1399,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2783,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5305215672666375,"acs":70327,"articleLive":2,"columnArticles":593,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":132562,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5915774187692866,"acs":3259,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5509,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43104461661768634,"acs":8067,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18715,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49961802902979374,"acs":1308,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2618,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5643346379647749,"acs":4614,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8176,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4191076294277929,"acs":2461,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5872,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4624292670088169,"acs":3514,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7599,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.662242403073699,"acs":1896,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2863,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8393234672304439,"acs":3970,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4730,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5898656215005599,"acs":2107,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3572,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7005193081097966,"acs":17941,"articleLive":2,"columnArticles":143,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25611,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7633215821628306,"acs":82712,"articleLive":2,"columnArticles":992,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":108358,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4937705688763517,"acs":4201,"articleLive":2,"columnArticles":54,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8508,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.665537237066515,"acs":29267,"articleLive":2,"columnArticles":443,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43975,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7079171053645258,"acs":55134,"articleLive":2,"columnArticles":637,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77882,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4779826425577889,"acs":40260,"articleLive":2,"columnArticles":500,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":84229,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5066367545335577,"acs":5420,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10698,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5875682680736832,"acs":12695,"articleLive":2,"columnArticles":152,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21606,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.554423344140806,"acs":1197,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2159,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512896731866657,"acs":153502,"articleLive":2,"columnArticles":1121,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":180317,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49441407178512004,"acs":6240,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12621,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7130661967980071,"acs":23472,"articleLive":2,"columnArticles":334,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32917,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5897703549060542,"acs":1130,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1916,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.45904881776499146,"acs":5106,"articleLive":2,"columnArticles":81,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11123,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5641348881184999,"acs":1790,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3173,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3238452655889146,"acs":5609,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17320,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.593896006028636,"acs":23643,"articleLive":2,"columnArticles":348,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39810,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4363715716451509,"acs":18997,"articleLive":2,"columnArticles":236,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43534,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2853557209624373,"acs":3297,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11554,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6166415427059928,"acs":43361,"articleLive":2,"columnArticles":663,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70318,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4282073067119796,"acs":1512,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3531,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5960699434180926,"acs":69950,"articleLive":2,"columnArticles":673,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117352,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6874144691320059,"acs":44706,"articleLive":2,"columnArticles":494,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":65035,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5123339658444023,"acs":40770,"articleLive":2,"columnArticles":409,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":79577,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4745762711864407,"acs":4312,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9086,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3909509568280645,"acs":42616,"articleLive":2,"columnArticles":404,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":109006,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6082199881726789,"acs":18513,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30438,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6923153165058809,"acs":20955,"articleLive":2,"columnArticles":296,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30268,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44804674074922674,"acs":3911,"articleLive":2,"columnArticles":67,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8729,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.694980928740086,"acs":11479,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16517,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.464958476807778,"acs":9182,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19748,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3931066604564509,"acs":5064,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12882,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3409468438538206,"acs":7389,"articleLive":2,"columnArticles":106,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21672,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5330657366585511,"acs":8101,"articleLive":2,"columnArticles":89,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15197,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5312805474095796,"acs":23914,"articleLive":2,"columnArticles":283,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":45012,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7926346119214839,"acs":44015,"articleLive":2,"columnArticles":543,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":55530,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46555740432612314,"acs":1399,"articleLive":2,"columnArticles":35,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3005,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4087235016013421,"acs":5360,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13114,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7068292682926829,"acs":1449,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2050,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4195534583956727,"acs":7291,"articleLive":2,"columnArticles":88,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17378,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5763199115451949,"acs":31274,"articleLive":2,"columnArticles":334,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54265,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48195229127432515,"acs":12284,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25488,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7715562260647557,"acs":39891,"articleLive":2,"columnArticles":401,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51702,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29195177582274356,"acs":2688,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9207,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6563755141543672,"acs":13564,"articleLive":2,"columnArticles":153,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20665,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8458067133150796,"acs":16681,"articleLive":2,"columnArticles":222,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19722,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48111872891500707,"acs":4421,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9189,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4192262005769557,"acs":4941,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11786,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7333597813629551,"acs":16637,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22686,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7052118719828356,"acs":15777,"articleLive":2,"columnArticles":200,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22372,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6303721626915543,"acs":10942,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17358,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5507632093933463,"acs":7036,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12775,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6991732033071868,"acs":23086,"articleLive":2,"columnArticles":360,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":33019,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.433702997187106,"acs":26828,"articleLive":2,"columnArticles":318,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61858,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5117404297708837,"acs":3596,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7027,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5913716621727407,"acs":13598,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22994,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43341204250295157,"acs":3671,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8470,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42167388112354837,"acs":22113,"articleLive":2,"columnArticles":250,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52441,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.507701073371563,"acs":55246,"articleLive":2,"columnArticles":603,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108816,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6927325182030498,"acs":25212,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36395,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5018207040055488,"acs":2894,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5767,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4285092807424594,"acs":2955,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6896,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6158716297347451,"acs":16926,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27483,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3924530502741164,"acs":6729,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":17146,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3749219312995436,"acs":7804,"articleLive":2,"columnArticles":117,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20815,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3895906383338262,"acs":9222,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23671,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.492183942935195,"acs":3243,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6589,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3655981040289385,"acs":8793,"articleLive":2,"columnArticles":101,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":24051,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431490622945345,"acs":52044,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95819,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4057438998056575,"acs":7516,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18524,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7958679063564973,"acs":85941,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107984,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4312847308617401,"acs":5200,"articleLive":2,"columnArticles":78,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12057,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5281150536366851,"acs":13440,"articleLive":2,"columnArticles":133,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25449,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5748240605497278,"acs":4329,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7531,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4796281520321187,"acs":37870,"articleLive":2,"columnArticles":658,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78957,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3959051328588617,"acs":19414,"articleLive":2,"columnArticles":245,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49037,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5009684560044272,"acs":7242,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14456,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5748269766605747,"acs":19186,"articleLive":2,"columnArticles":270,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33377,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.36003184713375797,"acs":9044,"articleLive":2,"columnArticles":114,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25120,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.658117342130066,"acs":55861,"articleLive":2,"columnArticles":547,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84880,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4881804604212803,"acs":28437,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58251,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3802188893392785,"acs":2814,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7401,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5123899127170132,"acs":91168,"articleLive":2,"columnArticles":997,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":177927,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42128970548981226,"acs":37879,"articleLive":2,"columnArticles":557,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89912,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5114517163004837,"acs":8776,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17159,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6806356808533798,"acs":18759,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27561,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44895345973898054,"acs":9116,"articleLive":2,"columnArticles":98,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20305,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42703263384664486,"acs":16056,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37599,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44967919340054996,"acs":2453,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5455,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.48238422335475295,"acs":4354,"articleLive":2,"columnArticles":72,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":9026,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7156949254128929,"acs":85975,"articleLive":2,"columnArticles":745,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":120128,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38402857887098574,"acs":10320,"articleLive":2,"columnArticles":124,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26873,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35980006555227795,"acs":4391,"articleLive":2,"columnArticles":68,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12204,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4075672087620312,"acs":4912,"articleLive":2,"columnArticles":58,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":12052,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6272053769189644,"acs":16424,"articleLive":2,"columnArticles":219,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26186,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4664414068499462,"acs":3037,"articleLive":2,"columnArticles":48,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6511,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.556193758376412,"acs":2905,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5223,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3024612305076355,"acs":28105,"articleLive":2,"columnArticles":365,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92921,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5871610726520357,"acs":90670,"articleLive":2,"columnArticles":777,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":154421,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8084839164423939,"acs":31543,"articleLive":2,"columnArticles":441,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39015,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1929622083779869,"acs":16385,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84913,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6041362199639737,"acs":35551,"articleLive":2,"columnArticles":564,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58846,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45660941000746824,"acs":3057,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6695,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6589236762371952,"acs":9134,"articleLive":2,"columnArticles":132,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13862,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22478678356295104,"acs":7538,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33534,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702072476837259,"acs":83983,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125309,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6248433524474993,"acs":16454,"articleLive":2,"columnArticles":237,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26333,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5514082117407533,"acs":6500,"articleLive":2,"columnArticles":97,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11788,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42987083345213994,"acs":15076,"articleLive":2,"columnArticles":192,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":35071,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34318473151972656,"acs":9638,"articleLive":2,"columnArticles":130,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":28084,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520123306946219,"acs":60703,"articleLive":2,"columnArticles":725,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":93101,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5120205114544486,"acs":15377,"articleLive":2,"columnArticles":113,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":30032,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41615765125267856,"acs":20780,"articleLive":2,"columnArticles":230,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49933,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4796772962428971,"acs":45247,"articleLive":2,"columnArticles":356,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":94328,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7063745653705429,"acs":155413,"articleLive":2,"columnArticles":1677,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":220015,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7574473733697636,"acs":68474,"articleLive":2,"columnArticles":485,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90401,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2815107318005223,"acs":4420,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15701,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5544093434863141,"acs":21551,"articleLive":2,"columnArticles":182,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38872,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25258468521476,"acs":6010,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23794,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5377269471697684,"acs":47299,"articleLive":2,"columnArticles":580,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87961,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4829346949744692,"acs":1797,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3721,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6897941194988352,"acs":10956,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15883,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6620450021927605,"acs":19625,"articleLive":2,"columnArticles":255,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29643,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6931935626753285,"acs":4695,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6773,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.427216273042883,"acs":8737,"articleLive":2,"columnArticles":117,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20451,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2913514549533806,"acs":51684,"articleLive":2,"columnArticles":338,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":177394,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6404981873465092,"acs":54769,"articleLive":2,"columnArticles":458,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85510,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6764654948480388,"acs":15625,"articleLive":2,"columnArticles":149,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":23098,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7266622993776614,"acs":8874,"articleLive":2,"columnArticles":122,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12212,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3305622907285533,"acs":2863,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8661,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387188121842952,"acs":33382,"articleLive":2,"columnArticles":683,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52264,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7251461988304093,"acs":10788,"articleLive":2,"columnArticles":105,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14877,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7750307575136212,"acs":13229,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17069,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.54726819315348,"acs":7242,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13233,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867178224136747,"acs":59793,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101911,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7439296229631307,"acs":62409,"articleLive":2,"columnArticles":712,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83891,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33839235525576167,"acs":5418,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16011,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5366692131398014,"acs":4215,"articleLive":2,"columnArticles":47,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7854,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49371114645077346,"acs":3415,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6917,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5466556564822461,"acs":19198,"articleLive":2,"columnArticles":237,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":35119,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3294013565319965,"acs":3351,"articleLive":2,"columnArticles":78,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10173,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5311428055605705,"acs":2942,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5539,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4526293287729799,"acs":21174,"articleLive":2,"columnArticles":293,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":46780,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7005249532575867,"acs":58449,"articleLive":2,"columnArticles":606,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":83436,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27783362653933147,"acs":2211,"articleLive":2,"columnArticles":40,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7958,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31837477258944813,"acs":11550,"articleLive":2,"columnArticles":133,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":36278,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6986780326995438,"acs":20982,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":30031,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4596603272388165,"acs":16266,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35387,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31934943793350873,"acs":6676,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20905,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4265256458255335,"acs":4557,"articleLive":2,"columnArticles":69,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10684,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.559799937330919,"acs":234035,"articleLive":2,"columnArticles":1071,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":418069,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.3996665972077516,"acs":1918,"articleLive":2,"columnArticles":34,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4799,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888440796444782,"acs":49174,"articleLive":2,"columnArticles":620,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126462,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4695574695574696,"acs":9486,"articleLive":2,"columnArticles":116,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20202,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44225468577728777,"acs":6418,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14512,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5703526783134619,"acs":29611,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51917,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35820846096531167,"acs":21634,"articleLive":2,"columnArticles":230,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":60395,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6348523599162985,"acs":5461,"articleLive":2,"columnArticles":103,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8602,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4828828828828829,"acs":1876,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3885,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7385038465555053,"acs":21215,"articleLive":2,"columnArticles":315,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28727,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140257027095467,"acs":90230,"articleLive":2,"columnArticles":830,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126368,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33977516059957175,"acs":6347,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18680,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35919963722933906,"acs":6337,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17642,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38771853247260446,"acs":50631,"articleLive":2,"columnArticles":681,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130587,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5236172482096603,"acs":6873,"articleLive":2,"columnArticles":126,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13126,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3372977188535777,"acs":3460,"articleLive":2,"columnArticles":70,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10258,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4178069353327085,"acs":2229,"articleLive":2,"columnArticles":43,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5335,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6445641869979544,"acs":25838,"articleLive":2,"columnArticles":233,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":40086,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5448903466460866,"acs":33890,"articleLive":2,"columnArticles":343,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62196,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6655457998630052,"acs":21376,"articleLive":2,"columnArticles":273,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":32118,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6324304538799415,"acs":8639,"articleLive":2,"columnArticles":83,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13660,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7253760406938622,"acs":36506,"articleLive":2,"columnArticles":314,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":50327,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4730013886133704,"acs":23844,"articleLive":2,"columnArticles":272,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":50410,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47497493637695687,"acs":6159,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12967,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37899322362052273,"acs":1566,"articleLive":2,"columnArticles":26,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4132,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5872938894277401,"acs":12110,"articleLive":2,"columnArticles":128,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20620,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8188866582106227,"acs":97486,"articleLive":2,"columnArticles":806,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":119047,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45337909618370514,"acs":5548,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":12237,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41991486520323845,"acs":5031,"articleLive":2,"columnArticles":66,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11981,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39268816662361633,"acs":62331,"articleLive":2,"columnArticles":617,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158729,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7303875919206191,"acs":22745,"articleLive":2,"columnArticles":214,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31141,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4683701314810221,"acs":1888,"articleLive":2,"columnArticles":43,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4031,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6896763356805995,"acs":21351,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30958,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48609666648420824,"acs":35522,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":73076,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6245362467281211,"acs":27439,"articleLive":2,"columnArticles":301,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43935,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125917070998289,"acs":26135,"articleLive":2,"columnArticles":340,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42663,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39154590755484275,"acs":6836,"articleLive":2,"columnArticles":99,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17459,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37109134149563994,"acs":8426,"articleLive":2,"columnArticles":120,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22706,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.775066687588263,"acs":9879,"articleLive":2,"columnArticles":148,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12746,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6634308038356813,"acs":11208,"articleLive":2,"columnArticles":171,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16894,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.35200364298724957,"acs":3092,"articleLive":2,"columnArticles":60,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8784,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.552982072413389,"acs":14158,"articleLive":2,"columnArticles":170,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25603,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.30126603717661005,"acs":7115,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23617,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32947272173117953,"acs":3243,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9843,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4373313181474684,"acs":4051,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9263,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36088398349492445,"acs":14256,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39503,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5363221430704261,"acs":25146,"articleLive":2,"columnArticles":234,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46886,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7428301886792453,"acs":19685,"articleLive":2,"columnArticles":305,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26500,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5552486187845304,"acs":2010,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3620,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6770015410581933,"acs":36902,"articleLive":2,"columnArticles":306,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54508,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4435812905963378,"acs":13590,"articleLive":2,"columnArticles":138,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30637,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5041534810126582,"acs":2549,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5056,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4323208493069891,"acs":1466,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3391,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6840507782859252,"acs":33355,"articleLive":2,"columnArticles":395,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48761,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40425809822361547,"acs":3095,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7656,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4641486810551559,"acs":7742,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16680,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49883537307540465,"acs":25271,"articleLive":2,"columnArticles":332,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50660,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6508689446729914,"acs":15505,"articleLive":2,"columnArticles":198,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23822,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4139550486413955,"acs":11106,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26829,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44049221303595465,"acs":6873,"articleLive":2,"columnArticles":108,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15603,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41146496815286626,"acs":1292,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3140,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6414980596058928,"acs":68104,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":106164,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4661865340114588,"acs":37673,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80811,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44757545415534256,"acs":3129,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6991,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972291604222866,"acs":53799,"articleLive":2,"columnArticles":502,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":90081,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7093390385943343,"acs":177710,"articleLive":2,"columnArticles":1389,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":250529,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4732653839864828,"acs":43415,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91735,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7132562426680074,"acs":8512,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11934,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7339454220862025,"acs":14389,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19605,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5321561800547128,"acs":21398,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40210,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5454351989785061,"acs":2563,"articleLive":2,"columnArticles":30,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4699,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6340859942722438,"acs":32547,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51329,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41761467889908255,"acs":9104,"articleLive":2,"columnArticles":145,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21800,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6006929087424443,"acs":16298,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27132,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6792911026144466,"acs":26294,"articleLive":2,"columnArticles":254,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":38708,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.532785947899275,"acs":23295,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43723,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4992327636382877,"acs":9435,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18899,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4713416700858055,"acs":52844,"articleLive":2,"columnArticles":596,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":112114,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5030617897620937,"acs":33600,"articleLive":2,"columnArticles":506,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66791,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5201467368794745,"acs":8791,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16901,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45296060797005977,"acs":23722,"articleLive":2,"columnArticles":274,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52371,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5572462585034014,"acs":51197,"articleLive":2,"columnArticles":810,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91875,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.509655927717441,"acs":55843,"articleLive":2,"columnArticles":1413,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":109570,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5397761493675969,"acs":21509,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39848,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4937081963496202,"acs":4355,"articleLive":2,"columnArticles":89,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8821,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5101382552000772,"acs":37009,"articleLive":2,"columnArticles":401,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":72547,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6151142355008787,"acs":7700,"articleLive":2,"columnArticles":111,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12518,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906570795459684,"acs":30545,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44226,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.41064073226544623,"acs":3589,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8740,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.292551724137931,"acs":2121,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7250,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7354592294481044,"acs":57382,"articleLive":2,"columnArticles":605,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":78022,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5770773368565092,"acs":12230,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21193,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5968690560712439,"acs":68095,"articleLive":2,"columnArticles":718,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":114087,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5305912492687551,"acs":26303,"articleLive":2,"columnArticles":424,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":49573,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6273746496418561,"acs":44319,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70642,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.465257905935872,"acs":6341,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13629,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7229930624380575,"acs":17508,"articleLive":2,"columnArticles":226,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":24216,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5893171450123927,"acs":16406,"articleLive":2,"columnArticles":229,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":27839,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4527827910833618,"acs":18565,"articleLive":2,"columnArticles":247,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":41002,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6262198015308122,"acs":60707,"articleLive":2,"columnArticles":583,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96942,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33513864818024264,"acs":3094,"articleLive":2,"columnArticles":66,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9232,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39698454389332255,"acs":47157,"articleLive":2,"columnArticles":924,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118788,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5512266330305134,"acs":38894,"articleLive":2,"columnArticles":459,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":70559,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3547802118090817,"acs":4891,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13786,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5826019331185424,"acs":5244,"articleLive":2,"columnArticles":81,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9001,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5606299212598426,"acs":3560,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6350,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5163962275203562,"acs":44077,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85355,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5988886602181519,"acs":20370,"articleLive":2,"columnArticles":266,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":34013,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5377979568671963,"acs":9476,"articleLive":2,"columnArticles":140,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17620,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830651372056261,"acs":57957,"articleLive":2,"columnArticles":657,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":74013,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7045125780616025,"acs":19968,"articleLive":2,"columnArticles":269,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28343,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5641977258370183,"acs":7145,"articleLive":2,"columnArticles":157,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12664,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.556799681031332,"acs":33516,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":60194,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096144643879189,"acs":75630,"articleLive":2,"columnArticles":651,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106579,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6714716728126048,"acs":10015,"articleLive":2,"columnArticles":170,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14915,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4344562016632689,"acs":13426,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30903,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319158106457869,"acs":20378,"articleLive":2,"columnArticles":426,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27842,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6562730555663417,"acs":16901,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25753,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7104880654256344,"acs":40571,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57103,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5674828826737843,"acs":4890,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8617,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3976335045928694,"acs":2554,"articleLive":2,"columnArticles":44,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6423,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39079358319136853,"acs":11011,"articleLive":2,"columnArticles":168,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28176,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43269969278033793,"acs":4507,"articleLive":2,"columnArticles":99,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10416,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6339642667610118,"acs":35838,"articleLive":2,"columnArticles":389,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56530,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.3005775048125401,"acs":3279,"articleLive":2,"columnArticles":56,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10909,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4384608428287213,"acs":9697,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22116,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7936823778137048,"acs":25528,"articleLive":2,"columnArticles":323,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":32164,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5551627453370718,"acs":4554,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8203,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5210825652088645,"acs":2657,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5099,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4827873403664631,"acs":6956,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14408,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5303608365892898,"acs":11538,"articleLive":2,"columnArticles":153,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21755,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6905461997683329,"acs":7750,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11223,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.2088229976496113,"acs":5775,"articleLive":2,"columnArticles":73,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27655,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.640374531835206,"acs":8549,"articleLive":2,"columnArticles":106,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13350,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599175327722367,"acs":66098,"articleLive":2,"columnArticles":919,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":100161,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7248490264576055,"acs":107066,"articleLive":2,"columnArticles":991,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":147708,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4570708228283291,"acs":9971,"articleLive":2,"columnArticles":139,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21815,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6454877288779417,"acs":43502,"articleLive":2,"columnArticles":405,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":67394,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7585296640929189,"acs":11494,"articleLive":2,"columnArticles":54,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15153,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7535274113021876,"acs":31242,"articleLive":2,"columnArticles":372,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41461,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5812910614188416,"acs":48221,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82955,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45822454308093996,"acs":5967,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13022,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3764172335600907,"acs":7968,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21168,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.587191262256423,"acs":4731,"articleLive":2,"columnArticles":89,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":8057,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4104171690378587,"acs":3404,"articleLive":2,"columnArticles":66,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8294,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46638271980529356,"acs":3066,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6574,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3426020408163265,"acs":1343,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3920,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36334712058542795,"acs":2284,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6286,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5301698181380224,"acs":4402,"articleLive":2,"columnArticles":64,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8303,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6061065396275443,"acs":2799,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4618,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5436304246383574,"acs":3495,"articleLive":2,"columnArticles":49,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6429,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7064638783269962,"acs":1858,"articleLive":2,"columnArticles":40,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2630,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6508923742563548,"acs":4814,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7396,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5429393536963258,"acs":2453,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4518,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4746152079025959,"acs":2066,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4353,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4216928535225545,"acs":832,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1973,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8643206256109482,"acs":13263,"articleLive":2,"columnArticles":64,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15345,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8188453397562222,"acs":11219,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13701,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48085935122634044,"acs":7901,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16431,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866689194897355,"acs":34722,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59185,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5800173761946134,"acs":3338,"articleLive":2,"columnArticles":55,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5755,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.334023178807947,"acs":2421,"articleLive":2,"columnArticles":54,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7248,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6693999927753495,"acs":18531,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27683,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6945809248554913,"acs":9613,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13840,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4961124976003072,"acs":10337,"articleLive":2,"columnArticles":88,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20836,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7207249952552667,"acs":7595,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10538,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.622202374697909,"acs":11843,"articleLive":2,"columnArticles":187,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":19034,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.734587049243893,"acs":11367,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15474,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4912442396313364,"acs":4264,"articleLive":2,"columnArticles":94,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8680,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.570328660078143,"acs":14889,"articleLive":2,"columnArticles":151,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":26106,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7610432485968966,"acs":11526,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15145,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.52870480731029,"acs":10646,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":20136,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5374707868086211,"acs":10349,"articleLive":2,"columnArticles":95,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19255,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.772862611654615,"acs":3634,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4702,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6905367420693348,"acs":5159,"articleLive":2,"columnArticles":81,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7471,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5344424985405721,"acs":1831,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3426,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4510474561778538,"acs":1055,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2339,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5849481748535377,"acs":19470,"articleLive":2,"columnArticles":292,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33285,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5452404046002494,"acs":3935,"articleLive":2,"columnArticles":80,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7217,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3786852589641434,"acs":28515,"articleLive":2,"columnArticles":289,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":75300,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4899055380626042,"acs":2645,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5399,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3785414748900481,"acs":3701,"articleLive":2,"columnArticles":60,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9777,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6076971382434736,"acs":27096,"articleLive":2,"columnArticles":380,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44588,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3728156071105755,"acs":19798,"articleLive":2,"columnArticles":386,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":53104,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5482084690553746,"acs":1683,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3070,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5206108144192256,"acs":6239,"articleLive":2,"columnArticles":111,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11984,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4740106131321527,"acs":7414,"articleLive":2,"columnArticles":103,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15641,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5805608365019012,"acs":4886,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8416,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7009510869565218,"acs":5159,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7360,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6673124827013562,"acs":2411,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3613,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.369702434625789,"acs":5330,"articleLive":2,"columnArticles":69,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14417,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6365516995398938,"acs":35694,"articleLive":2,"columnArticles":1106,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":56074,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7607871217545814,"acs":28687,"articleLive":2,"columnArticles":673,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37707,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5591247170421473,"acs":5187,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9277,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5772721116077475,"acs":4262,"articleLive":2,"columnArticles":126,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7383,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4123301089751439,"acs":6735,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16334,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8394667199280971,"acs":67248,"articleLive":2,"columnArticles":686,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":80108,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5773127126871892,"acs":58868,"articleLive":2,"columnArticles":590,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101969,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6301742314948396,"acs":11357,"articleLive":2,"columnArticles":205,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":18022,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712845704807171,"acs":24179,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31349,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.645223842846303,"acs":7653,"articleLive":2,"columnArticles":87,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11861,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5410282336470406,"acs":6956,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12857,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6536517489668815,"acs":77980,"articleLive":2,"columnArticles":584,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":119299,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5616321464587697,"acs":43440,"articleLive":2,"columnArticles":480,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":77346,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5200764818355641,"acs":22848,"articleLive":2,"columnArticles":372,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43932,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5212978717053223,"acs":17464,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33501,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6429931972789116,"acs":2363,"articleLive":2,"columnArticles":38,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3675,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8669019933554817,"acs":8350,"articleLive":2,"columnArticles":146,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9632,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6105625717566016,"acs":2659,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4355,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5751565762004175,"acs":1102,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1916,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068568151570565,"acs":65327,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92419,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7028866867729427,"acs":8157,"articleLive":2,"columnArticles":106,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11605,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3184054996414353,"acs":12876,"articleLive":2,"columnArticles":134,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40439,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49146262886597936,"acs":3051,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6208,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6939120631341601,"acs":6155,"articleLive":2,"columnArticles":94,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8870,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4137034726554377,"acs":3979,"articleLive":2,"columnArticles":74,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9618,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5449755583526037,"acs":37236,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68326,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38004026108704936,"acs":6230,"articleLive":2,"columnArticles":112,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16393,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6294217326837535,"acs":5943,"articleLive":2,"columnArticles":104,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9442,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45541635961680177,"acs":3090,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6785,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.390365993763335,"acs":4757,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12186,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6487666448373718,"acs":2972,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4581,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7768271816181863,"acs":3178,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4091,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5362355521808825,"acs":6356,"articleLive":2,"columnArticles":73,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11853,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5694922112077686,"acs":2815,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4943,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6083421114453951,"acs":80275,"articleLive":2,"columnArticles":881,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":131957,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4329614817933067,"acs":6171,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14253,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47841908420095014,"acs":9466,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19786,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6521739130434783,"acs":6795,"articleLive":2,"columnArticles":96,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10419,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5101875316776483,"acs":10066,"articleLive":2,"columnArticles":66,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19730,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37093690248565964,"acs":6984,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18828,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6372430654070206,"acs":168900,"articleLive":2,"columnArticles":1139,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":265048,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4420503612500534,"acs":10340,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23391,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4691671964399237,"acs":6642,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14157,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.287357099370899,"acs":4248,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14783,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5620229007633588,"acs":4123,"articleLive":2,"columnArticles":83,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7336,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7146108329540283,"acs":7850,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10985,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4423076923076923,"acs":5359,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12116,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6045442941026296,"acs":4736,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7834,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4867469879518072,"acs":4242,"articleLive":2,"columnArticles":62,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8715,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3871057772816076,"acs":1387,"articleLive":2,"columnArticles":33,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3583,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3709083026230219,"acs":1711,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4613,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5691368651694185,"acs":14546,"articleLive":2,"columnArticles":226,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25558,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4782714605865731,"acs":9817,"articleLive":2,"columnArticles":127,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20526,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4309825195901145,"acs":5005,"articleLive":2,"columnArticles":86,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11613,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3206860706860707,"acs":3085,"articleLive":2,"columnArticles":47,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9620,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5505080693365212,"acs":5526,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":10038,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48815286624203824,"acs":3832,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7850,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6870393403353602,"acs":59657,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86832,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6336402774455872,"acs":10597,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16724,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46961521558669855,"acs":38469,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81916,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.267607532922828,"acs":5954,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22249,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6080465854949709,"acs":5743,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9445,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8372911169744943,"acs":7616,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9096,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4840028439388553,"acs":2723,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5626,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43454915756341417,"acs":2347,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5401,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5678177287290851,"acs":1595,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2809,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224347991623834,"acs":6775,"articleLive":2,"columnArticles":82,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21012,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166943708162991,"acs":13727,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22259,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47477247906807424,"acs":13042,"articleLive":2,"columnArticles":155,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27470,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26729492396658816,"acs":2496,"articleLive":2,"columnArticles":55,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9338,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7571893904141461,"acs":8136,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10745,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6194020436482907,"acs":4910,"articleLive":2,"columnArticles":63,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7927,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49175271556926375,"acs":7334,"articleLive":2,"columnArticles":115,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14914,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45080946450809467,"acs":4344,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9636,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26571108815426997,"acs":6173,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23232,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46209242841888304,"acs":18608,"articleLive":2,"columnArticles":184,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40269,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6368363493799394,"acs":30863,"articleLive":2,"columnArticles":185,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48463,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7766510017313876,"acs":3140,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4043,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37285180572851806,"acs":1497,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4015,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3988785769528229,"acs":2063,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5172,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.599444958371878,"acs":648,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1081,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5850906239107703,"acs":13429,"articleLive":2,"columnArticles":263,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22952,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6077746115382547,"acs":11304,"articleLive":2,"columnArticles":206,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18599,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3939695335811129,"acs":7526,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19103,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4415246212121212,"acs":1865,"articleLive":2,"columnArticles":33,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4224,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.694291754756871,"acs":3284,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4730,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6456707429484422,"acs":21014,"articleLive":2,"columnArticles":328,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32546,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6509718354339525,"acs":45348,"articleLive":2,"columnArticles":616,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69662,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26746356203341626,"acs":6019,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22504,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4989547038327526,"acs":4296,"articleLive":2,"columnArticles":50,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8610,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6017003874300474,"acs":5591,"articleLive":2,"columnArticles":73,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9292,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5060722960422918,"acs":3542,"articleLive":2,"columnArticles":64,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6999,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6371181030551756,"acs":13972,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21930,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6940894568690096,"acs":3476,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":5008,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3703084637593071,"acs":4874,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13162,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7465543644716692,"acs":3900,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5224,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4377581120943953,"acs":742,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1695,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6855910201588271,"acs":17957,"articleLive":2,"columnArticles":253,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26192,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24729999592452215,"acs":6068,"articleLive":2,"columnArticles":87,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24537,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.502923648863233,"acs":26921,"articleLive":2,"columnArticles":297,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53529,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6216354518473033,"acs":12148,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19542,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7264211471833697,"acs":5661,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7793,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46817319303087807,"acs":5428,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11594,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6129430435549286,"acs":6952,"articleLive":2,"columnArticles":91,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11342,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7305871615454822,"acs":60036,"articleLive":2,"columnArticles":834,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82175,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4968165476996822,"acs":47677,"articleLive":2,"columnArticles":614,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95965,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5282168998224263,"acs":12196,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":23089,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44906549924229666,"acs":2667,"articleLive":2,"columnArticles":55,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5939,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6559519604380077,"acs":7428,"articleLive":2,"columnArticles":62,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11324,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5098574461631786,"acs":5043,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9891,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.775595160660856,"acs":5962,"articleLive":2,"columnArticles":126,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7687,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6350844277673546,"acs":3385,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5330,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4118757868233319,"acs":1963,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4766,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5384057971014493,"acs":1486,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2760,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6940669644271279,"acs":21911,"articleLive":2,"columnArticles":357,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31569,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4227346278317152,"acs":8360,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19776,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6303487766788132,"acs":12109,"articleLive":2,"columnArticles":173,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19210,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5276395427034297,"acs":3923,"articleLive":2,"columnArticles":75,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7435,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8438383282925488,"acs":76726,"articleLive":2,"columnArticles":1111,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90925,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6718269778030734,"acs":5902,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8785,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4746118338229123,"acs":3393,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7149,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3270588235294118,"acs":4726,"articleLive":2,"columnArticles":70,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14450,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5377358490566038,"acs":3363,"articleLive":2,"columnArticles":80,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6254,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5965351492088925,"acs":11914,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19972,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6623359580052494,"acs":10094,"articleLive":2,"columnArticles":158,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15240,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5403000697836706,"acs":3097,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5732,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4195146958304853,"acs":2455,"articleLive":2,"columnArticles":45,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5852,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4953477369500079,"acs":3141,"articleLive":2,"columnArticles":63,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6341,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5650735294117647,"acs":3074,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5440,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46960751704639947,"acs":33885,"articleLive":2,"columnArticles":422,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72156,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4829110898661568,"acs":8082,"articleLive":2,"columnArticles":117,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16736,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34424608943420365,"acs":5920,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17197,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46234550158091403,"acs":6434,"articleLive":2,"columnArticles":111,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13916,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5630331753554503,"acs":1188,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2110,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7108240223463688,"acs":10179,"articleLive":2,"columnArticles":133,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14320,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6600923206042804,"acs":3146,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4766,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4911232598771346,"acs":34856,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70972,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49575944487278334,"acs":2572,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5188,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5934484038604306,"acs":6395,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10776,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4720965309200603,"acs":1252,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2652,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.540809968847352,"acs":2604,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4815,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6220828105395232,"acs":2479,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3985,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5104032142344669,"acs":3557,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6969,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4808538373798273,"acs":2951,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6137,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.617303085810906,"acs":8762,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14194,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5596703226629256,"acs":35107,"articleLive":2,"columnArticles":482,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62728,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5754110257501064,"acs":22994,"articleLive":2,"columnArticles":322,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39961,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5618185558527052,"acs":2731,"articleLive":2,"columnArticles":39,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4861,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7718493019697839,"acs":8072,"articleLive":2,"columnArticles":96,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10458,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7485943443029601,"acs":18107,"articleLive":2,"columnArticles":317,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24188,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3943135054246165,"acs":5270,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13365,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.59911822998827,"acs":14812,"articleLive":2,"columnArticles":231,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24723,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6824569356300997,"acs":3011,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4412,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6678230702515178,"acs":1540,"articleLive":2,"columnArticles":37,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2306,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5636531365313653,"acs":1833,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3252,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5558558558558558,"acs":1234,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2220,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4799903567984571,"acs":1991,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4148,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6050371514040336,"acs":12540,"articleLive":2,"columnArticles":254,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20726,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7286004806803476,"acs":7882,"articleLive":2,"columnArticles":100,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10818,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5253364213552689,"acs":13156,"articleLive":2,"columnArticles":202,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":25043,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4197481243301179,"acs":3133,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7464,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5683745788311839,"acs":4892,"articleLive":2,"columnArticles":86,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8607,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9219787516600265,"acs":2777,"articleLive":2,"columnArticles":68,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":3012,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8242057488653555,"acs":29964,"articleLive":2,"columnArticles":457,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36355,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.607310637750177,"acs":9437,"articleLive":2,"columnArticles":147,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15539,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5855712004645086,"acs":8068,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13778,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49148410583111224,"acs":30242,"articleLive":2,"columnArticles":321,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61532,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8013059701492538,"acs":6013,"articleLive":2,"columnArticles":85,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7504,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5072075782537068,"acs":2463,"articleLive":2,"columnArticles":41,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4856,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5194471231115397,"acs":1616,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3111,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.543762922122674,"acs":1578,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2902,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6031843233312921,"acs":985,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1633,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5428495972534002,"acs":8222,"articleLive":2,"columnArticles":170,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15146,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5019499885294793,"acs":6564,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13077,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7253144535663177,"acs":19260,"articleLive":2,"columnArticles":237,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26554,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.598202614379085,"acs":3661,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6120,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.621064904780412,"acs":1598,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2573,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5056758775205377,"acs":6771,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13390,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318541967831067,"acs":45460,"articleLive":2,"columnArticles":621,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54649,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8106987889385403,"acs":12518,"articleLive":2,"columnArticles":230,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15441,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41739130434782606,"acs":7008,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16790,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6616865029121296,"acs":2613,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3949,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8105243924721359,"acs":4436,"articleLive":2,"columnArticles":61,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5473,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6461724741019776,"acs":4803,"articleLive":2,"columnArticles":94,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7433,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6032987455474679,"acs":15582,"articleLive":2,"columnArticles":218,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25828,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5629477993858751,"acs":13750,"articleLive":2,"columnArticles":171,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24425,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6263674085250849,"acs":6642,"articleLive":2,"columnArticles":99,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10604,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.808559939007071,"acs":54087,"articleLive":2,"columnArticles":703,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66893,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5186898729529265,"acs":7063,"articleLive":2,"columnArticles":157,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13617,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4705108359133127,"acs":6079,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12920,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.36053946590725916,"acs":13420,"articleLive":2,"columnArticles":128,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37222,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.655894952505122,"acs":7043,"articleLive":2,"columnArticles":73,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10738,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.807752197572206,"acs":48243,"articleLive":2,"columnArticles":639,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59725,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4547316673494469,"acs":7770,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17087,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4589481115425344,"acs":6501,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14165,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5966750170803917,"acs":2620,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4391,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.786741214057508,"acs":30535,"articleLive":2,"columnArticles":434,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38812,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4661888798982777,"acs":24198,"articleLive":2,"columnArticles":365,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51906,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3617827298050139,"acs":3247,"articleLive":2,"columnArticles":79,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8975,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8195482546201232,"acs":19956,"articleLive":2,"columnArticles":295,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24350,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8220440512395171,"acs":8920,"articleLive":2,"columnArticles":84,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10851,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7237198591167705,"acs":21370,"articleLive":2,"columnArticles":384,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29528,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7475810053093832,"acs":15066,"articleLive":2,"columnArticles":227,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20153,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5753151088557865,"acs":17573,"articleLive":2,"columnArticles":273,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30545,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3306408185245019,"acs":1842,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5571,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7512612107623319,"acs":5361,"articleLive":2,"columnArticles":61,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7136,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.756005801831203,"acs":16679,"articleLive":2,"columnArticles":289,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22062,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7130067243035543,"acs":37112,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52050,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3781524029637686,"acs":5563,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14711,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6665631212723658,"acs":10729,"articleLive":2,"columnArticles":154,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":16096,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.832076813655761,"acs":35097,"articleLive":2,"columnArticles":547,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42180,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7401354626235009,"acs":11911,"articleLive":2,"columnArticles":194,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":16093,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8098498649412652,"acs":12892,"articleLive":2,"columnArticles":264,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15919,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4401386263390044,"acs":2794,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6348,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6149049703219618,"acs":10256,"articleLive":2,"columnArticles":194,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16679,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6549870801033592,"acs":6337,"articleLive":2,"columnArticles":114,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9675,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6167607537568578,"acs":31028,"articleLive":2,"columnArticles":514,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50308,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5891546294103718,"acs":2488,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4223,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6136332275424313,"acs":4447,"articleLive":2,"columnArticles":78,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7247,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5932072131872995,"acs":5362,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":9039,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.754999692326626,"acs":24539,"articleLive":2,"columnArticles":479,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32502,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5894611491515332,"acs":5940,"articleLive":2,"columnArticles":116,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10077,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7279094446409622,"acs":10289,"articleLive":2,"columnArticles":183,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14135,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.473068107400131,"acs":5779,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12216,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6888916531906953,"acs":5538,"articleLive":2,"columnArticles":54,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":8039,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46293283755519404,"acs":5976,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12909,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7716985277960887,"acs":7024,"articleLive":2,"columnArticles":158,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9102,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37875363254762673,"acs":1173,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3097,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.535730357303573,"acs":11905,"articleLive":2,"columnArticles":203,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22222,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6874458249060965,"acs":9517,"articleLive":2,"columnArticles":136,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13844,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5441842536378529,"acs":5647,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10377,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49061800654157345,"acs":5700,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11618,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5864412398475054,"acs":3538,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6033,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42169523362291617,"acs":1796,"articleLive":2,"columnArticles":49,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4259,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7055304536417857,"acs":39037,"articleLive":2,"columnArticles":626,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55330,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6401688357368976,"acs":9100,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14215,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3989708895135547,"acs":8374,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20989,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5730659025787965,"acs":4400,"articleLive":2,"columnArticles":96,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7678,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.48016818500350383,"acs":3426,"articleLive":2,"columnArticles":49,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7135,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8205378020265004,"acs":42110,"articleLive":2,"columnArticles":642,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51320,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5450605481198215,"acs":12828,"articleLive":2,"columnArticles":214,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23535,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5933398628795299,"acs":6058,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10210,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3665766501287446,"acs":5837,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15923,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4350560193321617,"acs":15843,"articleLive":2,"columnArticles":268,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36416,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7408,"acs":7871,"articleLive":2,"columnArticles":117,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10625,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3067226890756303,"acs":3285,"articleLive":2,"columnArticles":52,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10710,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5058540497193263,"acs":3154,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6235,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8485395965070762,"acs":8454,"articleLive":2,"columnArticles":86,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9963,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.754720319490433,"acs":29859,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39563,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4449833887043189,"acs":6697,"articleLive":2,"columnArticles":73,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15050,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28543708397809053,"acs":11621,"articleLive":2,"columnArticles":156,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40713,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2813165537270087,"acs":2906,"articleLive":2,"columnArticles":72,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10330,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6612161471640265,"acs":3882,"articleLive":2,"columnArticles":59,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5871,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7316533125189162,"acs":45931,"articleLive":2,"columnArticles":509,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62777,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5312459567861302,"acs":4106,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7729,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4961692495211562,"acs":5699,"articleLive":2,"columnArticles":112,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11486,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5501355013550135,"acs":2842,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5166,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5056701333803396,"acs":8606,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":17019,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4016004267804748,"acs":7528,"articleLive":2,"columnArticles":202,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18745,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5247592847317745,"acs":5341,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10178,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3645017207292963,"acs":4978,"articleLive":2,"columnArticles":99,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13657,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6737009755126419,"acs":3384,"articleLive":2,"columnArticles":65,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":5023,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250070070650546,"acs":85361,"articleLive":2,"columnArticles":1090,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103467,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5384034438486519,"acs":7129,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13241,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41801461532145495,"acs":15273,"articleLive":2,"columnArticles":223,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36537,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5256577990987062,"acs":3616,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6879,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6061878453038674,"acs":2743,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4525,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900979378906442,"acs":48162,"articleLive":2,"columnArticles":580,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60957,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.580195106000327,"acs":21292,"articleLive":2,"columnArticles":270,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36698,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5134173739390914,"acs":8227,"articleLive":2,"columnArticles":164,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16024,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4053501264868938,"acs":7531,"articleLive":2,"columnArticles":168,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18579,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7397278142527935,"acs":17013,"articleLive":2,"columnArticles":227,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22999,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5749471737982039,"acs":8707,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15144,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5035673801426952,"acs":7552,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14997,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3244849139594104,"acs":4205,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12959,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8616755793226382,"acs":7251,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8415,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8375060182956187,"acs":10437,"articleLive":2,"columnArticles":164,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12462,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7283365234035148,"acs":16743,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22988,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7318017077216045,"acs":11913,"articleLive":2,"columnArticles":158,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16279,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6936373666789261,"acs":11316,"articleLive":2,"columnArticles":176,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16314,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32328072153325815,"acs":4588,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14192,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5448332422088573,"acs":1993,"articleLive":2,"columnArticles":46,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3658,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7011823719097098,"acs":13699,"articleLive":2,"columnArticles":204,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19537,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31275353715246856,"acs":6322,"articleLive":2,"columnArticles":131,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20214,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6955141768937791,"acs":9861,"articleLive":2,"columnArticles":172,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14178,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5429817808570695,"acs":4232,"articleLive":2,"columnArticles":54,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7794,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.83126178133836,"acs":28223,"articleLive":2,"columnArticles":483,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33952,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3545070579081916,"acs":6379,"articleLive":2,"columnArticles":116,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17994,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39976112272320097,"acs":6694,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16745,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4051605679678355,"acs":7961,"articleLive":2,"columnArticles":145,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19649,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8558915537017727,"acs":4104,"articleLive":2,"columnArticles":62,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4795,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6653655897356624,"acs":17217,"articleLive":2,"columnArticles":277,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25876,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7481151832460733,"acs":14289,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19100,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4130880151288315,"acs":10485,"articleLive":2,"columnArticles":145,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":25382,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3740430185927816,"acs":1026,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2743,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7617810117810118,"acs":4397,"articleLive":2,"columnArticles":68,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5772,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6714133900106269,"acs":9477,"articleLive":2,"columnArticles":153,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14115,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6058016877637131,"acs":5743,"articleLive":2,"columnArticles":98,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9480,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41732951532506096,"acs":3935,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9429,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.753326589370477,"acs":9681,"articleLive":2,"columnArticles":178,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12851,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912101008148935,"acs":21460,"articleLive":2,"columnArticles":363,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":31047,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49295007152101356,"acs":7237,"articleLive":2,"columnArticles":155,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14681,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5085186513629842,"acs":5671,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11152,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5689173457508732,"acs":4887,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8590,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6672708734564404,"acs":5890,"articleLive":2,"columnArticles":67,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8827,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6147241505297771,"acs":13460,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21896,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8069931459223204,"acs":8124,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10067,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47521029824114197,"acs":7457,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15692,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5506611044332885,"acs":7788,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14143,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5518904320987654,"acs":2861,"articleLive":2,"columnArticles":68,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5184,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6938401214267644,"acs":10971,"articleLive":2,"columnArticles":227,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15812,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6040175666883539,"acs":7427,"articleLive":2,"columnArticles":149,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12296,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6841235409565127,"acs":6623,"articleLive":2,"columnArticles":181,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9681,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4092223185891876,"acs":2831,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6918,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5193047100288369,"acs":12966,"articleLive":2,"columnArticles":184,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24968,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327045801095612,"acs":25948,"articleLive":2,"columnArticles":416,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35414,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41898673992286967,"acs":7931,"articleLive":2,"columnArticles":154,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18929,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5993159052040068,"acs":2453,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4093,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7484563758389262,"acs":2788,"articleLive":2,"columnArticles":35,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3725,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5406576599541167,"acs":10605,"articleLive":2,"columnArticles":196,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19615,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541980394942464,"acs":35109,"articleLive":2,"columnArticles":511,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63351,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39870473947600826,"acs":6772,"articleLive":2,"columnArticles":147,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16985,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.44003815753611336,"acs":3229,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7338,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7091254752851711,"acs":1492,"articleLive":2,"columnArticles":49,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2104,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6570271833429728,"acs":1136,"articleLive":2,"columnArticles":47,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1729,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5948275862068966,"acs":897,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1508,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5061466723187792,"acs":1194,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2359,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5843621399176955,"acs":710,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1215,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462523264946047,"acs":78660,"articleLive":2,"columnArticles":1033,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92951,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39402881444193716,"acs":4540,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11522,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6412432375092818,"acs":6045,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9427,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46626659392616837,"acs":2564,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5499,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6189133016627079,"acs":4169,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6736,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8216611919286719,"acs":43774,"articleLive":2,"columnArticles":648,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":53275,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5860975066785397,"acs":10531,"articleLive":2,"columnArticles":177,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17968,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48331459115271713,"acs":33094,"articleLive":2,"columnArticles":466,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68473,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5628760529482552,"acs":3742,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6648,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6984663374057707,"acs":2687,"articleLive":2,"columnArticles":37,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3847,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6481188971855255,"acs":18054,"articleLive":2,"columnArticles":379,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27856,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7915934955641207,"acs":34709,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43847,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4105339629495096,"acs":5651,"articleLive":2,"columnArticles":141,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13765,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5269568690095847,"acs":2639,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5008,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8573875802997859,"acs":4004,"articleLive":2,"columnArticles":53,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4670,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5728924288526938,"acs":12803,"articleLive":2,"columnArticles":218,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22348,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6176439954171441,"acs":5930,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9601,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7115148893215084,"acs":9868,"articleLive":2,"columnArticles":160,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13869,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276478417950181,"acs":16504,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26295,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8026849205821759,"acs":24156,"articleLive":2,"columnArticles":343,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30094,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5234621553106731,"acs":10118,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19329,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4989549368781874,"acs":5968,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11961,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36503340757238306,"acs":1639,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4490,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3956682099976458,"acs":5042,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12743,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6330443919096401,"acs":12050,"articleLive":2,"columnArticles":206,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":19035,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5235312211627192,"acs":13616,"articleLive":2,"columnArticles":213,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":26008,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.631666271628348,"acs":7995,"articleLive":2,"columnArticles":140,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12657,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4423318667504714,"acs":5630,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12728,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.597084851639771,"acs":2294,"articleLive":2,"columnArticles":48,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3842,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7448722910216719,"acs":15398,"articleLive":2,"columnArticles":312,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20672,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5019033922679976,"acs":5933,"articleLive":2,"columnArticles":86,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11821,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4276284450493365,"acs":6284,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14695,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5919262834576569,"acs":2698,"articleLive":2,"columnArticles":65,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4558,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7674024743806872,"acs":26734,"articleLive":2,"columnArticles":374,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34837,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3099279462256395,"acs":6409,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20679,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48345671551593894,"acs":6400,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13238,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6186755952380952,"acs":1663,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2688,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.6997193638914874,"acs":2992,"articleLive":2,"columnArticles":51,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4276,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7957796852646638,"acs":2225,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2796,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8428033275780882,"acs":53695,"articleLive":2,"columnArticles":731,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63710,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5445145203872104,"acs":7425,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13636,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6178353543722226,"acs":8203,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13277,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6743065503320745,"acs":15534,"articleLive":2,"columnArticles":166,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23037,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7175908923980904,"acs":1954,"articleLive":2,"columnArticles":63,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2723,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7215660125738236,"acs":15150,"articleLive":2,"columnArticles":233,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20996,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8652245120786134,"acs":12679,"articleLive":2,"columnArticles":118,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14654,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.291400058702671,"acs":4964,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":17035,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5805121527777778,"acs":2675,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4608,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5666475972540046,"acs":1981,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3496,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692127131448306,"acs":128866,"articleLive":2,"columnArticles":1292,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":148256,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5145439854560145,"acs":10189,"articleLive":2,"columnArticles":147,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19802,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5865932289414817,"acs":31205,"articleLive":2,"columnArticles":405,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53197,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30042765502494656,"acs":3372,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11224,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8090909090909091,"acs":801,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":990,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6598615916955017,"acs":3814,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5780,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8582634405358113,"acs":71120,"articleLive":2,"columnArticles":685,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82865,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31134384655511416,"acs":7759,"articleLive":2,"columnArticles":107,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24921,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2371290813189658,"acs":7328,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30903,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.691019968910678,"acs":11558,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16726,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8545067423704755,"acs":1204,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1409,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6714141753443064,"acs":19988,"articleLive":2,"columnArticles":298,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29770,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6601471727343144,"acs":6818,"articleLive":2,"columnArticles":80,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10328,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.567491114818307,"acs":7824,"articleLive":2,"columnArticles":148,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13787,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3716017032427121,"acs":2269,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6106,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5420852565843063,"acs":3993,"articleLive":2,"columnArticles":38,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7366,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5368625546381739,"acs":11054,"articleLive":2,"columnArticles":168,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20590,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39118316532726344,"acs":8421,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21527,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33424657534246577,"acs":5246,"articleLive":2,"columnArticles":67,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15695,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37443298969072164,"acs":2724,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7275,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.302868068833652,"acs":792,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2615,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5904816186947849,"acs":4144,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":7018,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7164790748589552,"acs":25526,"articleLive":2,"columnArticles":305,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35627,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5130933875403564,"acs":8582,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16726,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5951868674794805,"acs":7469,"articleLive":2,"columnArticles":135,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12549,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3610959502237747,"acs":3308,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9161,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8394886363636364,"acs":591,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":704,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5900373899408998,"acs":9784,"articleLive":2,"columnArticles":131,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16582,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5526720318292794,"acs":6112,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11059,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5483431208053692,"acs":5229,"articleLive":2,"columnArticles":78,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9536,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5773533732625156,"acs":5109,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8849,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6778296570600547,"acs":4210,"articleLive":2,"columnArticles":61,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6211,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.848829836292368,"acs":58902,"articleLive":2,"columnArticles":750,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69392,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.38008554319931565,"acs":11108,"articleLive":2,"columnArticles":151,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29225,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3252287050213458,"acs":7999,"articleLive":2,"columnArticles":140,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24595,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34291938997821353,"acs":3148,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9180,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7334180970544607,"acs":3461,"articleLive":2,"columnArticles":36,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4719,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6743139052137812,"acs":25013,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":37094,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2978734858681023,"acs":5533,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18575,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33306857294148795,"acs":2516,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7554,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3970082273747195,"acs":2654,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6685,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7128060263653484,"acs":757,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1062,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5775269310107725,"acs":10079,"articleLive":2,"columnArticles":173,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17452,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4296657967842411,"acs":5104,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11879,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.661439338682227,"acs":5441,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8226,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6171738709052141,"acs":3184,"articleLive":2,"columnArticles":51,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5159,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5018030513176144,"acs":3618,"articleLive":2,"columnArticles":38,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7210,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7852231430887082,"acs":30034,"articleLive":2,"columnArticles":361,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38249,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.690965250965251,"acs":8948,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12950,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5676975051975052,"acs":8738,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15392,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32964680699250803,"acs":1848,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5606,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6150352032704974,"acs":2708,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4403,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6144329896907217,"acs":298,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":485,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7884342857142858,"acs":17247,"articleLive":2,"columnArticles":161,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21875,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4533483822422874,"acs":13255,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29238,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4403168825607537,"acs":4113,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9341,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3670740710360102,"acs":4475,"articleLive":2,"columnArticles":89,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12191,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.602803738317757,"acs":129,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":214,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5389418230301454,"acs":16573,"articleLive":2,"columnArticles":248,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30751,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31753585397653195,"acs":4871,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15340,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4612903225806452,"acs":6006,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":13020,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.385771235817234,"acs":2516,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6522,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5518902891030393,"acs":2978,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5396,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5468771448181194,"acs":19920,"articleLive":2,"columnArticles":322,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36425,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5541866469937292,"acs":7512,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13555,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41460099152406843,"acs":5185,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12506,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5370321560358461,"acs":4075,"articleLive":2,"columnArticles":71,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7588,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7134387351778656,"acs":361,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":506,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6640729809498256,"acs":2475,"articleLive":2,"columnArticles":48,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3727,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.658674145529633,"acs":21372,"articleLive":2,"columnArticles":290,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32447,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8166557662960541,"acs":11238,"articleLive":2,"columnArticles":154,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13761,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5104427736006684,"acs":9165,"articleLive":2,"columnArticles":124,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17955,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2957161369006784,"acs":7759,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26238,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.706266318537859,"acs":541,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":766,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43828932261768083,"acs":3054,"articleLive":2,"columnArticles":58,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6968,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.578588421887391,"acs":10944,"articleLive":2,"columnArticles":168,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18915,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7683550410033767,"acs":7964,"articleLive":2,"columnArticles":110,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10365,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6221760221760222,"acs":4489,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7215,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3673872375805446,"acs":3535,"articleLive":2,"columnArticles":64,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9622,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5725291367617041,"acs":8695,"articleLive":2,"columnArticles":92,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15187,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7793383478666045,"acs":11708,"articleLive":2,"columnArticles":169,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15023,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3094701649829203,"acs":4258,"articleLive":2,"columnArticles":87,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13759,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3791266292455523,"acs":3985,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10511,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5456039441248973,"acs":664,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1217,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7240316901408451,"acs":3290,"articleLive":2,"columnArticles":41,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4544,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4459694134782365,"acs":7961,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17851,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3999211739024982,"acs":13191,"articleLive":2,"columnArticles":209,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":32984,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4556828193832599,"acs":2586,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5675,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47405714285714284,"acs":2074,"articleLive":2,"columnArticles":46,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4375,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.893883951907998,"acs":1710,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1913,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.758103638368247,"acs":3438,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4535,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049220948301206,"acs":19166,"articleLive":2,"columnArticles":322,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23811,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2951338520374522,"acs":4476,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15166,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3268681094324214,"acs":4803,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14694,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5966727247308822,"acs":4268,"articleLive":2,"columnArticles":68,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7153,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47644075854418677,"acs":18039,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37862,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3256211967545639,"acs":5137,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15776,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5826893353941267,"acs":10933,"articleLive":2,"columnArticles":204,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18763,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6189909384119183,"acs":16121,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26044,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.636568848758465,"acs":282,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":443,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8048,"acs":3521,"articleLive":2,"columnArticles":48,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4375,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6707120308663627,"acs":9561,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14255,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6850168596979915,"acs":18690,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27284,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6631648229248411,"acs":26197,"articleLive":2,"columnArticles":329,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39503,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299891735835438,"acs":2383,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5542,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6270096463022508,"acs":390,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":622,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.824793388429752,"acs":3493,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4235,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8389241289978475,"acs":44041,"articleLive":2,"columnArticles":700,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52497,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29401955582505873,"acs":3879,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13193,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26850763807285544,"acs":3656,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13616,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5764282038085435,"acs":1120,"articleLive":2,"columnArticles":33,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1943,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4454941028283522,"acs":7781,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17466,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5321930600609457,"acs":5414,"articleLive":2,"columnArticles":90,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10173,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3137797040801076,"acs":4199,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13382,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4649791103465225,"acs":1892,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4069,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7469586374695864,"acs":2456,"articleLive":2,"columnArticles":43,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3288,"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.6722222222222223,"acs":11132,"articleLive":2,"columnArticles":150,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16560,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41940379403794037,"acs":3869,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9225,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6787263090266624,"acs":16903,"articleLive":2,"columnArticles":207,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24904,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4910434393193014,"acs":2193,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4466,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7824639289678136,"acs":705,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":901,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8444546165999735,"acs":57189,"articleLive":2,"columnArticles":458,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67723,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41530354594357227,"acs":3783,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9109,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7365717954205008,"acs":3442,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4673,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34049207673060883,"acs":1633,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4796,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5450943396226415,"acs":2889,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5300,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6398502066115702,"acs":9910,"articleLive":2,"columnArticles":162,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15488,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5119056030523564,"acs":7245,"articleLive":2,"columnArticles":126,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14153,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2708142726440988,"acs":2368,"articleLive":2,"columnArticles":39,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8744,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6098693759071118,"acs":2101,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3445,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7308319738988581,"acs":448,"articleLive":2,"columnArticles":21,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":613,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.721465076660988,"acs":1694,"articleLive":2,"columnArticles":36,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2348,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8219244118781335,"acs":17050,"articleLive":2,"columnArticles":289,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20744,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4969064548896482,"acs":5381,"articleLive":2,"columnArticles":65,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10829,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2755771966298282,"acs":5037,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18278,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6216121084125308,"acs":1766,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2841,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5933456561922366,"acs":321,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":541,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.674652872311462,"acs":7434,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":11019,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37188106977439117,"acs":2489,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6693,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44238835430545276,"acs":1793,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4053,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15222580260174245,"acs":2551,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16758,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7824116047144152,"acs":3452,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4412,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6259269282814615,"acs":11564,"articleLive":2,"columnArticles":201,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18475,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5438467207074429,"acs":2952,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5428,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3866888845324446,"acs":3945,"articleLive":2,"columnArticles":85,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10202,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.38213399503722084,"acs":2464,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6448,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8394308943089431,"acs":413,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":492,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5248204807992507,"acs":8405,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":16015,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7681279009798866,"acs":7447,"articleLive":2,"columnArticles":116,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9695,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49367406463077784,"acs":25558,"articleLive":2,"columnArticles":301,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51771,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31934227607096494,"acs":1476,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4622,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6572387344199425,"acs":2742,"articleLive":2,"columnArticles":26,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4172,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5261904761904762,"acs":442,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":840,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5454965357967667,"acs":1181,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2165,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.705664739884393,"acs":9156,"articleLive":2,"columnArticles":179,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12975,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8069069069069069,"acs":5374,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6660,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7120603015075377,"acs":2834,"articleLive":2,"columnArticles":48,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3980,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4020715630885122,"acs":1281,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3186,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6589547614129312,"acs":12760,"articleLive":2,"columnArticles":218,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19364,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7713232490148723,"acs":12136,"articleLive":2,"columnArticles":280,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15734,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45117309156343,"acs":6519,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14449,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45108587368001596,"acs":2264,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5019,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5470980019029495,"acs":1150,"articleLive":2,"columnArticles":26,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2102,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4083796062594649,"acs":809,"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":1981,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5363758635446598,"acs":35094,"articleLive":2,"columnArticles":358,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65428,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5155767611563289,"acs":7348,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14252,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2778263982814862,"acs":3492,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12569,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4738112927191679,"acs":2551,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5384,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7946859903381642,"acs":1316,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1656,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6832740213523132,"acs":768,"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":1124,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6567136325464216,"acs":7038,"articleLive":2,"columnArticles":179,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10717,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.505645490409468,"acs":3717,"articleLive":2,"columnArticles":87,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7351,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2736694459596353,"acs":3512,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12833,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3845863953269267,"acs":2041,"articleLive":2,"columnArticles":33,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5307,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7819080573405833,"acs":7909,"articleLive":2,"columnArticles":94,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10115,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46474358974358976,"acs":5510,"articleLive":2,"columnArticles":77,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11856,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.30000334750443547,"acs":8962,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29873,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41306347746090155,"acs":1347,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3261,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7386569872958257,"acs":407,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":551,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7258826800111203,"acs":2611,"articleLive":2,"columnArticles":54,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3597,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8123659059879071,"acs":20825,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25635,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5722448979591837,"acs":7711,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13475,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5455916356690459,"acs":5427,"articleLive":2,"columnArticles":107,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9947,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6625493441996689,"acs":5203,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7853,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6974789915966386,"acs":249,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":357,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6032178892827925,"acs":2212,"articleLive":2,"columnArticles":33,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3667,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4441304906241973,"acs":6916,"articleLive":2,"columnArticles":130,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15572,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7580363382250175,"acs":13017,"articleLive":2,"columnArticles":237,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":17172,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5264116575591985,"acs":4335,"articleLive":2,"columnArticles":77,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8235,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46830265848670755,"acs":2061,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4401,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8508997429305912,"acs":38727,"articleLive":2,"columnArticles":444,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45513,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35560324717738173,"acs":7622,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21434,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3645923365024489,"acs":2531,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6942,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43529217563552325,"acs":2637,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6058,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7663636363636364,"acs":843,"articleLive":2,"columnArticles":22,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1100,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3888042650418888,"acs":2042,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5252,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8300743336016287,"acs":17532,"articleLive":2,"columnArticles":284,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21121,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4975046342506773,"acs":6978,"articleLive":2,"columnArticles":113,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14026,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4650367584202428,"acs":5440,"articleLive":2,"columnArticles":72,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11698,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3842435959400677,"acs":2385,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6207,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5236593059936908,"acs":332,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":634,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8960509554140127,"acs":3517,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3925,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8284565449084391,"acs":17101,"articleLive":2,"columnArticles":357,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20642,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5998074454428755,"acs":3738,"articleLive":2,"columnArticles":86,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6232,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4719758779709117,"acs":2661,"articleLive":2,"columnArticles":49,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5638,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4030037546933667,"acs":966,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2397,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.804930030561364,"acs":20017,"articleLive":2,"columnArticles":268,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24868,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8670696637126591,"acs":14774,"articleLive":2,"columnArticles":196,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17039,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5179584120982986,"acs":4384,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8464,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4883720930232558,"acs":2457,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5031,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.657243816254417,"acs":186,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":283,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8,"acs":2296,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2870,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6350329348621615,"acs":7809,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12297,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.46297791149922946,"acs":6309,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13627,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.397570542831836,"acs":6284,"articleLive":2,"columnArticles":115,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15806,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5260115606936416,"acs":2184,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4152,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5231277533039648,"acs":475,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":908,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7971781305114638,"acs":1808,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2268,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.709994776249347,"acs":8155,"articleLive":2,"columnArticles":182,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11486,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6095858538855281,"acs":3930,"articleLive":2,"columnArticles":80,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6447,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4787781350482315,"acs":2978,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6220,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38406658739595717,"acs":1292,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3364,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.781437891774338,"acs":12217,"articleLive":2,"columnArticles":187,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15634,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3472046318074905,"acs":5757,"articleLive":2,"columnArticles":121,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16581,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5858148348673524,"acs":4328,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7388,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5030133295519001,"acs":14189,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28208,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7011070110701108,"acs":950,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1355,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7024038461538461,"acs":1461,"articleLive":2,"columnArticles":37,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2080,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6950228391766032,"acs":11716,"articleLive":2,"columnArticles":187,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16857,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35913327453457605,"acs":30132,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83902,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26266770606819023,"acs":6402,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24373,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4958703838486124,"acs":15670,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31601,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6323907455012854,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":389,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.731462086300796,"acs":1746,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2387,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6725329476052716,"acs":8369,"articleLive":2,"columnArticles":194,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12444,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4336664707035077,"acs":2213,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5103,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48948800395745734,"acs":1979,"articleLive":2,"columnArticles":49,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4043,"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.8690678361481758,"acs":46569,"articleLive":2,"columnArticles":490,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53585,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6452716653884727,"acs":10938,"articleLive":2,"columnArticles":168,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16951,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5160277236300628,"acs":4765,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9234,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5061658706035606,"acs":23314,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":46060,"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.7878765774308848,"acs":10801,"articleLive":2,"columnArticles":148,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13709,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4807725619262082,"acs":5551,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11546,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5757878939469735,"acs":3453,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5997,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35822336659156745,"acs":1113,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3107,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6214062055223456,"acs":2183,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3513,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5389121338912134,"acs":644,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1195,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46777442094662636,"acs":1858,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3972,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7910555738243998,"acs":12028,"articleLive":2,"columnArticles":208,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15205,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4594594594594595,"acs":2142,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4662,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7233003436781312,"acs":27991,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38699,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48938178386031145,"acs":1037,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2119,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491971054986108,"acs":28617,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63707,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3165133743987849,"acs":3751,"articleLive":2,"columnArticles":105,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11851,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6538655770819943,"acs":28485,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43564,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4709980839574987,"acs":2704,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5741,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.703125,"acs":585,"articleLive":2,"columnArticles":20,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":832,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8427824688379574,"acs":2096,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2487,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7088786994581076,"acs":8503,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11995,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6966232797987015,"acs":22425,"articleLive":2,"columnArticles":329,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32191,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3628574721770424,"acs":28333,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78083,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48492605233219566,"acs":3410,"articleLive":2,"columnArticles":72,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7032,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5919842312746386,"acs":901,"articleLive":2,"columnArticles":38,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1522,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7042105263157895,"acs":1338,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1900,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7478559176672385,"acs":11336,"articleLive":2,"columnArticles":228,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":15158,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5313616230890127,"acs":3719,"articleLive":2,"columnArticles":86,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6999,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45622568093385213,"acs":3283,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7196,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4704249412769592,"acs":2203,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4683,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6796691150253156,"acs":9531,"articleLive":2,"columnArticles":112,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14023,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6303011357715953,"acs":6049,"articleLive":2,"columnArticles":129,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9597,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4219607060935474,"acs":4231,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10027,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4113042324532307,"acs":3100,"articleLive":2,"columnArticles":52,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7537,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7966804979253111,"acs":384,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":482,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9201430274135876,"acs":3088,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3356,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6390407335566919,"acs":7248,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11342,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.43088753010932,"acs":4651,"articleLive":2,"columnArticles":97,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10794,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5404021001408631,"acs":4220,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7809,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4315339038841343,"acs":2622,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6076,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6951102588686481,"acs":725,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":1043,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6101273232840626,"acs":4169,"articleLive":2,"columnArticles":83,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6833,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47481286668015377,"acs":2347,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4943,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5513187641296157,"acs":3658,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6635,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3765300691857371,"acs":1415,"articleLive":2,"columnArticles":27,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3758,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7915129151291513,"acs":858,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1084,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7632655755015839,"acs":11565,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":15152,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8563731267890217,"acs":10172,"articleLive":2,"columnArticles":173,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11878,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3706618962432916,"acs":4144,"articleLive":2,"columnArticles":104,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11180,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36576971214017523,"acs":2338,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6392,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5176991150442478,"acs":351,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":678,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8426244910742249,"acs":16143,"articleLive":2,"columnArticles":200,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19158,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5506503022531599,"acs":6012,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10918,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47432357813362785,"acs":4295,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9055,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4630059293632379,"acs":1796,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3879,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.782608695652174,"acs":5472,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6992,"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.6481157391202893,"acs":5555,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8571,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6654234841193455,"acs":5531,"articleLive":2,"columnArticles":113,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8312,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.519853775368713,"acs":4124,"articleLive":2,"columnArticles":61,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7933,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29179772562303413,"acs":1206,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4133,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7990837696335078,"acs":1221,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1528,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4215802727229534,"acs":8873,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":21047,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35045020463847204,"acs":6422,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18325,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34206055760967324,"acs":3423,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10007,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541086389613272,"acs":11789,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18023,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7155963302752294,"acs":234,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":327,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7102425876010782,"acs":1581,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2226,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6436040261897782,"acs":13172,"articleLive":2,"columnArticles":144,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20466,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8080767692922831,"acs":10105,"articleLive":2,"columnArticles":139,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12505,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5138241689965828,"acs":6616,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12876,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41515825129670797,"acs":3922,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9447,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5819397993311036,"acs":174,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":299,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7841845140032949,"acs":1904,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2428,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48884042166484915,"acs":6724,"articleLive":2,"columnArticles":122,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13755,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5740554156171285,"acs":4558,"articleLive":2,"columnArticles":72,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7940,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5220030349013657,"acs":3096,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5931,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5189402233413619,"acs":2370,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4567,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6824670824670824,"acs":9848,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14430,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.379590718070528,"acs":4155,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10946,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26262751928340383,"acs":4222,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16076,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.409404990403071,"acs":2133,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5210,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5705596107055961,"acs":469,"articleLive":2,"columnArticles":29,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":822,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48728922365830696,"acs":11386,"articleLive":2,"columnArticles":150,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23366,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6625829504849413,"acs":5192,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7836,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5856443719412724,"acs":5744,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9808,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2679373425347793,"acs":2446,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9129,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6283880171184023,"acs":1762,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2804,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6220735785953178,"acs":186,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":299,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6646341463414634,"acs":872,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1312,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7938879125170865,"acs":8131,"articleLive":2,"columnArticles":192,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10242,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5119984824053875,"acs":5398,"articleLive":2,"columnArticles":74,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10543,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3459615384615385,"acs":3598,"articleLive":2,"columnArticles":80,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10400,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30188016165875947,"acs":1718,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5691,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7520097616996841,"acs":10477,"articleLive":2,"columnArticles":158,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13932,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6994890849976777,"acs":6024,"articleLive":2,"columnArticles":98,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8612,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37326248117687943,"acs":25779,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":69064,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3686884725309622,"acs":2322,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6298,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5047169811320755,"acs":107,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":212,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9010791366906474,"acs":2505,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2780,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8088122759676185,"acs":20082,"articleLive":2,"columnArticles":201,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24829,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7165846743933961,"acs":8594,"articleLive":2,"columnArticles":105,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11993,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6550505050505051,"acs":7782,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11880,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28556011223829053,"acs":2646,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9266,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43125,"acs":276,"articleLive":2,"columnArticles":23,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":640,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7932510288065844,"acs":9638,"articleLive":2,"columnArticles":140,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":12150,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8666370304512114,"acs":7798,"articleLive":2,"columnArticles":102,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8998,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6823388613438195,"acs":3991,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5849,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4859075535512965,"acs":862,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1774,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.739448051948052,"acs":911,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1232,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8241282613996587,"acs":13519,"articleLive":2,"columnArticles":216,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16404,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6842583312453019,"acs":43694,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63856,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3547479618785165,"acs":6179,"articleLive":2,"columnArticles":132,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17418,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5101811543322567,"acs":3633,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7121,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7085427135678392,"acs":423,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":597,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.795134313228586,"acs":7844,"articleLive":2,"columnArticles":89,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9865,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42911424220471045,"acs":29024,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67637,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5728563913729616,"acs":6534,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11406,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38935960591133006,"acs":1976,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5075,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5160762942779291,"acs":947,"articleLive":2,"columnArticles":30,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1835,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6557377049180327,"acs":120,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":183,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5105716523101018,"acs":652,"articleLive":2,"columnArticles":23,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1277,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8004589787722318,"acs":6976,"articleLive":2,"columnArticles":115,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8715,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5336195722618277,"acs":6587,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12344,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335767429043814,"acs":27591,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43548,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36012861736334406,"acs":2352,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6531,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6832808674361665,"acs":7814,"articleLive":2,"columnArticles":100,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11436,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32814966384098215,"acs":5613,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17105,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6107708014293006,"acs":2393,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3918,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40068081698037644,"acs":2001,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4994,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6968641114982579,"acs":200,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":287,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6448317307692307,"acs":1073,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1664,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7871049473263102,"acs":11805,"articleLive":2,"columnArticles":123,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14998,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6797107064445306,"acs":10526,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15486,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35632092691056266,"acs":4490,"articleLive":2,"columnArticles":84,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12601,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4522332506203474,"acs":2187,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4836,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6358595194085028,"acs":344,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":541,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7663037501374684,"acs":6968,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":9093,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7720965595894317,"acs":4062,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5261,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6188895037815901,"acs":3355,"articleLive":2,"columnArticles":69,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5421,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3132679828800221,"acs":2269,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7243,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9036781285231116,"acs":12825,"articleLive":2,"columnArticles":145,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14192,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3882249560632689,"acs":4418,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11380,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5127760100279626,"acs":5318,"articleLive":2,"columnArticles":63,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10371,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5973712446351931,"acs":2227,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3728,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7396280400572246,"acs":517,"articleLive":2,"columnArticles":15,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":699,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5501519756838906,"acs":181,"articleLive":2,"columnArticles":13,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":329,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.787182959862103,"acs":12787,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16244,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45502805091391685,"acs":7543,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16577,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2765937859608746,"acs":6009,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21725,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6224179829890644,"acs":2049,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3292,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.813874147081122,"acs":2147,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2638,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8929577464788733,"acs":317,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":355,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7389830508474576,"acs":436,"articleLive":2,"columnArticles":19,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":590,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.728346921895309,"acs":6164,"articleLive":2,"columnArticles":97,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8463,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8203718801777872,"acs":31193,"articleLive":2,"columnArticles":401,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":38023,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42971246006389774,"acs":2152,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5008,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.411262050832603,"acs":1877,"articleLive":2,"columnArticles":39,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4564,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.769917864476386,"acs":7499,"articleLive":2,"columnArticles":101,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9740,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35392865469806484,"acs":6072,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17156,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.278612978771625,"acs":3688,"articleLive":2,"columnArticles":111,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13237,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3760775862068966,"acs":1745,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4640,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6899685424676687,"acs":1974,"articleLive":2,"columnArticles":38,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2861,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5234215885947047,"acs":257,"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":491,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.571775641702757,"acs":5413,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9467,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6463902073444916,"acs":5175,"articleLive":2,"columnArticles":66,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8006,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3180054769511639,"acs":2787,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8764,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27089704383282365,"acs":2126,"articleLive":2,"columnArticles":42,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7848,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7096541786743515,"acs":985,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1388,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4664586583463339,"acs":299,"articleLive":2,"columnArticles":11,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":641,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3394433129667346,"acs":500,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1473,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5910761844030159,"acs":31515,"articleLive":2,"columnArticles":415,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53318,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45774224056401,"acs":37268,"articleLive":2,"columnArticles":515,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81417,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5329081632653061,"acs":2089,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3920,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5068249258160238,"acs":854,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1685,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5312630785971374,"acs":6347,"articleLive":2,"columnArticles":80,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11947,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.31016448116425377,"acs":4092,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13193,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6302337312930889,"acs":3748,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5947,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4419719274221157,"acs":1291,"articleLive":2,"columnArticles":36,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2921,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6506904955320877,"acs":801,"articleLive":2,"columnArticles":30,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1231,"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.6429108530370122,"acs":7695,"articleLive":2,"columnArticles":103,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11969,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2844029499450808,"acs":3625,"articleLive":2,"columnArticles":73,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12746,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5751027598355842,"acs":4897,"articleLive":2,"columnArticles":99,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8515,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42494499915383316,"acs":2511,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5909,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5787037037037037,"acs":500,"articleLive":2,"columnArticles":18,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":864,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6640625,"acs":170,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":256,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32500684369011773,"acs":4749,"articleLive":2,"columnArticles":73,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14612,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6753128967894069,"acs":3723,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5513,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5687977762334955,"acs":3274,"articleLive":2,"columnArticles":70,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5756,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2683996750609261,"acs":1652,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6155,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8367100090716661,"acs":8301,"articleLive":2,"columnArticles":89,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9921,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4419739696312364,"acs":3260,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7376,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3918160667852744,"acs":2863,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7307,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5523854069223574,"acs":1181,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2138,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2709677419354839,"acs":294,"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":1085,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5017667844522968,"acs":142,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子数组和·","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":283,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3907407407407407,"acs":422,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1080,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9128264847779072,"acs":10974,"articleLive":2,"columnArticles":97,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":12022,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3445723172628305,"acs":5539,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16075,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.361545037693324,"acs":4652,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12867,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23792116973935157,"acs":1497,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6292,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38235294117647056,"acs":65,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":170,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6911785462244178,"acs":4897,"articleLive":2,"columnArticles":61,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":7085,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34473014975981914,"acs":3660,"articleLive":2,"columnArticles":63,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10617,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.41545123062898814,"acs":1823,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4388,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.399166955918084,"acs":2300,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5762,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9122706009355883,"acs":12676,"articleLive":2,"columnArticles":110,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13895,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4810115656827205,"acs":5573,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11586,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5610687022900763,"acs":2058,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3668,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32894736842105265,"acs":1100,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3344,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5451263537906137,"acs":453,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":831,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7320099255583127,"acs":295,"articleLive":2,"columnArticles":11,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":403,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7394419715557485,"acs":6811,"articleLive":2,"columnArticles":95,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9211,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45014358647096364,"acs":5643,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12536,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24325980392156862,"acs":3176,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13056,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34595577097849134,"acs":1142,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3301,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6219512195121951,"acs":459,"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":738,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7971014492753623,"acs":385,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":483,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7734177215189874,"acs":4888,"articleLive":2,"columnArticles":85,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6320,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39379282547359934,"acs":2931,"articleLive":2,"columnArticles":69,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7443,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4087403598971722,"acs":1908,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4668,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5773998270394927,"acs":2003,"articleLive":2,"columnArticles":55,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3469,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6637861736334405,"acs":6606,"articleLive":2,"columnArticles":78,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9952,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30422695035460995,"acs":5362,"articleLive":2,"columnArticles":82,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17625,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5429567082160568,"acs":4051,"articleLive":2,"columnArticles":91,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7461,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5153764581124072,"acs":972,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1886,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5206611570247934,"acs":252,"articleLive":2,"columnArticles":13,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":484,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5533596837944664,"acs":140,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":253,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6687631027253669,"acs":319,"articleLive":2,"columnArticles":13,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":477,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5459140035767047,"acs":7021,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12861,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3263406819742162,"acs":4278,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13109,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48095731216200666,"acs":4180,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8691,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49686013320647004,"acs":2611,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5255,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.459214501510574,"acs":152,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":331,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6055118110236221,"acs":4614,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7620,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42459514170040485,"acs":2517,"articleLive":2,"columnArticles":44,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5928,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41413013124825465,"acs":1483,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3581,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27893569844789357,"acs":629,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2255,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5348907997869264,"acs":7029,"articleLive":2,"columnArticles":65,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13141,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4322268326417704,"acs":5625,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13014,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6151084104405469,"acs":4454,"articleLive":2,"columnArticles":55,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7241,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.385750884469928,"acs":3162,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8197,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7384615384615385,"acs":384,"articleLive":2,"columnArticles":15,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":520,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7288135593220338,"acs":43,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":59,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7785968479918658,"acs":6126,"articleLive":2,"columnArticles":58,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7868,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3580946546178588,"acs":4676,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13058,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27912087912087913,"acs":2921,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10465,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47865459249676584,"acs":2220,"articleLive":2,"columnArticles":50,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4638,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5442522889114955,"acs":535,"articleLive":2,"columnArticles":20,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":983,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4552058111380145,"acs":188,"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":413,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5691056910569106,"acs":70,"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":123,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7383935151068534,"acs":4008,"articleLive":2,"columnArticles":56,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5428,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38187998431167475,"acs":2921,"articleLive":2,"columnArticles":46,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7649,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2894508670520231,"acs":2003,"articleLive":2,"columnArticles":38,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6920,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24817760106030484,"acs":749,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3018,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.53125,"acs":289,"articleLive":2,"columnArticles":12,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":544,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8088996934784907,"acs":7653,"articleLive":2,"columnArticles":89,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9461,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5828208688752232,"acs":5876,"articleLive":2,"columnArticles":94,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10082,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29869616752271827,"acs":4536,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15186,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4588170259812051,"acs":830,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1809,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6582278481012658,"acs":52,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":79,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5813166019320785,"acs":5837,"articleLive":2,"columnArticles":66,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":10041,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41230658510255486,"acs":5729,"articleLive":2,"columnArticles":81,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13895,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2765713411836672,"acs":3617,"articleLive":2,"columnArticles":75,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13078,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4618134546636334,"acs":1421,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3077,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6721311475409836,"acs":205,"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":305,"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.6023054755043228,"acs":209,"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":347,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6588199327422807,"acs":4310,"articleLive":2,"columnArticles":58,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6542,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5948327658722211,"acs":2970,"articleLive":2,"columnArticles":57,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4993,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38515376458112405,"acs":1816,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4715,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3639904134212103,"acs":1215,"articleLive":2,"columnArticles":36,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3338,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5529665165459173,"acs":5648,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10214,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24839784670597284,"acs":4845,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19505,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3401645957721478,"acs":2108,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6197,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4205920205920206,"acs":1634,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3885,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6483516483516484,"acs":59,"articleLive":2,"columnArticles":6,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":91,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7747134263988197,"acs":6826,"articleLive":2,"columnArticles":88,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8811,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3590448806100763,"acs":5744,"articleLive":2,"columnArticles":125,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15998,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5729956444587837,"acs":3552,"articleLive":2,"columnArticles":87,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6199,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3920066266307724,"acs":1893,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4829,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.40239043824701193,"acs":101,"articleLive":2,"columnArticles":5,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":251,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6818181818181818,"acs":30,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":44,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8771575879847567,"acs":3913,"articleLive":2,"columnArticles":53,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4461,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.30007517989474813,"acs":2794,"articleLive":2,"columnArticles":51,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":9311,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.41865509761388287,"acs":2123,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":5071,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41677057356608477,"acs":1337,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3208,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6363636363636364,"acs":70,"articleLive":2,"columnArticles":4,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":110,"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.9039891818796484,"acs":6685,"articleLive":2,"columnArticles":58,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":7395,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3572228443449048,"acs":4147,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11609,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3296296296296296,"acs":2759,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8370,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.520817843866171,"acs":1401,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2690,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.7924528301886793,"acs":42,"articleLive":2,"columnArticles":3,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":53,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5524376703341072,"acs":5473,"articleLive":2,"columnArticles":71,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9907,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3482626242740427,"acs":3538,"articleLive":2,"columnArticles":94,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":10159,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.40951571792693287,"acs":1928,"articleLive":2,"columnArticles":49,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4708,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34625579854208083,"acs":1045,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3018,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7904191616766467,"acs":132,"articleLive":2,"columnArticles":7,"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":167,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.78125,"acs":50,"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":64,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6573928651559345,"acs":2930,"articleLive":2,"columnArticles":36,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4457,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7534818941504178,"acs":2705,"articleLive":2,"columnArticles":37,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3590,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.47790901137357833,"acs":2185,"articleLive":2,"columnArticles":55,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4572,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.25909592061742004,"acs":1175,"articleLive":2,"columnArticles":39,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4535,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8954545454545455,"acs":197,"articleLive":2,"columnArticles":9,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":220,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5516795865633075,"acs":4270,"articleLive":2,"columnArticles":44,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7740,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.42377147860348036,"acs":3872,"articleLive":2,"columnArticles":55,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9137,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.22351121423047177,"acs":2023,"articleLive":2,"columnArticles":67,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9051,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3423180592991914,"acs":1143,"articleLive":2,"columnArticles":39,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3339,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.6285714285714286,"acs":22,"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":35,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6605231866825209,"acs":5555,"articleLive":2,"columnArticles":90,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":8410,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3864824864331524,"acs":3917,"articleLive":2,"columnArticles":77,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":10135,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.3048094277524153,"acs":2871,"articleLive":2,"columnArticles":61,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":9419,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.30978466188137516,"acs":1640,"articleLive":2,"columnArticles":41,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":5294,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.4666666666666667,"acs":21,"articleLive":2,"columnArticles":4,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"lock","submitted":45,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8321536905965622,"acs":2469,"articleLive":2,"columnArticles":30,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":2967,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.4802177098597446,"acs":2294,"articleLive":2,"columnArticles":48,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":4777,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.3381157340985175,"acs":1414,"articleLive":2,"columnArticles":35,"formTitle":"[2039]网络空闲的时刻","frequency":0.0,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":4182,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.2905982905982906,"acs":714,"articleLive":2,"columnArticles":17,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":2457,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.5277777777777778,"acs":57,"articleLive":2,"columnArticles":4,"formTitle":"[2041]Accepted Candidates From the Interviews","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"lock","submitted":108,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.7088527694492662,"acs":4492,"articleLive":2,"columnArticles":65,"formTitle":"[2042]检查句子中的数字是否递增","frequency":0.0,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":6337,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5993449781659389,"acs":3843,"articleLive":2,"columnArticles":39,"formTitle":"[2043]简易银行系统","frequency":0.0,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":6412,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7529182879377432,"acs":3483,"articleLive":2,"columnArticles":73,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.0,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":4626,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.32260114382546073,"acs":1523,"articleLive":2,"columnArticles":44,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.0,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":4721,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.8452677718226764,"acs":81379,"articleLive":2,"columnArticles":628,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96276,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6907683024939663,"acs":13738,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19888,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21997577746522895,"acs":11261,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":51192,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3778775155639207,"acs":2610,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6907,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19951807228915663,"acs":2070,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10375,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8399686400489521,"acs":43927,"articleLive":2,"columnArticles":660,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52296,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7691931061496279,"acs":39275,"articleLive":2,"columnArticles":475,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":51060,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28893036936478306,"acs":5108,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17679,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2757497285105672,"acs":6602,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23942,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5889967637540453,"acs":1820,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3090,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6899920255183413,"acs":6922,"articleLive":2,"columnArticles":68,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10032,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4116106782475412,"acs":6445,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15658,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6120773259197,"acs":9467,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15467,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21122188731741248,"acs":2733,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12939,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5764863059452238,"acs":863,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1497,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.31120121642169285,"acs":614,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1973,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7991998924225105,"acs":23773,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29746,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2868761431931017,"acs":17566,"articleLive":2,"columnArticles":231,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":61232,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162271273528024,"acs":19692,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38146,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.31229293809938974,"acs":1791,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5735,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3351195383347073,"acs":813,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2426,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33371704418863724,"acs":8987,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26930,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3390178227977946,"acs":2644,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7799,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28224068944290553,"acs":917,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3249,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33304843304843307,"acs":1169,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3510,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3355342136854742,"acs":559,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1666,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3285302593659942,"acs":1254,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3817,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28299568612461096,"acs":10365,"articleLive":2,"columnArticles":175,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36626,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18709206927985414,"acs":5131,"articleLive":2,"columnArticles":127,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27425,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34982354033805957,"acs":5650,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16151,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2528870048238562,"acs":1730,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6841,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40594059405940597,"acs":1066,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2626,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21826904807144215,"acs":4595,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":21052,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4845823973861548,"acs":2373,"articleLive":2,"columnArticles":61,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4897,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3988517392772712,"acs":1181,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2961,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26474486414844267,"acs":799,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3018,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19527950310559006,"acs":786,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4025,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.564344746162928,"acs":478,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":847,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5043339111881584,"acs":3782,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7499,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23219256590797446,"acs":2836,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12214,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.41723356009070295,"acs":1288,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3087,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.20031176929072486,"acs":1028,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5132,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.39979757085020245,"acs":395,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":988,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8463243442925749,"acs":2291,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2707,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18681917211328977,"acs":1029,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5508,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.36982758620689654,"acs":858,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2320,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.35516143701682584,"acs":781,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2199,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.1527231892195396,"acs":272,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1781,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22624798711755234,"acs":281,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1242,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5445012787723785,"acs":4258,"articleLive":2,"columnArticles":100,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7820,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6951754385964912,"acs":3487,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":5016,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4130694013832578,"acs":1732,"articleLive":2,"columnArticles":55,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4193,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6784659437919883,"acs":406587,"articleLive":2,"columnArticles":2812,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":599274,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40334652129521587,"acs":265473,"articleLive":2,"columnArticles":2115,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":658176,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7607284487135756,"acs":292157,"articleLive":2,"columnArticles":1966,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":384049,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7512808887978901,"acs":308222,"articleLive":2,"columnArticles":2119,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":410262,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6981708985693383,"acs":191347,"articleLive":2,"columnArticles":1455,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":274069,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7151301021424682,"acs":269200,"articleLive":2,"columnArticles":1707,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":376435,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600670140570348,"acs":266931,"articleLive":2,"columnArticles":1867,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":741337,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4440664309055911,"acs":198400,"articleLive":2,"columnArticles":1326,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":446780,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49297814536991535,"acs":265836,"articleLive":2,"columnArticles":1648,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":539245,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45226250199336504,"acs":172999,"articleLive":2,"columnArticles":1154,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":382519,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5267569878445442,"acs":179277,"articleLive":2,"columnArticles":1724,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":340341,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.569250412831112,"acs":159607,"articleLive":2,"columnArticles":1325,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":280381,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3119665576424029,"acs":84031,"articleLive":2,"columnArticles":494,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":269359,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7472643316357589,"acs":201316,"articleLive":2,"columnArticles":1261,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":269404,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3400384490414816,"acs":125583,"articleLive":2,"columnArticles":764,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":369320,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773465103179886,"acs":151808,"articleLive":2,"columnArticles":1135,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":195290,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5968465869216013,"acs":191352,"articleLive":2,"columnArticles":1475,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":320605,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37666260221717585,"acs":67342,"articleLive":2,"columnArticles":450,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":178786,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24234425979189975,"acs":77769,"articleLive":2,"columnArticles":865,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":320903,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.643228765916763,"acs":196453,"articleLive":2,"columnArticles":1650,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":305417,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7982079048085469,"acs":264036,"articleLive":2,"columnArticles":2465,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":330786,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7426473526473526,"acs":297356,"articleLive":2,"columnArticles":1859,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":400400,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7283165244375485,"acs":187760,"articleLive":2,"columnArticles":1201,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":257800,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46551691557643976,"acs":147810,"articleLive":2,"columnArticles":1194,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":317518,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.791850058685446,"acs":194301,"articleLive":2,"columnArticles":1425,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":245376,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5799719663901395,"acs":152267,"articleLive":2,"columnArticles":1100,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":262542,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.440048144721596,"acs":146973,"articleLive":2,"columnArticles":1491,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":333993,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5675324015644964,"acs":145248,"articleLive":2,"columnArticles":963,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":255929,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6161857504988943,"acs":114247,"articleLive":2,"columnArticles":958,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":185410,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6441449334169465,"acs":139697,"articleLive":2,"columnArticles":969,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":216872,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6865678262669677,"acs":139295,"articleLive":2,"columnArticles":1105,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":202886,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.58861000786615,"acs":121970,"articleLive":2,"columnArticles":1151,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":207217,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5515498895514199,"acs":114606,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":207789,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5770844347425687,"acs":135354,"articleLive":2,"columnArticles":877,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":234548,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7199534558447588,"acs":122508,"articleLive":2,"columnArticles":843,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":170161,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6545573657017132,"acs":105910,"articleLive":2,"columnArticles":911,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":161804,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5613623946861431,"acs":78090,"articleLive":2,"columnArticles":564,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":139108,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5793090672662354,"acs":159489,"articleLive":2,"columnArticles":1121,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":275309,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6912204524703257,"acs":170334,"articleLive":2,"columnArticles":1030,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":246425,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.570274257664689,"acs":250477,"articleLive":2,"columnArticles":1825,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":439222,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5816964447504802,"acs":64203,"articleLive":2,"columnArticles":468,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":110372,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054045601481765,"acs":224550,"articleLive":2,"columnArticles":1533,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":370909,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48629661157914306,"acs":49700,"articleLive":2,"columnArticles":514,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":102201,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41552822136258405,"acs":56179,"articleLive":2,"columnArticles":469,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":135199,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5613178085948013,"acs":110542,"articleLive":2,"columnArticles":821,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":196933,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5354461169668981,"acs":121512,"articleLive":2,"columnArticles":1452,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":226936,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6888193901485535,"acs":120697,"articleLive":2,"columnArticles":1006,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":175223,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4646554964173567,"acs":153301,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":329924,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514212908044462,"acs":88962,"articleLive":2,"columnArticles":521,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":136566,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6149692118955296,"acs":155899,"articleLive":2,"columnArticles":1067,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":253507,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48320824769297754,"acs":103207,"articleLive":2,"columnArticles":854,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":213587,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6501822618102714,"acs":176938,"articleLive":2,"columnArticles":1056,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":272136,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5377791774194447,"acs":192967,"articleLive":2,"columnArticles":1608,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":358822,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44727106346820056,"acs":171070,"articleLive":2,"columnArticles":1487,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":382475,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7570706582081369,"acs":164329,"articleLive":2,"columnArticles":1153,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":217059,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7900492289233159,"acs":179101,"articleLive":2,"columnArticles":1277,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":226696,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5883502487393102,"acs":138490,"articleLive":2,"columnArticles":943,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":235387,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6973401421224983,"acs":116483,"articleLive":2,"columnArticles":1041,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":167039,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.800589029328752,"acs":91336,"articleLive":2,"columnArticles":705,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":114086,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6662301482200838,"acs":135835,"articleLive":2,"columnArticles":852,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":203886,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7074421809075045,"acs":140677,"articleLive":2,"columnArticles":1864,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":198853,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44196940887445524,"acs":131329,"articleLive":2,"columnArticles":985,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":297145,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8577362920638049,"acs":208960,"articleLive":2,"columnArticles":1812,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":243618,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44422334780511336,"acs":132606,"articleLive":2,"columnArticles":1198,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":298512,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47520541805686967,"acs":95426,"articleLive":2,"columnArticles":1073,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":200810,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.561633806653727,"acs":65974,"articleLive":2,"columnArticles":596,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":117468,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4596707602030956,"acs":104656,"articleLive":2,"columnArticles":992,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":227676,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.655318145648522,"acs":111178,"articleLive":2,"columnArticles":773,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":169655,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6340863619216793,"acs":132791,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":209421,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568252775742199,"acs":139139,"articleLive":2,"columnArticles":1303,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":162389,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5844845135960448,"acs":72351,"articleLive":2,"columnArticles":501,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":123786,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5976754726754727,"acs":73844,"articleLive":2,"columnArticles":533,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":123552,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28682494324126495,"acs":69358,"articleLive":2,"columnArticles":562,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":241813,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6942203558404244,"acs":119358,"articleLive":2,"columnArticles":694,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":171931,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7006924094905,"acs":118602,"articleLive":2,"columnArticles":694,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":169264,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20579919933051366,"acs":9099,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":44213,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5715882106439447,"acs":8184,"articleLive":2,"columnArticles":130,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":14318,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7821691875047503,"acs":10291,"articleLive":2,"columnArticles":153,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":13157,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6884881422924901,"acs":8361,"articleLive":2,"columnArticles":98,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":12144,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7152241558142215,"acs":6206,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":8677,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6618314496751803,"acs":7437,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":11237,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.45361042620641073,"acs":6439,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":14195,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5068137061835368,"acs":6434,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":12695,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5512672205279209,"acs":5242,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":9509,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4374713696747595,"acs":5730,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":13098,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5636533832575555,"acs":4215,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":7478,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.660430912140369,"acs":5119,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":7751,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.654424040066778,"acs":3528,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":5391,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5044422507403751,"acs":4088,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":8104,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6431543491182881,"acs":3246,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":5047,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4991538078646093,"acs":5014,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":10045,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5215428033866416,"acs":2772,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":5315,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5273394087575016,"acs":4745,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8998,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.473417423081457,"acs":4016,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":8483,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7084072366087265,"acs":3994,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5638,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5357595509686764,"acs":5918,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":11046,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5246796572901661,"acs":6920,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":13189,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7053647459551519,"acs":4970,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":7046,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7713063116605253,"acs":12978,"articleLive":2,"columnArticles":127,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":16826,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6051055333713634,"acs":4243,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":7012,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6529537366548043,"acs":4587,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":7025,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6141759776536313,"acs":7036,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":11456,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6289554746569589,"acs":2246,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3571,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29489351403678604,"acs":2437,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":8264,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5492150510839771,"acs":2204,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":4013,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5556020066889632,"acs":2658,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4784,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6010890567363428,"acs":3422,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5693,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7908059354087867,"acs":2718,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3437,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5745531514581373,"acs":2443,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":4252,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6819160387513455,"acs":2534,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3716,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5849535080304311,"acs":2768,"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":4732,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4388447653429603,"acs":3039,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6925,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7815743944636678,"acs":3614,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4624,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5161290322580645,"acs":2352,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4557,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5794834485267369,"acs":1593,"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":2749,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.779893924783028,"acs":3235,"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":4148,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8435929648241206,"acs":2686,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":3184,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6569288389513108,"acs":1754,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2670,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6486820428336079,"acs":3150,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4856,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8111622866431861,"acs":2994,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3691,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7283163265306123,"acs":2855,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3920,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6843820506392579,"acs":2730,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3989,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6837672281776417,"acs":1786,"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":2612,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.75356309924851,"acs":2908,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3859,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6174814814814815,"acs":2084,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":3375,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41345926800472255,"acs":1751,"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":4235,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7453254437869823,"acs":3149,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":4225,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6390493114171479,"acs":2877,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4502,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.851628895184136,"acs":2405,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2824,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8947368421052632,"acs":2040,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":2280,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7249277295975094,"acs":3260,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":4497,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3529255319148936,"acs":1327,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3760,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6045539033457249,"acs":1301,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":2152,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6249629410020753,"acs":2108,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":3373,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6700356718192628,"acs":2254,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":3364,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5332167832167832,"acs":1525,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2860,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7678571428571429,"acs":1763,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2296,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7276550998948476,"acs":1384,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1902,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6411509229098805,"acs":1181,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1842,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6382113821138211,"acs":1099,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1722,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6454388984509466,"acs":1125,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1743,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6635822868473232,"acs":1004,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1513,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5071653268088081,"acs":2902,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5722,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7237322515212982,"acs":35680,"articleLive":2,"columnArticles":378,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":49300,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6596508012437216,"acs":2758,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":4181,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.4988651838402179,"acs":1099,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":2203,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4217102246675837,"acs":3679,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":8724,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5404820766378244,"acs":1749,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":3236,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5536193029490617,"acs":2478,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4476,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7115165336374002,"acs":2496,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3508,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6773621174035191,"acs":4581,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6763,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5868771006868333,"acs":4016,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6843,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6303913738019169,"acs":3157,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":5008,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8583765112262521,"acs":2982,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3474,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8054679284963197,"acs":2298,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2853,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7814921408014168,"acs":3530,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4517,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6468464130958113,"acs":2687,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":4154,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8540339702760085,"acs":3218,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3768,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6753381893860562,"acs":2596,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3844,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.855781952897592,"acs":3234,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3779,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7673469387755102,"acs":2068,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2695,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6374549819927972,"acs":2124,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3332,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7398043919542351,"acs":4009,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":5419,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6227215980024969,"acs":2494,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":4005,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.515491998638066,"acs":1514,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2937,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7684449489216799,"acs":2031,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2643,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6841437632135307,"acs":1618,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2365,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5784810126582278,"acs":1371,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2370,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5917220235053654,"acs":1158,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1957,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6620618792099555,"acs":5799,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8759,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4940928270042194,"acs":1171,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2370,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5462857142857143,"acs":956,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1750,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7767065175472426,"acs":2014,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2593,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6907743419371326,"acs":2703,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3913,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.742344706911636,"acs":1697,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2286,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48770584254455224,"acs":2162,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4433,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5941845764854614,"acs":1410,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2373,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49433686518085496,"acs":2706,"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":5474,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5905194150277358,"acs":1171,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1983,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.698888655902705,"acs":3333,"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":4769,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5560344827586207,"acs":1032,"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":1856,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5450286309213951,"acs":1047,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1921,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5808491418247516,"acs":643,"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":1107,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6051640667025282,"acs":1125,"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":1859,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8368368368368369,"acs":1672,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1998,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6930232558139535,"acs":596,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":860,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5622529644268774,"acs":1138,"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":2024,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5845921450151057,"acs":1161,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1986,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4309656823623304,"acs":540,"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":1253,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.3010136624063464,"acs":683,"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":2269,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6355360755225894,"acs":3770,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5932,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6279961649089166,"acs":655,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":1043,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.7096774193548387,"acs":880,"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":1240,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.46256474650761265,"acs":2947,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":6371,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.719515685370391,"acs":90505,"articleLive":2,"columnArticles":1550,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":125786,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6477836079453673,"acs":58147,"articleLive":2,"columnArticles":1112,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":89763,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.579435368672571,"acs":44620,"articleLive":2,"columnArticles":494,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":77006,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5514515451056964,"acs":40669,"articleLive":2,"columnArticles":779,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":73749,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.331952235037819,"acs":32608,"articleLive":2,"columnArticles":558,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":98231,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4719258016166844,"acs":73678,"articleLive":2,"columnArticles":1176,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":156122,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7530533827363799,"acs":65850,"articleLive":2,"columnArticles":962,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":87444,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6216373192049978,"acs":43882,"articleLive":2,"columnArticles":492,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":70591,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5496549206981219,"acs":33131,"articleLive":2,"columnArticles":419,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":60276,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6824279438551377,"acs":63691,"articleLive":2,"columnArticles":693,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":93330,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.779813886900501,"acs":65364,"articleLive":2,"columnArticles":950,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83820,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8549095714915048,"acs":71803,"articleLive":2,"columnArticles":683,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83989,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.654459417755375,"acs":25448,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38884,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4664328279399563,"acs":37101,"articleLive":2,"columnArticles":524,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":79542,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4833759903990987,"acs":39472,"articleLive":2,"columnArticles":508,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":81659,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6850404767258826,"acs":48742,"articleLive":2,"columnArticles":435,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":71152,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5320579912392914,"acs":27451,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51594,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5374758220502901,"acs":11115,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20680,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6139353925960859,"acs":26037,"articleLive":2,"columnArticles":299,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42410,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38752528038242323,"acs":8431,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21756,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7126768259364944,"acs":23477,"articleLive":2,"columnArticles":343,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32942,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5430355284673704,"acs":14612,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26908,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5878064585808402,"acs":10885,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18518,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.531766181785597,"acs":17803,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33479,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7901736995271008,"acs":34755,"articleLive":2,"columnArticles":423,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43984,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8065066773772467,"acs":24096,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29877,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5847251585623678,"acs":33189,"articleLive":2,"columnArticles":385,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56760,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.351706901760457,"acs":25612,"articleLive":2,"columnArticles":324,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72822,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5903297474275023,"acs":20194,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":34208,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7169238661137948,"acs":16771,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23393,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47631260240792195,"acs":6686,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":14037,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7167105263157895,"acs":16341,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22800,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4863239413412424,"acs":17709,"articleLive":2,"columnArticles":259,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36414,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5048595252004886,"acs":9506,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18829,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6902599715099715,"acs":7753,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11232,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3867190263921319,"acs":10931,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":28266,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3857308584686775,"acs":5320,"articleLive":2,"columnArticles":138,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13792,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5273833671399595,"acs":11700,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22185,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7043344604980019,"acs":11456,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16265,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5525015441630636,"acs":3578,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6476,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36321732143612295,"acs":42945,"articleLive":2,"columnArticles":475,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":118235,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36091719001022343,"acs":12356,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":34235,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6757819087524485,"acs":52094,"articleLive":2,"columnArticles":435,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":77087,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.819927831451519,"acs":21132,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25773,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6793330027274982,"acs":21918,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":32264,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6563606646690275,"acs":24095,"articleLive":2,"columnArticles":268,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36710,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8135350797952424,"acs":21614,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26568,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185522323363676,"acs":16577,"articleLive":2,"columnArticles":240,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":23070,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8135436336036136,"acs":21973,"articleLive":2,"columnArticles":353,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":27009,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5584473407269489,"acs":13797,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24706,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49465852175675284,"acs":34172,"articleLive":2,"columnArticles":329,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":69082,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7612203389830509,"acs":16842,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22125,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5014901504688523,"acs":6899,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13757,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5339274347549332,"acs":4194,"articleLive":2,"columnArticles":75,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7855,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5549507365135109,"acs":56888,"articleLive":2,"columnArticles":2374,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102510,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7397132036934598,"acs":34768,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":47002,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3948085005623631,"acs":13339,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33786,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5536651070466468,"acs":19525,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35265,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4550132109581421,"acs":13088,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28764,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6233297701763763,"acs":4665,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7484,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.667610953729934,"acs":7777,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11649,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.831798509648238,"acs":25562,"articleLive":2,"columnArticles":407,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30731,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7663157894736842,"acs":14924,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19475,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4421164118622214,"acs":9601,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21716,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46016012199771256,"acs":7242,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15738,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4640508923234566,"acs":10869,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23422,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4244840371427634,"acs":12937,"articleLive":2,"columnArticles":192,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30477,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7328774759374187,"acs":19721,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26909,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3742737249838606,"acs":2319,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6196,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5482335254322225,"acs":2188,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3991,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6806108464399921,"acs":10429,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15323,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44107223909779686,"acs":50531,"articleLive":2,"columnArticles":585,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114564,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4297145328719723,"acs":1987,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4624,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5500531672489747,"acs":3621,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6583,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5028917806695584,"acs":9043,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17982,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4539269695054035,"acs":15079,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":33219,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6002038454229792,"acs":34744,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57887,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3440546470335437,"acs":15211,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44211,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6113612643506784,"acs":20502,"articleLive":2,"columnArticles":363,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33535,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7220781325984763,"acs":8909,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12338,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.464420380933965,"acs":9607,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20686,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5849096705632306,"acs":2752,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4705,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47223665973665974,"acs":10903,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":23088,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5457295433805387,"acs":32293,"articleLive":2,"columnArticles":260,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":59174,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38807580942353254,"acs":14743,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37990,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5971000483325278,"acs":12354,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20690,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6420364590401231,"acs":28387,"articleLive":2,"columnArticles":458,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":44214,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38759907413901945,"acs":5526,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14257,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45,"acs":4707,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10460,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.411938202247191,"acs":8799,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21360,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27183016295526846,"acs":8374,"articleLive":2,"columnArticles":123,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30806,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5488602500096753,"acs":14182,"articleLive":2,"columnArticles":148,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25839,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5704687127431277,"acs":66989,"articleLive":2,"columnArticles":929,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117428,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6870506999621642,"acs":14527,"articleLive":2,"columnArticles":264,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21144,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6323076923076923,"acs":20961,"articleLive":2,"columnArticles":293,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33150,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5526557494567531,"acs":24670,"articleLive":2,"columnArticles":272,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44639,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5968604543633057,"acs":77451,"articleLive":2,"columnArticles":761,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":129764,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4029291553133515,"acs":5915,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14680,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5185539597588239,"acs":61235,"articleLive":2,"columnArticles":1142,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":118088,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44503200667965487,"acs":7995,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17965,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4451054955839058,"acs":7257,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16304,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5791326293418344,"acs":8720,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":15057,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.571283832682009,"acs":3947,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6909,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359202471537273,"acs":44461,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69916,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3754211590296496,"acs":8914,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23744,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37823106780080934,"acs":4580,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12109,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5251261064052536,"acs":11035,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":21014,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5028553299492385,"acs":1585,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3152,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3429352602284933,"acs":3512,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10241,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/DesignAddAndSearchWordsDataStructure.md b/src/main/java/leetcode/editor/cn/doc/content/DesignAddAndSearchWordsDataStructure.md new file mode 100644 index 0000000..aab7a65 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/DesignAddAndSearchWordsDataStructure.md @@ -0,0 +1,43 @@ +

请你设计一个数据结构，支持 添加新单词 和 查找字符串是否与任何先前添加的字符串匹配 。

+ +

实现词典类 WordDictionary ：

+ + + +

 

+ +

示例：

+ +
+输入：
+["WordDictionary","addWord","addWord","addWord","search","search","search","search"]
+[[],["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]]
+输出：
+[null,null,null,null,false,true,true,true]
+
+解释：
+WordDictionary wordDictionary = new WordDictionary();
+wordDictionary.addWord("bad");
+wordDictionary.addWord("dad");
+wordDictionary.addWord("mad");
+wordDictionary.search("pad"); // return False
+wordDictionary.search("bad"); // return True
+wordDictionary.search(".ad"); // return True
+wordDictionary.search("b.."); // return True
+
+ +

 

+ +

提示：

+ + +
Related Topics
  • 深度优先搜索
  • 设计
  • 字典树
  • 字符串

  • 👍 328
  • 👎 0
    • \ No newline at end of file